/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/square_4+soft_float_4-3a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-22 02:47:13,072 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-22 02:47:13,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-22 02:47:13,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-22 02:47:13,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-22 02:47:13,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-22 02:47:13,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-22 02:47:13,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-22 02:47:13,131 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-22 02:47:13,132 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-22 02:47:13,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-22 02:47:13,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-22 02:47:13,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-22 02:47:13,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-22 02:47:13,137 INFO L153 SettingsManager]: * Use SBE=true [2023-12-22 02:47:13,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-22 02:47:13,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-22 02:47:13,138 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-22 02:47:13,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-22 02:47:13,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-22 02:47:13,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-22 02:47:13,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-22 02:47:13,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-22 02:47:13,148 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-22 02:47:13,148 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-22 02:47:13,149 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-22 02:47:13,149 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-22 02:47:13,149 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-22 02:47:13,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-22 02:47:13,149 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-22 02:47:13,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-22 02:47:13,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-22 02:47:13,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-22 02:47:13,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-22 02:47:13,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:47:13,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-22 02:47:13,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-22 02:47:13,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-22 02:47:13,151 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-22 02:47:13,151 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-22 02:47:13,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-22 02:47:13,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-22 02:47:13,152 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-22 02:47:13,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-22 02:47:13,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-22 02:47:13,153 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-22 02:47:13,153 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 [2023-12-22 02:47:13,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-22 02:47:13,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-22 02:47:13,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-22 02:47:13,375 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-22 02:47:13,377 INFO L274 PluginConnector]: CDTParser initialized [2023-12-22 02:47:13,378 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/square_4+soft_float_4-3a.c.cil.c [2023-12-22 02:47:14,438 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-22 02:47:14,596 INFO L384 CDTParser]: Found 1 translation units. [2023-12-22 02:47:14,596 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/square_4+soft_float_4-3a.c.cil.c [2023-12-22 02:47:14,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b013515a8/01c2b554682e4d098742518897ad684a/FLAG8a3d079e0 [2023-12-22 02:47:14,613 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b013515a8/01c2b554682e4d098742518897ad684a [2023-12-22 02:47:14,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-22 02:47:14,616 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-22 02:47:14,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-22 02:47:14,617 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-22 02:47:14,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-22 02:47:14,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:47:14" (1/1) ... [2023-12-22 02:47:14,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5527421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:47:14, skipping insertion in model container [2023-12-22 02:47:14,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:47:14" (1/1) ... [2023-12-22 02:47:14,641 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-22 02:47:14,767 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/square_4+soft_float_4-3a.c.cil.c[1999,2012] [2023-12-22 02:47:14,772 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/square_4+soft_float_4-3a.c.cil.c[2368,2381] [2023-12-22 02:47:14,800 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:47:14,810 INFO L202 MainTranslator]: Completed pre-run [2023-12-22 02:47:14,820 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/square_4+soft_float_4-3a.c.cil.c[1999,2012] [2023-12-22 02:47:14,822 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/square_4+soft_float_4-3a.c.cil.c[2368,2381] [2023-12-22 02:47:14,839 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:47:14,850 INFO L206 MainTranslator]: Completed translation [2023-12-22 02:47:14,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:47:14 WrapperNode [2023-12-22 02:47:14,850 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-22 02:47:14,851 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-22 02:47:14,851 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-22 02:47:14,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-22 02:47:14,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:47:14" (1/1) ... [2023-12-22 02:47:14,868 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:47:14" (1/1) ... [2023-12-22 02:47:14,890 INFO L138 Inliner]: procedures = 28, calls = 20, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 73 [2023-12-22 02:47:14,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-22 02:47:14,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-22 02:47:14,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-22 02:47:14,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-22 02:47:14,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:47:14" (1/1) ... [2023-12-22 02:47:14,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:47:14" (1/1) ... [2023-12-22 02:47:14,901 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:47:14" (1/1) ... [2023-12-22 02:47:14,909 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-22 02:47:14,910 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:47:14" (1/1) ... [2023-12-22 02:47:14,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:47:14" (1/1) ... [2023-12-22 02:47:14,919 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:47:14" (1/1) ... [2023-12-22 02:47:14,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:47:14" (1/1) ... [2023-12-22 02:47:14,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:47:14" (1/1) ... [2023-12-22 02:47:14,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:47:14" (1/1) ... [2023-12-22 02:47:14,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-22 02:47:14,935 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-22 02:47:14,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-22 02:47:14,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-22 02:47:14,935 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:47:14" (1/1) ... [2023-12-22 02:47:14,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:47:14,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-22 02:47:14,969 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) [2023-12-22 02:47:14,970 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 [2023-12-22 02:47:14,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-22 02:47:14,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-22 02:47:14,988 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-12-22 02:47:14,988 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-12-22 02:47:14,988 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2023-12-22 02:47:14,989 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2023-12-22 02:47:14,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-22 02:47:14,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-22 02:47:14,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-22 02:47:14,989 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-22 02:47:15,043 INFO L241 CfgBuilder]: Building ICFG [2023-12-22 02:47:15,045 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-22 02:47:18,898 INFO L282 CfgBuilder]: Performing block encoding [2023-12-22 02:47:18,914 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-22 02:47:18,914 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-22 02:47:18,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:47:18 BoogieIcfgContainer [2023-12-22 02:47:18,915 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-22 02:47:18,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-22 02:47:18,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-22 02:47:18,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-22 02:47:18,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 02:47:14" (1/3) ... [2023-12-22 02:47:18,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709bab32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:47:18, skipping insertion in model container [2023-12-22 02:47:18,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:47:14" (2/3) ... [2023-12-22 02:47:18,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709bab32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:47:18, skipping insertion in model container [2023-12-22 02:47:18,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:47:18" (3/3) ... [2023-12-22 02:47:18,920 INFO L112 eAbstractionObserver]: Analyzing ICFG square_4+soft_float_4-3a.c.cil.c [2023-12-22 02:47:18,932 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-22 02:47:18,933 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-22 02:47:18,963 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-22 02:47:18,968 INFO L357 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, mHoare=true, 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;@67f49378, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-22 02:47:18,968 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-22 02:47:18,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 44 states have internal predecessors, (65), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-22 02:47:18,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-22 02:47:18,976 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:47:18,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-22 02:47:18,977 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:47:18,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:47:18,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2011176783, now seen corresponding path program 1 times [2023-12-22 02:47:18,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:47:18,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684448524] [2023-12-22 02:47:18,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:47:18,989 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 [2023-12-22 02:47:18,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:47:18,991 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) [2023-12-22 02:47:18,992 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 [2023-12-22 02:47:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:47:19,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-22 02:47:19,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:47:19,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:47:19,389 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:47:19,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:47:19,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684448524] [2023-12-22 02:47:19,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684448524] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:47:19,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:47:19,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:47:19,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996902234] [2023-12-22 02:47:19,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:47:19,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-22 02:47:19,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:47:19,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-22 02:47:19,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-22 02:47:19,413 INFO L87 Difference]: Start difference. First operand has 57 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 44 states have internal predecessors, (65), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 02:47:19,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:47:19,457 INFO L93 Difference]: Finished difference Result 110 states and 168 transitions. [2023-12-22 02:47:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-22 02:47:19,459 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-22 02:47:19,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:47:19,464 INFO L225 Difference]: With dead ends: 110 [2023-12-22 02:47:19,464 INFO L226 Difference]: Without dead ends: 53 [2023-12-22 02:47:19,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-22 02:47:19,469 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:47:19,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:47:19,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-22 02:47:19,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-22 02:47:19,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 41 states have internal predecessors, (54), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-22 02:47:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2023-12-22 02:47:19,495 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 6 [2023-12-22 02:47:19,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:47:19,495 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2023-12-22 02:47:19,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 02:47:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2023-12-22 02:47:19,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-22 02:47:19,496 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:47:19,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-22 02:47:19,509 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 (2)] Ended with exit code 0 [2023-12-22 02:47:19,697 WARN L477 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 [2023-12-22 02:47:19,697 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:47:19,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:47:19,698 INFO L85 PathProgramCache]: Analyzing trace with hash 2011236365, now seen corresponding path program 1 times [2023-12-22 02:47:19,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:47:19,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314763822] [2023-12-22 02:47:19,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:47:19,699 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 [2023-12-22 02:47:19,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:47:19,700 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) [2023-12-22 02:47:19,702 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 [2023-12-22 02:57:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:57:33,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-22 02:57:33,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:57:41,928 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 02:57:50,174 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 02:57:58,364 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 02:58:02,471 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0) (= (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) |c_ULTIMATE.start_main1_~result~0#1|) (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-22 02:58:18,967 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 02:58:27,155 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 02:58:34,426 WARN L293 SmtUtils]: Spent 7.27s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 02:58:46,824 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 02:58:55,019 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 02:59:03,322 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 02:59:07,502 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (not (fp.lt (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 34961.0 25000.0)))) (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0))) (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (_ +zero 8 24))) (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0))))) is different from false [2023-12-22 02:59:11,570 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (not (fp.lt (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 34961.0 25000.0)))) (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0))) (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (_ +zero 8 24))) (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0))))) is different from true [2023-12-22 02:59:11,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:59:11,570 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:59:11,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:59:11,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314763822] [2023-12-22 02:59:11,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314763822] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:59:11,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:59:11,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-22 02:59:11,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220063898] [2023-12-22 02:59:11,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:59:11,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-22 02:59:11,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:59:11,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-22 02:59:11,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=12, Unknown=3, NotChecked=14, Total=42 [2023-12-22 02:59:11,573 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 02:59:15,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 02:59:19,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 02:59:24,154 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (and (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0) (= (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) |c_ULTIMATE.start_main1_~result~0#1|) (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)))) (fp.lt |c_ULTIMATE.start_main1_~IN~0#1| .cse0) (fp.geq |c_ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-22 02:59:24,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:59:24,540 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2023-12-22 02:59:24,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 02:59:24,541 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-22 02:59:24,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:59:24,542 INFO L225 Difference]: With dead ends: 53 [2023-12-22 02:59:24,542 INFO L226 Difference]: Without dead ends: 48 [2023-12-22 02:59:24,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=20, Invalid=18, Unknown=4, NotChecked=30, Total=72 [2023-12-22 02:59:24,543 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 67 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-12-22 02:59:24,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 155 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 2 Unknown, 142 Unchecked, 8.7s Time] [2023-12-22 02:59:24,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-22 02:59:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-12-22 02:59:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-22 02:59:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 66 transitions. [2023-12-22 02:59:24,548 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 66 transitions. Word has length 6 [2023-12-22 02:59:24,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:59:24,548 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 66 transitions. [2023-12-22 02:59:24,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 02:59:24,549 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2023-12-22 02:59:24,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-22 02:59:24,549 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:59:24,549 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:59:24,593 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 [2023-12-22 02:59:24,772 WARN L477 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 [2023-12-22 02:59:24,773 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:59:24,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:59:24,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1646139112, now seen corresponding path program 1 times [2023-12-22 02:59:24,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:59:24,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135477603] [2023-12-22 02:59:24,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:59:24,774 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 [2023-12-22 02:59:24,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:59:24,775 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) [2023-12-22 02:59:24,776 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 [2023-12-22 02:59:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:59:24,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-22 02:59:24,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:59:25,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-22 02:59:25,343 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:59:25,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:59:25,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135477603] [2023-12-22 02:59:25,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135477603] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:59:25,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:59:25,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-22 02:59:25,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30525078] [2023-12-22 02:59:25,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:59:25,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-22 02:59:25,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:59:25,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-22 02:59:25,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-22 02:59:25,345 INFO L87 Difference]: Start difference. First operand 48 states and 66 transitions. Second operand has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 02:59:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:59:26,036 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2023-12-22 02:59:26,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-22 02:59:26,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2023-12-22 02:59:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:59:26,039 INFO L225 Difference]: With dead ends: 93 [2023-12-22 02:59:26,039 INFO L226 Difference]: Without dead ends: 66 [2023-12-22 02:59:26,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-22 02:59:26,040 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 16 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-22 02:59:26,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 398 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-22 02:59:26,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-22 02:59:26,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2023-12-22 02:59:26,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 43 states have internal predecessors, (55), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-12-22 02:59:26,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2023-12-22 02:59:26,049 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 28 [2023-12-22 02:59:26,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:59:26,050 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2023-12-22 02:59:26,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 02:59:26,050 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2023-12-22 02:59:26,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-22 02:59:26,051 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:59:26,051 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:59:26,053 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 (4)] Forceful destruction successful, exit code 0 [2023-12-22 02:59:26,253 WARN L477 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 [2023-12-22 02:59:26,254 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:59:26,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:59:26,254 INFO L85 PathProgramCache]: Analyzing trace with hash 478532291, now seen corresponding path program 1 times [2023-12-22 02:59:26,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:59:26,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972599271] [2023-12-22 02:59:26,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:59:26,254 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 [2023-12-22 02:59:26,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:59:26,255 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) [2023-12-22 02:59:26,256 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 [2023-12-22 02:59:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:59:26,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-22 02:59:26,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:59:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-22 02:59:26,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 02:59:27,315 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-22 02:59:27,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:59:27,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972599271] [2023-12-22 02:59:27,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972599271] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 02:59:27,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 02:59:27,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-12-22 02:59:27,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358122918] [2023-12-22 02:59:27,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 02:59:27,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-22 02:59:27,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:59:27,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-22 02:59:27,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-22 02:59:27,318 INFO L87 Difference]: Start difference. First operand 57 states and 77 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 02:59:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:59:28,338 INFO L93 Difference]: Finished difference Result 112 states and 152 transitions. [2023-12-22 02:59:28,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-22 02:59:28,342 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2023-12-22 02:59:28,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:59:28,343 INFO L225 Difference]: With dead ends: 112 [2023-12-22 02:59:28,343 INFO L226 Difference]: Without dead ends: 85 [2023-12-22 02:59:28,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-12-22 02:59:28,345 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 21 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-22 02:59:28,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 453 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-22 02:59:28,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-22 02:59:28,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2023-12-22 02:59:28,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 49 states have internal predecessors, (62), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2023-12-22 02:59:28,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 89 transitions. [2023-12-22 02:59:28,352 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 89 transitions. Word has length 32 [2023-12-22 02:59:28,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:59:28,352 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 89 transitions. [2023-12-22 02:59:28,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 02:59:28,353 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2023-12-22 02:59:28,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-22 02:59:28,353 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:59:28,354 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:59:28,359 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 (5)] Forceful destruction successful, exit code 0 [2023-12-22 02:59:28,554 WARN L477 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 [2023-12-22 02:59:28,554 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:59:28,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:59:28,555 INFO L85 PathProgramCache]: Analyzing trace with hash -490985982, now seen corresponding path program 1 times [2023-12-22 02:59:28,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:59:28,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896347785] [2023-12-22 02:59:28,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:59:28,555 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 [2023-12-22 02:59:28,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:59:28,556 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) [2023-12-22 02:59:28,557 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 [2023-12-22 02:59:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:59:28,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-22 02:59:28,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:59:29,168 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-22 02:59:29,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 02:59:29,473 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-22 02:59:29,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:59:29,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896347785] [2023-12-22 02:59:29,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896347785] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 02:59:29,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 02:59:29,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-12-22 02:59:29,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679096792] [2023-12-22 02:59:29,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 02:59:29,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-22 02:59:29,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:59:29,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-22 02:59:29,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-22 02:59:29,474 INFO L87 Difference]: Start difference. First operand 66 states and 89 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-22 02:59:30,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:59:30,163 INFO L93 Difference]: Finished difference Result 105 states and 142 transitions. [2023-12-22 02:59:30,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-22 02:59:30,163 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2023-12-22 02:59:30,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:59:30,164 INFO L225 Difference]: With dead ends: 105 [2023-12-22 02:59:30,164 INFO L226 Difference]: Without dead ends: 82 [2023-12-22 02:59:30,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-22 02:59:30,165 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 13 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-22 02:59:30,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 413 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-22 02:59:30,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-22 02:59:30,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2023-12-22 02:59:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 55 states have internal predecessors, (68), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2023-12-22 02:59:30,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2023-12-22 02:59:30,173 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 99 transitions. Word has length 35 [2023-12-22 02:59:30,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:59:30,173 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 99 transitions. [2023-12-22 02:59:30,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-22 02:59:30,173 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 99 transitions. [2023-12-22 02:59:30,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-22 02:59:30,174 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:59:30,174 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:59:30,177 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 (6)] Forceful destruction successful, exit code 0 [2023-12-22 02:59:30,377 WARN L477 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 [2023-12-22 02:59:30,378 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:59:30,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:59:30,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1559779026, now seen corresponding path program 2 times [2023-12-22 02:59:30,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:59:30,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010651505] [2023-12-22 02:59:30,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-22 02:59:30,379 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 [2023-12-22 02:59:30,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:59:30,381 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) [2023-12-22 02:59:30,381 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 [2023-12-22 02:59:30,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-22 02:59:30,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-22 02:59:30,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-22 02:59:30,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:59:30,952 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-22 02:59:30,952 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:59:30,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:59:30,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010651505] [2023-12-22 02:59:30,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010651505] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:59:30,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:59:30,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-22 02:59:30,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929884207] [2023-12-22 02:59:30,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:59:30,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 02:59:30,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:59:30,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 02:59:30,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:59:30,954 INFO L87 Difference]: Start difference. First operand 75 states and 99 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 02:59:35,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-22 02:59:35,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:59:35,923 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2023-12-22 02:59:35,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:59:35,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2023-12-22 02:59:35,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:59:35,925 INFO L225 Difference]: With dead ends: 96 [2023-12-22 02:59:35,925 INFO L226 Difference]: Without dead ends: 94 [2023-12-22 02:59:35,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-22 02:59:35,925 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 17 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-22 02:59:35,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 298 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2023-12-22 02:59:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-22 02:59:35,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 81. [2023-12-22 02:59:35,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.280701754385965) internal successors, (73), 60 states have internal predecessors, (73), 15 states have call successors, (15), 7 states have call predecessors, (15), 8 states have return successors, (18), 13 states have call predecessors, (18), 14 states have call successors, (18) [2023-12-22 02:59:35,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2023-12-22 02:59:35,937 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 36 [2023-12-22 02:59:35,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:59:35,938 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2023-12-22 02:59:35,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 02:59:35,938 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2023-12-22 02:59:35,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-22 02:59:35,939 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:59:35,939 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:59:35,945 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 [2023-12-22 02:59:36,142 WARN L477 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 [2023-12-22 02:59:36,142 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:59:36,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:59:36,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1502520724, now seen corresponding path program 1 times [2023-12-22 02:59:36,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:59:36,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767928740] [2023-12-22 02:59:36,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:59:36,143 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 [2023-12-22 02:59:36,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:59:36,144 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) [2023-12-22 02:59:36,145 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 [2023-12-22 02:59:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:59:36,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-22 02:59:36,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:59:36,681 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-22 02:59:36,682 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:59:36,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:59:36,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767928740] [2023-12-22 02:59:36,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767928740] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:59:36,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:59:36,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-22 02:59:36,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749816832] [2023-12-22 02:59:36,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:59:36,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 02:59:36,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:59:36,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 02:59:36,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:59:36,683 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 02:59:41,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-22 02:59:41,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:59:41,568 INFO L93 Difference]: Finished difference Result 87 states and 111 transitions. [2023-12-22 02:59:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:59:41,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2023-12-22 02:59:41,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:59:41,569 INFO L225 Difference]: With dead ends: 87 [2023-12-22 02:59:41,569 INFO L226 Difference]: Without dead ends: 85 [2023-12-22 02:59:41,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-22 02:59:41,570 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 18 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-22 02:59:41,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 268 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2023-12-22 02:59:41,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-22 02:59:41,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2023-12-22 02:59:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 58 states have internal predecessors, (71), 14 states have call successors, (14), 7 states have call predecessors, (14), 8 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2023-12-22 02:59:41,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2023-12-22 02:59:41,580 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 36 [2023-12-22 02:59:41,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:59:41,580 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2023-12-22 02:59:41,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 02:59:41,580 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2023-12-22 02:59:41,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-22 02:59:41,581 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:59:41,581 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:59:41,586 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 [2023-12-22 02:59:41,784 WARN L477 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 [2023-12-22 02:59:41,785 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:59:41,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:59:41,785 INFO L85 PathProgramCache]: Analyzing trace with hash 704027381, now seen corresponding path program 1 times [2023-12-22 02:59:41,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:59:41,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786327101] [2023-12-22 02:59:41,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:59:41,785 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 [2023-12-22 02:59:41,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:59:41,786 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) [2023-12-22 02:59:41,787 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 [2023-12-22 02:59:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:59:41,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-22 02:59:41,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:59:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-22 02:59:42,807 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:59:42,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:59:42,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786327101] [2023-12-22 02:59:42,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786327101] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:59:42,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:59:42,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-22 02:59:42,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686437150] [2023-12-22 02:59:42,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:59:42,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-22 02:59:42,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:59:42,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-22 02:59:42,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-12-22 02:59:42,808 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:59:44,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:59:44,714 INFO L93 Difference]: Finished difference Result 117 states and 156 transitions. [2023-12-22 02:59:44,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-22 02:59:44,715 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2023-12-22 02:59:44,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:59:44,716 INFO L225 Difference]: With dead ends: 117 [2023-12-22 02:59:44,716 INFO L226 Difference]: Without dead ends: 110 [2023-12-22 02:59:44,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-12-22 02:59:44,717 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 30 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-22 02:59:44,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 517 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-22 02:59:44,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-22 02:59:44,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 93. [2023-12-22 02:59:44,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 67 states have internal predecessors, (82), 18 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (24), 18 states have call predecessors, (24), 17 states have call successors, (24) [2023-12-22 02:59:44,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2023-12-22 02:59:44,726 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 39 [2023-12-22 02:59:44,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:59:44,726 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2023-12-22 02:59:44,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:59:44,726 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2023-12-22 02:59:44,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-22 02:59:44,727 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:59:44,727 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:59:44,737 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 [2023-12-22 02:59:44,930 WARN L477 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 [2023-12-22 02:59:44,930 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:59:44,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:59:44,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1960839867, now seen corresponding path program 1 times [2023-12-22 02:59:44,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:59:44,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423759691] [2023-12-22 02:59:44,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:59:44,931 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 [2023-12-22 02:59:44,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:59:44,932 INFO L229 MonitoredProcess]: Starting monitored process 10 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) [2023-12-22 02:59:44,933 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 (10)] Waiting until timeout for monitored process [2023-12-22 02:59:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:59:44,966 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-22 02:59:44,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:59:46,022 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-22 02:59:46,022 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 02:59:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-22 02:59:47,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:59:47,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423759691] [2023-12-22 02:59:47,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423759691] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 02:59:47,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 02:59:47,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2023-12-22 02:59:47,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404029528] [2023-12-22 02:59:47,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 02:59:47,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-22 02:59:47,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:59:47,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-22 02:59:47,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2023-12-22 02:59:47,264 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand has 14 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-22 02:59:49,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:59:49,484 INFO L93 Difference]: Finished difference Result 124 states and 164 transitions. [2023-12-22 02:59:49,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-22 02:59:49,487 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2023-12-22 02:59:49,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:59:49,488 INFO L225 Difference]: With dead ends: 124 [2023-12-22 02:59:49,488 INFO L226 Difference]: Without dead ends: 116 [2023-12-22 02:59:49,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2023-12-22 02:59:49,489 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 32 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-22 02:59:49,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 746 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-22 02:59:49,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-22 02:59:49,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2023-12-22 02:59:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 74 states have internal predecessors, (91), 19 states have call successors, (19), 7 states have call predecessors, (19), 10 states have return successors, (26), 21 states have call predecessors, (26), 18 states have call successors, (26) [2023-12-22 02:59:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 136 transitions. [2023-12-22 02:59:49,497 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 136 transitions. Word has length 41 [2023-12-22 02:59:49,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:59:49,498 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 136 transitions. [2023-12-22 02:59:49,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-22 02:59:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 136 transitions. [2023-12-22 02:59:49,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-22 02:59:49,498 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:59:49,498 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:59:49,513 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 (10)] Forceful destruction successful, exit code 0 [2023-12-22 02:59:49,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 [2023-12-22 02:59:49,713 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:59:49,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:59:49,714 INFO L85 PathProgramCache]: Analyzing trace with hash 2018098169, now seen corresponding path program 1 times [2023-12-22 02:59:49,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:59:49,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340151378] [2023-12-22 02:59:49,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:59:49,714 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 [2023-12-22 02:59:49,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:59:49,715 INFO L229 MonitoredProcess]: Starting monitored process 11 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) [2023-12-22 02:59:49,719 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 (11)] Waiting until timeout for monitored process [2023-12-22 02:59:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:59:49,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 02:59:49,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:59:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-22 02:59:50,023 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:59:50,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:59:50,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340151378] [2023-12-22 02:59:50,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340151378] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:59:50,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:59:50,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-22 02:59:50,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132868628] [2023-12-22 02:59:50,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:59:50,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 02:59:50,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:59:50,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 02:59:50,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:59:50,024 INFO L87 Difference]: Start difference. First operand 103 states and 136 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-22 02:59:50,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:59:50,438 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2023-12-22 02:59:50,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:59:50,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2023-12-22 02:59:50,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:59:50,439 INFO L225 Difference]: With dead ends: 111 [2023-12-22 02:59:50,439 INFO L226 Difference]: Without dead ends: 96 [2023-12-22 02:59:50,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-22 02:59:50,440 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 6 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:59:50,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 291 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:59:50,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-22 02:59:50,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-12-22 02:59:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 70 states have internal predecessors, (84), 17 states have call successors, (17), 7 states have call predecessors, (17), 10 states have return successors, (23), 18 states have call predecessors, (23), 16 states have call successors, (23) [2023-12-22 02:59:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2023-12-22 02:59:50,465 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 41 [2023-12-22 02:59:50,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:59:50,465 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2023-12-22 02:59:50,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-22 02:59:50,465 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2023-12-22 02:59:50,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-22 02:59:50,466 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:59:50,466 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:59:50,471 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 (11)] Ended with exit code 0 [2023-12-22 02:59:50,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 [2023-12-22 02:59:50,669 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:59:50,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:59:50,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2133104112, now seen corresponding path program 1 times [2023-12-22 02:59:50,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:59:50,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168245959] [2023-12-22 02:59:50,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:59:50,670 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 [2023-12-22 02:59:50,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:59:50,671 INFO L229 MonitoredProcess]: Starting monitored process 12 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) [2023-12-22 02:59:50,672 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 (12)] Waiting until timeout for monitored process [2023-12-22 02:59:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:59:50,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-22 02:59:50,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:59:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-22 02:59:51,399 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:59:51,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:59:51,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168245959] [2023-12-22 02:59:51,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168245959] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:59:51,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:59:51,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-22 02:59:51,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547341985] [2023-12-22 02:59:51,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:59:51,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-22 02:59:51,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:59:51,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-22 02:59:51,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-22 02:59:51,401 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-22 02:59:52,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:59:52,593 INFO L93 Difference]: Finished difference Result 148 states and 188 transitions. [2023-12-22 02:59:52,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-22 02:59:52,594 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 45 [2023-12-22 02:59:52,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:59:52,594 INFO L225 Difference]: With dead ends: 148 [2023-12-22 02:59:52,594 INFO L226 Difference]: Without dead ends: 113 [2023-12-22 02:59:52,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-12-22 02:59:52,595 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 15 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-22 02:59:52,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 551 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-22 02:59:52,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-22 02:59:52,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 96. [2023-12-22 02:59:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 71 states have internal predecessors, (84), 15 states have call successors, (15), 8 states have call predecessors, (15), 11 states have return successors, (19), 16 states have call predecessors, (19), 14 states have call successors, (19) [2023-12-22 02:59:52,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2023-12-22 02:59:52,601 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 45 [2023-12-22 02:59:52,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:59:52,601 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2023-12-22 02:59:52,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-22 02:59:52,601 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2023-12-22 02:59:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-22 02:59:52,602 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:59:52,602 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:59:52,607 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 (12)] Ended with exit code 0 [2023-12-22 02:59:52,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 [2023-12-22 02:59:52,805 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:59:52,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:59:52,805 INFO L85 PathProgramCache]: Analyzing trace with hash -890656185, now seen corresponding path program 1 times [2023-12-22 02:59:52,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:59:52,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388244220] [2023-12-22 02:59:52,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:59:52,806 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 [2023-12-22 02:59:52,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:59:52,807 INFO L229 MonitoredProcess]: Starting monitored process 13 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) [2023-12-22 02:59:52,807 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 (13)] Waiting until timeout for monitored process [2023-12-22 02:59:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-22 02:59:52,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-22 02:59:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-22 02:59:52,882 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-22 02:59:52,882 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-22 02:59:52,882 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-22 02:59:52,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-22 02:59:52,887 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 (13)] Forceful destruction successful, exit code 0 [2023-12-22 02:59:53,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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 [2023-12-22 02:59:53,089 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:59:53,092 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-22 02:59:53,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 02:59:53 BoogieIcfgContainer [2023-12-22 02:59:53,123 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-22 02:59:53,123 INFO L158 Benchmark]: Toolchain (without parser) took 758507.17ms. Allocated memory was 199.2MB in the beginning and 252.7MB in the end (delta: 53.5MB). Free memory was 153.2MB in the beginning and 189.9MB in the end (delta: -36.8MB). Peak memory consumption was 17.7MB. Max. memory is 8.0GB. [2023-12-22 02:59:53,123 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 199.2MB. Free memory is still 157.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-22 02:59:53,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.87ms. Allocated memory is still 199.2MB. Free memory was 152.7MB in the beginning and 137.9MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-22 02:59:53,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.53ms. Allocated memory is still 199.2MB. Free memory was 137.9MB in the beginning and 136.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-22 02:59:53,124 INFO L158 Benchmark]: Boogie Preprocessor took 42.85ms. Allocated memory is still 199.2MB. Free memory was 135.9MB in the beginning and 133.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-22 02:59:53,124 INFO L158 Benchmark]: RCFGBuilder took 3980.01ms. Allocated memory is still 199.2MB. Free memory was 133.7MB in the beginning and 116.5MB in the end (delta: 17.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-22 02:59:53,124 INFO L158 Benchmark]: TraceAbstraction took 754206.51ms. Allocated memory was 199.2MB in the beginning and 252.7MB in the end (delta: 53.5MB). Free memory was 115.4MB in the beginning and 189.9MB in the end (delta: -74.5MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-22 02:59:53,125 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.17ms. Allocated memory is still 199.2MB. Free memory is still 157.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.87ms. Allocated memory is still 199.2MB. Free memory was 152.7MB in the beginning and 137.9MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.53ms. Allocated memory is still 199.2MB. Free memory was 137.9MB in the beginning and 136.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.85ms. Allocated memory is still 199.2MB. Free memory was 135.9MB in the beginning and 133.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 3980.01ms. Allocated memory is still 199.2MB. Free memory was 133.7MB in the beginning and 116.5MB in the end (delta: 17.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 754206.51ms. Allocated memory was 199.2MB in the beginning and 252.7MB in the end (delta: 53.5MB). Free memory was 115.4MB in the beginning and 189.9MB in the end (delta: -74.5MB). 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 - CounterExampleResult [Line: 60]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L309] COND FALSE !(__VERIFIER_nondet_int()) [L312] CALL main2() [L269] unsigned int a ; [L270] unsigned int ma = __VERIFIER_nondet_uint(); [L271] signed char ea = __VERIFIER_nondet_char(); [L272] unsigned int b ; [L273] unsigned int mb = __VERIFIER_nondet_uint(); [L274] signed char eb = __VERIFIER_nondet_char(); [L275] unsigned int r_add1 ; [L276] unsigned int r_add2 ; [L277] unsigned int zero ; [L278] int tmp ; [L279] int tmp___0 ; [L280] int __retres14 ; [L284] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L68] unsigned int res ; [L69] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L72] COND TRUE ! m [L73] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L123] return (__retres4); [L284] RET, EXPR base2flt(0, 0) [L284] zero = base2flt(0, 0) [L285] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L68] unsigned int res ; [L69] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L72] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L78] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L100] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L102] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L119] m = m & ~ (1U << 24U) [L120] res = m | ((unsigned int )(e + 128) << 24U) [L121] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=2147483648, e=0, m=0, res=2147483648] [L123] return (__retres4); [L285] RET, EXPR base2flt(ma, ea) VAL [ea=0, ma=16777216, zero=0] [L285] a = base2flt(ma, ea) [L286] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=64, \old(m)=16777216] [L68] unsigned int res ; [L69] unsigned int __retres4 ; VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L72] COND FALSE !(! m) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L78] COND FALSE !(m < 1U << 24U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L100] COND TRUE 1 VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L102] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L119] m = m & ~ (1U << 24U) [L120] res = m | ((unsigned int )(e + 128) << 24U) [L121] __retres4 = res VAL [\old(e)=64, \old(m)=16777216, __retres4=3221225472, e=64, m=0, res=3221225472] [L123] return (__retres4); [L286] RET, EXPR base2flt(mb, eb) VAL [a=2147483648, ea=0, eb=64, ma=16777216, mb=16777216, zero=0] [L286] b = base2flt(mb, eb) [L287] CALL addflt(a, b) VAL [\old(a)=2147483648, \old(b)=3221225472] [L127] unsigned int res ; [L128] unsigned int ma ; [L129] unsigned int mb ; [L130] unsigned int delta ; [L131] int ea ; [L132] int eb ; [L133] unsigned int tmp ; [L134] unsigned int __retres10 ; VAL [\old(a)=2147483648, \old(b)=3221225472, a=2147483648, b=3221225472] [L137] COND TRUE a < b [L138] tmp = a [L139] a = b [L140] b = tmp VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, tmp=2147483648] [L144] COND FALSE !(! b) [L151] ma = a & ((1U << 24U) - 1U) [L152] ea = (int )(a >> 24U) - 128 [L153] ma = ma | (1U << 24U) [L154] mb = b & ((1U << 24U) - 1U) [L155] eb = (int )(b >> 24U) - 128 [L156] mb = mb | (1U << 24U) VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L157] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L59] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L157] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L158] delta = ea - eb VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, delta=64, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L159] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L59] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L60] reach_error() VAL [\old(cond)=0, cond=0] - UnprovableResult [Line: 48]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 57 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 754.1s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 31.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 258 SdHoareTripleChecker+Valid, 23.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 235 mSDsluCounter, 4160 SdHoareTripleChecker+Invalid, 23.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 142 IncrementalHoareTripleChecker+Unchecked, 3474 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 897 IncrementalHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 686 mSDtfsCounter, 897 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 472 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 24.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=9, InterpolantAutomatonStates: 89, 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, 11 MinimizatonAttempts, 101 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 613.7s SatisfiabilityAnalysisTime, 106.4s InterpolantComputationTime, 387 NumberOfCodeBlocks, 371 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 439 ConstructedInterpolants, 4 QuantifiedInterpolants, 953 SizeOfPredicates, 39 NumberOfNonLiveVariables, 701 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 163/183 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 proved your program to be incorrect! [2023-12-22 02:59:53,331 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-22 02:59:53,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...