/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy FOX -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/floats-esbmc-regression/nearbyint.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 09:27:58,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 09:27:58,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-06 09:27:58,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 09:27:58,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 09:27:58,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 09:27:58,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 09:27:58,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 09:27:58,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 09:27:58,979 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 09:27:58,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 09:27:58,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 09:27:58,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 09:27:58,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 09:27:58,980 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 09:27:58,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 09:27:58,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 09:27:58,981 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 09:27:58,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 09:27:58,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 09:27:58,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 09:27:58,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 09:27:58,984 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 09:27:58,984 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 09:27:58,984 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 09:27:58,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 09:27:58,985 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 09:27:58,985 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 09:27:58,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 09:27:58,985 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 09:27:58,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 09:27:58,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 09:27:58,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 09:27:58,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 09:27:58,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 09:27:58,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 09:27:58,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 09:27:58,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 09:27:58,988 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 09:27:58,988 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 09:27:58,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 09:27:58,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 09:27:58,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 09:27:58,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 09:27:58,990 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FOX [2024-11-06 09:27:59,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 09:27:59,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 09:27:59,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 09:27:59,243 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 09:27:59,244 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 09:27:59,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/nearbyint.i [2024-11-06 09:28:00,659 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 09:28:00,906 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 09:28:00,910 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/nearbyint.i [2024-11-06 09:28:00,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707ab3cb7/09bc2206df8c46d29ec55c916c96dd94/FLAG8ffbefba8 [2024-11-06 09:28:00,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707ab3cb7/09bc2206df8c46d29ec55c916c96dd94 [2024-11-06 09:28:00,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 09:28:00,944 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 09:28:00,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 09:28:00,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 09:28:00,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 09:28:00,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:28:00" (1/1) ... [2024-11-06 09:28:00,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@435853bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:00, skipping insertion in model container [2024-11-06 09:28:00,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:28:00" (1/1) ... [2024-11-06 09:28:01,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 09:28:01,421 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/nearbyint.i[38068,38081] [2024-11-06 09:28:01,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 09:28:01,459 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 09:28:01,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/nearbyint.i[38068,38081] [2024-11-06 09:28:01,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 09:28:01,610 INFO L204 MainTranslator]: Completed translation [2024-11-06 09:28:01,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:01 WrapperNode [2024-11-06 09:28:01,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 09:28:01,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 09:28:01,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 09:28:01,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 09:28:01,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:01" (1/1) ... [2024-11-06 09:28:01,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:01" (1/1) ... [2024-11-06 09:28:01,670 INFO L138 Inliner]: procedures = 463, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2024-11-06 09:28:01,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 09:28:01,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 09:28:01,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 09:28:01,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 09:28:01,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:01" (1/1) ... [2024-11-06 09:28:01,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:01" (1/1) ... [2024-11-06 09:28:01,684 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:01" (1/1) ... [2024-11-06 09:28:01,701 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2024-11-06 09:28:01,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:01" (1/1) ... [2024-11-06 09:28:01,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:01" (1/1) ... [2024-11-06 09:28:01,716 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:01" (1/1) ... [2024-11-06 09:28:01,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:01" (1/1) ... [2024-11-06 09:28:01,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:01" (1/1) ... [2024-11-06 09:28:01,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:01" (1/1) ... [2024-11-06 09:28:01,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 09:28:01,741 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 09:28:01,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 09:28:01,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 09:28:01,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:01" (1/1) ... [2024-11-06 09:28:01,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 09:28:01,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 09:28:01,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 09:28:01,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 09:28:01,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 09:28:01,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 09:28:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 09:28:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-06 09:28:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-06 09:28:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-06 09:28:01,814 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-06 09:28:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 09:28:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 09:28:01,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 09:28:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-06 09:28:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-06 09:28:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 09:28:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2024-11-06 09:28:01,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2024-11-06 09:28:01,960 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 09:28:01,963 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 09:28:02,241 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-06 09:28:02,242 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 09:28:02,256 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 09:28:02,257 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 09:28:02,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:28:02 BoogieIcfgContainer [2024-11-06 09:28:02,257 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 09:28:02,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 09:28:02,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 09:28:02,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 09:28:02,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:28:00" (1/3) ... [2024-11-06 09:28:02,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3354070d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:28:02, skipping insertion in model container [2024-11-06 09:28:02,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:28:01" (2/3) ... [2024-11-06 09:28:02,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3354070d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:28:02, skipping insertion in model container [2024-11-06 09:28:02,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:28:02" (3/3) ... [2024-11-06 09:28:02,267 INFO L112 eAbstractionObserver]: Analyzing ICFG nearbyint.i [2024-11-06 09:28:02,284 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 09:28:02,284 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 09:28:02,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 09:28:02,355 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@ab34dc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 09:28:02,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 09:28:02,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 43 states have internal predecessors, (50), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-06 09:28:02,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-06 09:28:02,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 09:28:02,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 09:28:02,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 09:28:02,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 09:28:02,369 INFO L85 PathProgramCache]: Analyzing trace with hash 60099875, now seen corresponding path program 1 times [2024-11-06 09:28:02,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 09:28:02,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487271333] [2024-11-06 09:28:02,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 09:28:02,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 09:28:02,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 09:28:02,382 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 09:28:02,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-06 09:28:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 09:28:02,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 09:28:02,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 09:28:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 09:28:02,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 09:28:02,639 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 09:28:02,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487271333] [2024-11-06 09:28:02,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487271333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 09:28:02,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 09:28:02,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 09:28:02,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508331298] [2024-11-06 09:28:02,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 09:28:02,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 09:28:02,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 09:28:02,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 09:28:02,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 09:28:02,674 INFO L87 Difference]: Start difference. First operand has 63 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 43 states have internal predecessors, (50), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 09:28:02,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 09:28:02,972 INFO L93 Difference]: Finished difference Result 143 states and 238 transitions. [2024-11-06 09:28:02,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 09:28:02,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-06 09:28:02,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 09:28:02,987 INFO L225 Difference]: With dead ends: 143 [2024-11-06 09:28:02,988 INFO L226 Difference]: Without dead ends: 78 [2024-11-06 09:28:02,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-06 09:28:02,997 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 12 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 09:28:02,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 388 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 09:28:03,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-06 09:28:03,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2024-11-06 09:28:03,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 43 states have internal predecessors, (49), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 18 states have call predecessors, (21), 20 states have call successors, (21) [2024-11-06 09:28:03,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2024-11-06 09:28:03,053 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 13 [2024-11-06 09:28:03,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 09:28:03,054 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2024-11-06 09:28:03,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 09:28:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2024-11-06 09:28:03,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-06 09:28:03,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 09:28:03,055 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 09:28:03,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-06 09:28:03,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 09:28:03,257 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 09:28:03,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 09:28:03,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1942099019, now seen corresponding path program 1 times [2024-11-06 09:28:03,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 09:28:03,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791048191] [2024-11-06 09:28:03,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 09:28:03,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 09:28:03,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 09:28:03,263 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 09:28:03,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-06 09:28:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 09:28:03,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 09:28:03,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 09:28:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 09:28:03,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 09:28:03,440 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 09:28:03,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791048191] [2024-11-06 09:28:03,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791048191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 09:28:03,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 09:28:03,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 09:28:03,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365881444] [2024-11-06 09:28:03,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 09:28:03,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 09:28:03,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 09:28:03,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 09:28:03,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 09:28:03,444 INFO L87 Difference]: Start difference. First operand 64 states and 91 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 09:28:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 09:28:03,665 INFO L93 Difference]: Finished difference Result 137 states and 198 transitions. [2024-11-06 09:28:03,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 09:28:03,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-06 09:28:03,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 09:28:03,671 INFO L225 Difference]: With dead ends: 137 [2024-11-06 09:28:03,671 INFO L226 Difference]: Without dead ends: 75 [2024-11-06 09:28:03,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-06 09:28:03,674 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 10 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 09:28:03,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 372 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 09:28:03,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-06 09:28:03,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2024-11-06 09:28:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.25) internal successors, (50), 44 states have internal predecessors, (50), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 18 states have call predecessors, (21), 20 states have call successors, (21) [2024-11-06 09:28:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 92 transitions. [2024-11-06 09:28:03,691 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 92 transitions. Word has length 14 [2024-11-06 09:28:03,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 09:28:03,692 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 92 transitions. [2024-11-06 09:28:03,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 09:28:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 92 transitions. [2024-11-06 09:28:03,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-06 09:28:03,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 09:28:03,693 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 09:28:03,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-06 09:28:03,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 09:28:03,895 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 09:28:03,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 09:28:03,895 INFO L85 PathProgramCache]: Analyzing trace with hash -39663284, now seen corresponding path program 1 times [2024-11-06 09:28:03,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 09:28:03,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685757492] [2024-11-06 09:28:03,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 09:28:03,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 09:28:03,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 09:28:03,899 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 09:28:03,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-06 09:28:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 09:28:03,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 09:28:03,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 09:28:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 09:28:04,013 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 09:28:04,013 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 09:28:04,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685757492] [2024-11-06 09:28:04,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685757492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 09:28:04,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 09:28:04,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 09:28:04,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933771773] [2024-11-06 09:28:04,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 09:28:04,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 09:28:04,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 09:28:04,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 09:28:04,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 09:28:04,016 INFO L87 Difference]: Start difference. First operand 65 states and 92 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 09:28:04,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 09:28:04,220 INFO L93 Difference]: Finished difference Result 148 states and 217 transitions. [2024-11-06 09:28:04,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 09:28:04,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-06 09:28:04,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 09:28:04,222 INFO L225 Difference]: With dead ends: 148 [2024-11-06 09:28:04,222 INFO L226 Difference]: Without dead ends: 85 [2024-11-06 09:28:04,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-06 09:28:04,227 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 13 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 09:28:04,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 431 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 09:28:04,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-06 09:28:04,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2024-11-06 09:28:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 48 states have internal predecessors, (55), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (22), 19 states have call predecessors, (22), 20 states have call successors, (22) [2024-11-06 09:28:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions. [2024-11-06 09:28:04,244 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 98 transitions. Word has length 14 [2024-11-06 09:28:04,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 09:28:04,245 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 98 transitions. [2024-11-06 09:28:04,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 09:28:04,245 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 98 transitions. [2024-11-06 09:28:04,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 09:28:04,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 09:28:04,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 09:28:04,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-06 09:28:04,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 09:28:04,447 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 09:28:04,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 09:28:04,448 INFO L85 PathProgramCache]: Analyzing trace with hash 158343587, now seen corresponding path program 1 times [2024-11-06 09:28:04,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 09:28:04,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856505485] [2024-11-06 09:28:04,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 09:28:04,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 09:28:04,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 09:28:04,452 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 09:28:04,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-06 09:28:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 09:28:04,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 09:28:04,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 09:28:04,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 09:28:04,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 09:28:04,569 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 09:28:04,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856505485] [2024-11-06 09:28:04,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856505485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 09:28:04,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 09:28:04,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 09:28:04,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569278312] [2024-11-06 09:28:04,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 09:28:04,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 09:28:04,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 09:28:04,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 09:28:04,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 09:28:04,576 INFO L87 Difference]: Start difference. First operand 71 states and 98 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 09:28:04,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 09:28:04,687 INFO L93 Difference]: Finished difference Result 163 states and 233 transitions. [2024-11-06 09:28:04,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 09:28:04,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-06 09:28:04,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 09:28:04,690 INFO L225 Difference]: With dead ends: 163 [2024-11-06 09:28:04,692 INFO L226 Difference]: Without dead ends: 94 [2024-11-06 09:28:04,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 09:28:04,695 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 15 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 09:28:04,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 300 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 09:28:04,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-06 09:28:04,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2024-11-06 09:28:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 50 states have internal predecessors, (56), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (24), 19 states have call predecessors, (24), 21 states have call successors, (24) [2024-11-06 09:28:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2024-11-06 09:28:04,714 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 15 [2024-11-06 09:28:04,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 09:28:04,714 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2024-11-06 09:28:04,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 09:28:04,715 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2024-11-06 09:28:04,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 09:28:04,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 09:28:04,717 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 09:28:04,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-06 09:28:04,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 09:28:04,918 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 09:28:04,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 09:28:04,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1150558910, now seen corresponding path program 1 times [2024-11-06 09:28:04,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 09:28:04,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132403325] [2024-11-06 09:28:04,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 09:28:04,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 09:28:04,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 09:28:04,920 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 09:28:04,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-06 09:28:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 09:28:04,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 09:28:04,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 09:28:05,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 09:28:05,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 09:28:05,030 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 09:28:05,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132403325] [2024-11-06 09:28:05,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132403325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 09:28:05,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 09:28:05,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 09:28:05,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729014480] [2024-11-06 09:28:05,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 09:28:05,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 09:28:05,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 09:28:05,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 09:28:05,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 09:28:05,033 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 09:28:05,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 09:28:05,125 INFO L93 Difference]: Finished difference Result 161 states and 229 transitions. [2024-11-06 09:28:05,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 09:28:05,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-06 09:28:05,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 09:28:05,127 INFO L225 Difference]: With dead ends: 161 [2024-11-06 09:28:05,127 INFO L226 Difference]: Without dead ends: 92 [2024-11-06 09:28:05,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 09:28:05,128 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 16 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 09:28:05,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 305 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 09:28:05,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-06 09:28:05,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 73. [2024-11-06 09:28:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 50 states have internal predecessors, (56), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 19 states have call predecessors, (23), 21 states have call successors, (23) [2024-11-06 09:28:05,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2024-11-06 09:28:05,139 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 15 [2024-11-06 09:28:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 09:28:05,139 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2024-11-06 09:28:05,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 09:28:05,140 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2024-11-06 09:28:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 09:28:05,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 09:28:05,140 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 09:28:05,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-06 09:28:05,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 09:28:05,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 09:28:05,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 09:28:05,344 INFO L85 PathProgramCache]: Analyzing trace with hash 715308360, now seen corresponding path program 1 times [2024-11-06 09:28:05,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 09:28:05,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438624450] [2024-11-06 09:28:05,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 09:28:05,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 09:28:05,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 09:28:05,346 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 09:28:05,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-06 09:28:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 09:28:05,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 09:28:05,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 09:28:05,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 09:28:05,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 09:28:05,460 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 09:28:05,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438624450] [2024-11-06 09:28:05,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438624450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 09:28:05,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 09:28:05,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 09:28:05,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547123823] [2024-11-06 09:28:05,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 09:28:05,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 09:28:05,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 09:28:05,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 09:28:05,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 09:28:05,463 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 09:28:05,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 09:28:05,666 INFO L93 Difference]: Finished difference Result 163 states and 234 transitions. [2024-11-06 09:28:05,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 09:28:05,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-06 09:28:05,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 09:28:05,668 INFO L225 Difference]: With dead ends: 163 [2024-11-06 09:28:05,668 INFO L226 Difference]: Without dead ends: 94 [2024-11-06 09:28:05,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-06 09:28:05,671 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 14 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 09:28:05,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 373 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 09:28:05,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-06 09:28:05,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 78. [2024-11-06 09:28:05,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.2) internal successors, (60), 54 states have internal predecessors, (60), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (25), 19 states have call predecessors, (25), 21 states have call successors, (25) [2024-11-06 09:28:05,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 107 transitions. [2024-11-06 09:28:05,692 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 107 transitions. Word has length 15 [2024-11-06 09:28:05,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 09:28:05,692 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 107 transitions. [2024-11-06 09:28:05,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 09:28:05,693 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 107 transitions. [2024-11-06 09:28:05,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-06 09:28:05,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 09:28:05,693 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 09:28:05,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-06 09:28:05,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 09:28:05,900 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 09:28:05,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 09:28:05,901 INFO L85 PathProgramCache]: Analyzing trace with hash 778725574, now seen corresponding path program 1 times [2024-11-06 09:28:05,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 09:28:05,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865708008] [2024-11-06 09:28:05,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 09:28:05,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 09:28:05,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 09:28:05,903 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 09:28:05,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-06 09:28:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 09:28:05,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 09:28:05,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 09:28:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 09:28:06,060 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 09:28:06,060 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 09:28:06,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865708008] [2024-11-06 09:28:06,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865708008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 09:28:06,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 09:28:06,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 09:28:06,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650750668] [2024-11-06 09:28:06,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 09:28:06,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 09:28:06,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 09:28:06,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 09:28:06,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 09:28:06,062 INFO L87 Difference]: Start difference. First operand 78 states and 107 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 09:28:06,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 09:28:06,214 INFO L93 Difference]: Finished difference Result 162 states and 223 transitions. [2024-11-06 09:28:06,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 09:28:06,214 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-06 09:28:06,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 09:28:06,215 INFO L225 Difference]: With dead ends: 162 [2024-11-06 09:28:06,216 INFO L226 Difference]: Without dead ends: 88 [2024-11-06 09:28:06,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-06 09:28:06,217 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 10 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 09:28:06,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 460 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 09:28:06,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-06 09:28:06,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2024-11-06 09:28:06,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 57 states have internal predecessors, (64), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (25), 20 states have call predecessors, (25), 21 states have call successors, (25) [2024-11-06 09:28:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2024-11-06 09:28:06,229 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 111 transitions. Word has length 16 [2024-11-06 09:28:06,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 09:28:06,230 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 111 transitions. [2024-11-06 09:28:06,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 09:28:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2024-11-06 09:28:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-06 09:28:06,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 09:28:06,231 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 09:28:06,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-06 09:28:06,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 09:28:06,434 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 09:28:06,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 09:28:06,435 INFO L85 PathProgramCache]: Analyzing trace with hash -2097712175, now seen corresponding path program 1 times [2024-11-06 09:28:06,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 09:28:06,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623752968] [2024-11-06 09:28:06,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 09:28:06,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 09:28:06,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 09:28:06,437 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 09:28:06,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-06 09:28:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 09:28:06,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 09:28:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 09:28:06,515 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-06 09:28:06,515 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 09:28:06,516 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 09:28:06,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-06 09:28:06,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 09:28:06,721 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 09:28:06,738 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 09:28:06,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:28:06 BoogieIcfgContainer [2024-11-06 09:28:06,741 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 09:28:06,741 INFO L158 Benchmark]: Toolchain (without parser) took 5797.43ms. Allocated memory is still 372.2MB. Free memory was 319.3MB in the beginning and 313.4MB in the end (delta: 6.0MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2024-11-06 09:28:06,742 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 207.6MB. Free memory is still 157.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-06 09:28:06,742 INFO L158 Benchmark]: CACSL2BoogieTranslator took 665.92ms. Allocated memory is still 372.2MB. Free memory was 318.8MB in the beginning and 268.0MB in the end (delta: 50.9MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2024-11-06 09:28:06,742 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.91ms. Allocated memory is still 372.2MB. Free memory was 268.0MB in the beginning and 264.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-06 09:28:06,742 INFO L158 Benchmark]: Boogie Preprocessor took 68.40ms. Allocated memory is still 372.2MB. Free memory was 264.8MB in the beginning and 262.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-06 09:28:06,743 INFO L158 Benchmark]: RCFGBuilder took 516.90ms. Allocated memory is still 372.2MB. Free memory was 262.2MB in the beginning and 242.8MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2024-11-06 09:28:06,743 INFO L158 Benchmark]: TraceAbstraction took 4481.55ms. Allocated memory is still 372.2MB. Free memory was 242.3MB in the beginning and 313.4MB in the end (delta: -71.1MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-06 09:28:06,744 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 207.6MB. Free memory is still 157.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 665.92ms. Allocated memory is still 372.2MB. Free memory was 318.8MB in the beginning and 268.0MB in the end (delta: 50.9MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.91ms. Allocated memory is still 372.2MB. Free memory was 268.0MB in the beginning and 264.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.40ms. Allocated memory is still 372.2MB. Free memory was 264.8MB in the beginning and 262.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 516.90ms. Allocated memory is still 372.2MB. Free memory was 262.2MB in the beginning and 242.8MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 4481.55ms. Allocated memory is still 372.2MB. Free memory was 242.3MB in the beginning and 313.4MB in the end (delta: -71.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 997]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of nearbyint at line 1006. Possible FailurePath: [L1000] int const modes[] = {0x400, 0, 0xc00, 0x800}; [L1000] int const modes[] = {0x400, 0, 0xc00, 0x800}; [L1000] int const modes[] = {0x400, 0, 0xc00, 0x800}; [L1000] int const modes[] = {0x400, 0, 0xc00, 0x800}; [L1000] int const modes[] = {0x400, 0, 0xc00, 0x800}; [L1002] int i = 0; VAL [i=0, modes={3:0}] [L1002] COND TRUE i < sizeof(modes) / sizeof(int) [L1003] EXPR modes[i] [L1003] FCALL fesetround(modes[i]) VAL [i=0, modes={3:0}] [L1004] modes[i] [L1005] case 0x400: [L1006] CALL __VERIFIER_assert(nearbyint(12.9) == 12.) VAL [\old(cond)=0] [L997] COND TRUE !(cond) VAL [\old(cond)=0] [L997] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 90 mSDsluCounter, 2629 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2022 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 510 IncrementalHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 607 mSDtfsCounter, 510 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 100 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 268 SizeOfPredicates, 38 NumberOfNonLiveVariables, 324 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-06 09:28:06,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...