/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/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-72.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 21:55:18,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 21:55:18,865 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-23 21:55:18,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 21:55:18,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 21:55:18,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 21:55:18,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 21:55:18,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 21:55:18,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 21:55:18,888 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 21:55:18,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 21:55:18,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 21:55:18,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 21:55:18,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 21:55:18,890 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 21:55:18,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 21:55:18,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 21:55:18,890 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 21:55:18,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 21:55:18,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 21:55:18,891 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 21:55:18,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 21:55:18,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 21:55:18,893 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 21:55:18,893 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 21:55:18,894 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 21:55:18,894 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 21:55:18,894 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 21:55:18,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 21:55:18,894 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 21:55:18,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 21:55:18,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 21:55:18,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 21:55:18,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 21:55:18,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 21:55:18,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 21:55:18,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 21:55:18,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 21:55:18,895 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 21:55:18,895 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 21:55:18,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 21:55:18,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 21:55:18,896 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 21:55:18,896 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 21:55:18,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 21:55:18,896 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 21:55:18,897 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-23 21:55:19,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 21:55:19,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 21:55:19,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 21:55:19,089 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 21:55:19,089 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 21:55:19,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-72.i [2023-12-23 21:55:20,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 21:55:20,240 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 21:55:20,240 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-72.i [2023-12-23 21:55:20,251 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49e2a5bff/829da0198cca4b1287731296ad33e578/FLAGcf58ac880 [2023-12-23 21:55:20,265 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49e2a5bff/829da0198cca4b1287731296ad33e578 [2023-12-23 21:55:20,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 21:55:20,268 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 21:55:20,270 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 21:55:20,270 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 21:55:20,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 21:55:20,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:55:20" (1/1) ... [2023-12-23 21:55:20,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a96466b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:55:20, skipping insertion in model container [2023-12-23 21:55:20,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:55:20" (1/1) ... [2023-12-23 21:55:20,307 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 21:55:20,417 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-72.i[916,929] [2023-12-23 21:55:20,477 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 21:55:20,488 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 21:55:20,496 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-72.i[916,929] [2023-12-23 21:55:20,531 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 21:55:20,543 INFO L206 MainTranslator]: Completed translation [2023-12-23 21:55:20,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:55:20 WrapperNode [2023-12-23 21:55:20,543 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 21:55:20,544 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 21:55:20,544 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 21:55:20,544 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 21:55:20,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:55:20" (1/1) ... [2023-12-23 21:55:20,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:55:20" (1/1) ... [2023-12-23 21:55:20,591 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2023-12-23 21:55:20,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 21:55:20,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 21:55:20,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 21:55:20,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 21:55:20,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:55:20" (1/1) ... [2023-12-23 21:55:20,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:55:20" (1/1) ... [2023-12-23 21:55:20,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:55:20" (1/1) ... [2023-12-23 21:55:20,627 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-23 21:55:20,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:55:20" (1/1) ... [2023-12-23 21:55:20,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:55:20" (1/1) ... [2023-12-23 21:55:20,635 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:55:20" (1/1) ... [2023-12-23 21:55:20,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:55:20" (1/1) ... [2023-12-23 21:55:20,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:55:20" (1/1) ... [2023-12-23 21:55:20,641 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:55:20" (1/1) ... [2023-12-23 21:55:20,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 21:55:20,644 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 21:55:20,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 21:55:20,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 21:55:20,645 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:55:20" (1/1) ... [2023-12-23 21:55:20,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 21:55:20,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 21:55:20,685 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-23 21:55:20,692 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-23 21:55:20,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 21:55:20,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 21:55:20,715 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 21:55:20,716 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 21:55:20,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 21:55:20,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 21:55:20,795 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 21:55:20,797 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 21:55:38,991 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 21:55:39,024 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 21:55:39,024 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 21:55:39,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:55:39 BoogieIcfgContainer [2023-12-23 21:55:39,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 21:55:39,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 21:55:39,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 21:55:39,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 21:55:39,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:55:20" (1/3) ... [2023-12-23 21:55:39,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58038819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:55:39, skipping insertion in model container [2023-12-23 21:55:39,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:55:20" (2/3) ... [2023-12-23 21:55:39,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58038819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:55:39, skipping insertion in model container [2023-12-23 21:55:39,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:55:39" (3/3) ... [2023-12-23 21:55:39,031 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-72.i [2023-12-23 21:55:39,043 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 21:55:39,043 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 21:55:39,075 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 21:55:39,082 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;@384b6f83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 21:55:39,082 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 21:55:39,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 49 states have internal predecessors, (70), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-23 21:55:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-23 21:55:39,101 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 21:55:39,102 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 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, 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, 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-23 21:55:39,102 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 21:55:39,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 21:55:39,107 INFO L85 PathProgramCache]: Analyzing trace with hash -389041652, now seen corresponding path program 1 times [2023-12-23 21:55:39,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 21:55:39,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116320246] [2023-12-23 21:55:39,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 21:55:39,120 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-23 21:55:39,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 21:55:39,122 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-23 21:55:39,144 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-23 21:55:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 21:55:40,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 21:55:40,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 21:55:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2023-12-23 21:55:40,345 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 21:55:40,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 21:55:40,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116320246] [2023-12-23 21:55:40,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2116320246] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 21:55:40,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 21:55:40,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 21:55:40,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040249024] [2023-12-23 21:55:40,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 21:55:40,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 21:55:40,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 21:55:40,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 21:55:40,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 21:55:40,382 INFO L87 Difference]: Start difference. First operand has 80 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 49 states have internal predecessors, (70), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2023-12-23 21:55:45,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.78s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:55:45,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 21:55:45,538 INFO L93 Difference]: Finished difference Result 159 states and 284 transitions. [2023-12-23 21:55:45,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 21:55:45,540 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 183 [2023-12-23 21:55:45,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 21:55:45,545 INFO L225 Difference]: With dead ends: 159 [2023-12-23 21:55:45,546 INFO L226 Difference]: Without dead ends: 78 [2023-12-23 21:55:45,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 182 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-23 21:55:45,550 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-23 21:55:45,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2023-12-23 21:55:45,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-23 21:55:45,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-12-23 21:55:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-23 21:55:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 123 transitions. [2023-12-23 21:55:45,583 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 123 transitions. Word has length 183 [2023-12-23 21:55:45,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 21:55:45,583 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 123 transitions. [2023-12-23 21:55:45,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2023-12-23 21:55:45,584 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 123 transitions. [2023-12-23 21:55:45,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-23 21:55:45,587 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 21:55:45,587 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 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, 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, 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-23 21:55:45,610 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-23 21:55:45,802 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-23 21:55:45,803 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 21:55:45,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 21:55:45,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1810816526, now seen corresponding path program 1 times [2023-12-23 21:55:45,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 21:55:45,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715350724] [2023-12-23 21:55:45,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 21:55:45,804 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-23 21:55:45,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 21:55:45,806 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-23 21:55:45,813 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-23 21:55:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 21:55:46,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-23 21:55:46,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 21:55:49,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 334 proven. 75 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2023-12-23 21:55:49,853 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 21:55:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 9 proven. 75 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2023-12-23 21:55:51,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 21:55:51,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715350724] [2023-12-23 21:55:51,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715350724] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 21:55:51,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 21:55:51,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-12-23 21:55:51,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025151785] [2023-12-23 21:55:51,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 21:55:51,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-23 21:55:51,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 21:55:51,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-23 21:55:51,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-23 21:55:51,348 INFO L87 Difference]: Start difference. First operand 78 states and 123 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2023-12-23 21:55:58,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.86s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:56:02,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:56:06,365 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-23 21:56:06,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 21:56:06,719 INFO L93 Difference]: Finished difference Result 163 states and 252 transitions. [2023-12-23 21:56:06,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-23 21:56:06,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 183 [2023-12-23 21:56:06,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 21:56:06,721 INFO L225 Difference]: With dead ends: 163 [2023-12-23 21:56:06,721 INFO L226 Difference]: Without dead ends: 86 [2023-12-23 21:56:06,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 358 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-23 21:56:06,723 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 52 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2023-12-23 21:56:06,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 193 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 170 Invalid, 3 Unknown, 0 Unchecked, 15.0s Time] [2023-12-23 21:56:06,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-23 21:56:06,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2023-12-23 21:56:06,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-23 21:56:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2023-12-23 21:56:06,754 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 183 [2023-12-23 21:56:06,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 21:56:06,756 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2023-12-23 21:56:06,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2023-12-23 21:56:06,757 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2023-12-23 21:56:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-23 21:56:06,760 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 21:56:06,760 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 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, 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, 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-23 21:56:06,786 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-23 21:56:06,976 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-23 21:56:06,976 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 21:56:06,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 21:56:06,977 INFO L85 PathProgramCache]: Analyzing trace with hash -183328180, now seen corresponding path program 1 times [2023-12-23 21:56:06,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 21:56:06,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40638130] [2023-12-23 21:56:06,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 21:56:06,978 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-23 21:56:06,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 21:56:06,979 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-23 21:56:06,997 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-23 21:56:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 21:56:08,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-23 21:56:08,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 21:56:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-12-23 21:56:14,826 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 21:56:14,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 21:56:14,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40638130] [2023-12-23 21:56:14,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40638130] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 21:56:14,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 21:56:14,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-23 21:56:14,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999539318] [2023-12-23 21:56:14,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 21:56:14,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-23 21:56:14,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 21:56:14,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-23 21:56:14,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-23 21:56:14,829 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-23 21:56:16,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:56:21,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:56:23,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:56:27,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.80s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:56:31,935 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-23 21:56:35,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:56:40,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:56:45,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.84s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:56:49,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:56:53,407 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-23 21:56:57,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:56:57,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 21:56:57,758 INFO L93 Difference]: Finished difference Result 245 states and 374 transitions. [2023-12-23 21:56:57,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-23 21:56:57,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2023-12-23 21:56:57,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 21:56:57,761 INFO L225 Difference]: With dead ends: 245 [2023-12-23 21:56:57,761 INFO L226 Difference]: Without dead ends: 164 [2023-12-23 21:56:57,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-23 21:56:57,764 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 80 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 59 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.7s IncrementalHoareTripleChecker+Time [2023-12-23 21:56:57,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 389 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 92 Invalid, 9 Unknown, 0 Unchecked, 42.7s Time] [2023-12-23 21:56:57,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-12-23 21:56:57,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2023-12-23 21:56:57,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 85 states have (on average 1.2823529411764707) internal successors, (109), 85 states have internal predecessors, (109), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-23 21:56:57,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 225 transitions. [2023-12-23 21:56:57,790 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 225 transitions. Word has length 183 [2023-12-23 21:56:57,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 21:56:57,791 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 225 transitions. [2023-12-23 21:56:57,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-23 21:56:57,791 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 225 transitions. [2023-12-23 21:56:57,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-23 21:56:57,792 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 21:56:57,792 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 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, 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, 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-23 21:56:57,815 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-23 21:56:58,008 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-23 21:56:58,009 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 21:56:58,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 21:56:58,009 INFO L85 PathProgramCache]: Analyzing trace with hash 74837258, now seen corresponding path program 1 times [2023-12-23 21:56:58,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 21:56:58,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [79548023] [2023-12-23 21:56:58,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 21:56:58,010 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-23 21:56:58,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 21:56:58,011 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-23 21:56:58,023 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-23 21:56:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 21:56:59,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-23 21:56:59,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 21:57:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 630 proven. 63 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2023-12-23 21:57:02,382 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 21:57:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 21 proven. 63 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2023-12-23 21:57:04,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 21:57:04,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [79548023] [2023-12-23 21:57:04,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [79548023] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 21:57:04,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 21:57:04,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2023-12-23 21:57:04,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455453127] [2023-12-23 21:57:04,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 21:57:04,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-23 21:57:04,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 21:57:04,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-23 21:57:04,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-12-23 21:57:04,296 INFO L87 Difference]: Start difference. First operand 148 states and 225 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2023-12-23 21:57:12,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.79s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:57:16,881 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-23 21:57:20,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:57:24,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:57:30,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.83s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:57:34,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:57:38,102 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-23 21:57:42,108 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-23 21:57:46,115 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-23 21:57:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 21:57:50,377 INFO L93 Difference]: Finished difference Result 354 states and 513 transitions. [2023-12-23 21:57:50,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-23 21:57:50,378 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 183 [2023-12-23 21:57:50,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 21:57:50,381 INFO L225 Difference]: With dead ends: 354 [2023-12-23 21:57:50,382 INFO L226 Difference]: Without dead ends: 261 [2023-12-23 21:57:50,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=167, Invalid=433, Unknown=0, NotChecked=0, Total=600 [2023-12-23 21:57:50,384 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 171 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 141 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.3s IncrementalHoareTripleChecker+Time [2023-12-23 21:57:50,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 447 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 569 Invalid, 9 Unknown, 0 Unchecked, 44.3s Time] [2023-12-23 21:57:50,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-12-23 21:57:50,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 229. [2023-12-23 21:57:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 131 states have (on average 1.183206106870229) internal successors, (155), 132 states have internal predecessors, (155), 87 states have call successors, (87), 10 states have call predecessors, (87), 10 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2023-12-23 21:57:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 329 transitions. [2023-12-23 21:57:50,419 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 329 transitions. Word has length 183 [2023-12-23 21:57:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 21:57:50,420 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 329 transitions. [2023-12-23 21:57:50,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2023-12-23 21:57:50,420 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 329 transitions. [2023-12-23 21:57:50,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-23 21:57:50,421 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 21:57:50,421 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 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, 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, 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-23 21:57:50,444 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-23 21:57:50,628 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-23 21:57:50,628 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 21:57:50,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 21:57:50,629 INFO L85 PathProgramCache]: Analyzing trace with hash 76684300, now seen corresponding path program 1 times [2023-12-23 21:57:50,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 21:57:50,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121117754] [2023-12-23 21:57:50,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 21:57:50,630 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-23 21:57:50,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 21:57:50,631 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-23 21:57:50,634 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-23 21:57:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 21:57:51,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-23 21:57:51,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 21:59:42,065 WARN L293 SmtUtils]: Spent 9.96s 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-23 21:59:51,924 WARN L293 SmtUtils]: Spent 9.86s 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-23 22:00:01,841 WARN L293 SmtUtils]: Spent 9.92s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:00:11,746 WARN L293 SmtUtils]: Spent 9.90s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:00:21,685 WARN L293 SmtUtils]: Spent 9.94s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:00:31,602 WARN L293 SmtUtils]: Spent 9.92s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:00:41,570 WARN L293 SmtUtils]: Spent 9.97s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:00:51,590 WARN L293 SmtUtils]: Spent 10.02s 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-23 22:01:01,626 WARN L293 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:01:11,653 WARN L293 SmtUtils]: Spent 10.03s 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-23 22:01:21,730 WARN L293 SmtUtils]: Spent 10.08s 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-23 22:01:31,790 WARN L293 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:01:41,846 WARN L293 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:01:51,924 WARN L293 SmtUtils]: Spent 10.08s 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-23 22:02:01,965 WARN L293 SmtUtils]: Spent 10.04s 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-23 22:02:11,943 WARN L293 SmtUtils]: Spent 9.98s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:02:21,949 WARN L293 SmtUtils]: Spent 10.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:02:31,901 WARN L293 SmtUtils]: Spent 9.95s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:02:40,490 WARN L293 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:02:49,058 WARN L293 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:02:59,083 WARN L293 SmtUtils]: Spent 10.02s 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-23 22:03:09,073 WARN L293 SmtUtils]: Spent 9.99s 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-23 22:03:19,036 WARN L293 SmtUtils]: Spent 9.96s 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-23 22:03:28,995 WARN L293 SmtUtils]: Spent 9.96s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:03:39,005 WARN L293 SmtUtils]: Spent 10.01s 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-23 22:03:49,008 WARN L293 SmtUtils]: Spent 10.00s 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-23 22:03:59,012 WARN L293 SmtUtils]: Spent 10.00s 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-23 22:04:09,025 WARN L293 SmtUtils]: Spent 10.01s 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-23 22:04:19,035 WARN L293 SmtUtils]: Spent 10.01s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:04:29,086 WARN L293 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:04:39,091 WARN L293 SmtUtils]: Spent 10.00s 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-23 22:04:49,081 WARN L293 SmtUtils]: Spent 9.99s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:04:59,070 WARN L293 SmtUtils]: Spent 9.99s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:05:09,051 WARN L293 SmtUtils]: Spent 9.98s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:05:19,079 WARN L293 SmtUtils]: Spent 10.03s 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-23 22:05:29,075 WARN L293 SmtUtils]: Spent 10.00s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:05:39,116 WARN L293 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:05:49,041 WARN L293 SmtUtils]: Spent 9.92s 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-23 22:05:53,600 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_20~0)) (.cse4 ((_ sign_extend 24) c_~var_1_25~0)) (.cse5 ((_ sign_extend 24) c_~var_1_24~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_21~0))) (and (not (fp.lt .cse0 c_~var_1_14~0)) (= (_ bv16 32) c_~last_1_var_1_36~0) (= (_ bv1 8) c_~last_1_var_1_28~0) (bvsle ((_ zero_extend 24) c_~var_1_7~0) (_ bv0 32)) (bvsle ((_ zero_extend 24) c_~var_1_5~0) (_ bv0 32)) (= .cse1 c_~var_1_26~0) (not (fp.eq c_~var_1_14~0 ((_ to_fp 11 53) c_currentRoundingMode (_ +zero 8 24)))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse0 c_~var_1_26~0)) (.cse2 (fp.lt c_~var_1_14~0 c_~var_1_15~0))) (or (and (not .cse2) (fp.geq (fp.div c_currentRoundingMode c_~var_1_22~0 c_~var_1_15~0) .cse3)) (and (fp.geq (fp.div c_currentRoundingMode c_~var_1_22~0 c_~var_1_14~0) .cse3) .cse2))) (not (fp.eq c_~var_1_21~0 c_~last_1_var_1_20~0)) (fp.gt .cse0 c_~var_1_15~0) (= ((_ extract 7 0) (bvadd (_ bv4294967295 32) (bvneg (bvadd (bvneg .cse4) .cse5)))) c_~var_1_23~0) (= ((_ sign_extend 8) c_~var_1_24~0) c_~var_1_27~0) (let ((.cse13 ((_ zero_extend 16) c_~var_1_34~0))) (let ((.cse7 (= ((_ extract 15 0) .cse5) c_~var_1_29~0)) (.cse9 ((_ zero_extend 16) c_~var_1_35~0)) (.cse10 (bvsgt .cse4 .cse13))) (or (and (let ((.cse8 (bvadd .cse4 .cse9))) (let ((.cse6 (bvsgt .cse5 .cse8))) (or (and .cse6 .cse7) (and (not .cse6) (= ((_ extract 15 0) .cse8) c_~var_1_29~0))))) .cse10) (and (let ((.cse11 (bvadd .cse13 .cse9))) (let ((.cse12 (bvsgt .cse5 .cse11))) (or (and (= ((_ extract 15 0) .cse11) c_~var_1_29~0) (not .cse12)) (and .cse12 .cse7)))) (not .cse10))))) (= c_~var_1_8~0 ((_ sign_extend 8) c_~var_1_23~0)) (bvsle ((_ zero_extend 24) c_~var_1_6~0) (_ bv0 32)) (= c_~var_1_7~0 c_~var_1_19~0) (= c_~var_1_21~0 c_~var_1_20~0) (= (bvadd (_ bv16 16) c_~last_1_var_1_8~0) (_ bv0 16)) (let ((.cse14 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse15 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (or (and (fp.leq c_~var_1_21~0 (fp.neg .cse14)) (fp.geq c_~var_1_21~0 (fp.neg .cse15))) (and (fp.geq c_~var_1_21~0 .cse14) (fp.leq c_~var_1_21~0 .cse15)))) (= c_~last_1_var_1_23~0 (_ bv16 8)) (= (_ bv0 8) c_~var_1_28~0) (= c_currentRoundingMode roundNearestTiesToEven) (= c_~var_1_22~0 .cse1))) is different from false [2023-12-23 22:05:58,167 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_20~0)) (.cse4 ((_ sign_extend 24) c_~var_1_25~0)) (.cse5 ((_ sign_extend 24) c_~var_1_24~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_21~0))) (and (not (fp.lt .cse0 c_~var_1_14~0)) (= (_ bv16 32) c_~last_1_var_1_36~0) (= (_ bv1 8) c_~last_1_var_1_28~0) (bvsle ((_ zero_extend 24) c_~var_1_7~0) (_ bv0 32)) (bvsle ((_ zero_extend 24) c_~var_1_5~0) (_ bv0 32)) (= .cse1 c_~var_1_26~0) (not (fp.eq c_~var_1_14~0 ((_ to_fp 11 53) c_currentRoundingMode (_ +zero 8 24)))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse0 c_~var_1_26~0)) (.cse2 (fp.lt c_~var_1_14~0 c_~var_1_15~0))) (or (and (not .cse2) (fp.geq (fp.div c_currentRoundingMode c_~var_1_22~0 c_~var_1_15~0) .cse3)) (and (fp.geq (fp.div c_currentRoundingMode c_~var_1_22~0 c_~var_1_14~0) .cse3) .cse2))) (not (fp.eq c_~var_1_21~0 c_~last_1_var_1_20~0)) (fp.gt .cse0 c_~var_1_15~0) (= ((_ extract 7 0) (bvadd (_ bv4294967295 32) (bvneg (bvadd (bvneg .cse4) .cse5)))) c_~var_1_23~0) (= ((_ sign_extend 8) c_~var_1_24~0) c_~var_1_27~0) (let ((.cse13 ((_ zero_extend 16) c_~var_1_34~0))) (let ((.cse7 (= ((_ extract 15 0) .cse5) c_~var_1_29~0)) (.cse9 ((_ zero_extend 16) c_~var_1_35~0)) (.cse10 (bvsgt .cse4 .cse13))) (or (and (let ((.cse8 (bvadd .cse4 .cse9))) (let ((.cse6 (bvsgt .cse5 .cse8))) (or (and .cse6 .cse7) (and (not .cse6) (= ((_ extract 15 0) .cse8) c_~var_1_29~0))))) .cse10) (and (let ((.cse11 (bvadd .cse13 .cse9))) (let ((.cse12 (bvsgt .cse5 .cse11))) (or (and (= ((_ extract 15 0) .cse11) c_~var_1_29~0) (not .cse12)) (and .cse12 .cse7)))) (not .cse10))))) (= c_~var_1_8~0 ((_ sign_extend 8) c_~var_1_23~0)) (bvsle ((_ zero_extend 24) c_~var_1_6~0) (_ bv0 32)) (= c_~var_1_7~0 c_~var_1_19~0) (= c_~var_1_21~0 c_~var_1_20~0) (= (bvadd (_ bv16 16) c_~last_1_var_1_8~0) (_ bv0 16)) (let ((.cse14 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse15 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (or (and (fp.leq c_~var_1_21~0 (fp.neg .cse14)) (fp.geq c_~var_1_21~0 (fp.neg .cse15))) (and (fp.geq c_~var_1_21~0 .cse14) (fp.leq c_~var_1_21~0 .cse15)))) (= c_~last_1_var_1_23~0 (_ bv16 8)) (= (_ bv0 8) c_~var_1_28~0) (= c_currentRoundingMode roundNearestTiesToEven) (= c_~var_1_22~0 .cse1))) is different from true [2023-12-23 22:06:08,363 WARN L293 SmtUtils]: Spent 10.15s 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-23 22:06:18,622 WARN L293 SmtUtils]: Spent 10.26s 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-23 22:06:28,929 WARN L293 SmtUtils]: Spent 10.31s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:06:39,126 WARN L293 SmtUtils]: Spent 10.20s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:06:49,226 WARN L293 SmtUtils]: Spent 10.10s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:06:59,394 WARN L293 SmtUtils]: Spent 10.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:07:09,597 WARN L293 SmtUtils]: Spent 10.20s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:07:19,787 WARN L293 SmtUtils]: Spent 10.19s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:07:30,106 WARN L293 SmtUtils]: Spent 10.32s 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-23 22:07:40,409 WARN L293 SmtUtils]: Spent 10.30s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:07:50,596 WARN L293 SmtUtils]: Spent 10.19s 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-23 22:08:00,772 WARN L293 SmtUtils]: Spent 10.17s 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-23 22:08:04,662 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 101 [2023-12-23 22:08:04,662 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-23 22:08:04,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 22:08:04,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121117754] [2023-12-23 22:08:04,664 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-23 22:08:04,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-23 22:08:04,864 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-23 22:08:04,865 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 58 more [2023-12-23 22:08:04,868 INFO L158 Benchmark]: Toolchain (without parser) took 764600.07ms. Allocated memory was 230.7MB in the beginning and 332.4MB in the end (delta: 101.7MB). Free memory was 182.2MB in the beginning and 291.7MB in the end (delta: -109.6MB). Peak memory consumption was 184.0MB. Max. memory is 8.0GB. [2023-12-23 22:08:04,868 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 230.7MB. Free memory is still 177.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-23 22:08:04,868 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.51ms. Allocated memory is still 230.7MB. Free memory was 181.8MB in the beginning and 164.4MB in the end (delta: 17.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-23 22:08:04,869 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.65ms. Allocated memory is still 230.7MB. Free memory was 164.4MB in the beginning and 161.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-23 22:08:04,869 INFO L158 Benchmark]: Boogie Preprocessor took 51.69ms. Allocated memory is still 230.7MB. Free memory was 161.3MB in the beginning and 156.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-23 22:08:04,869 INFO L158 Benchmark]: RCFGBuilder took 18380.76ms. Allocated memory was 230.7MB in the beginning and 332.4MB in the end (delta: 101.7MB). Free memory was 156.4MB in the beginning and 291.6MB in the end (delta: -135.1MB). Peak memory consumption was 26.3MB. Max. memory is 8.0GB. [2023-12-23 22:08:04,869 INFO L158 Benchmark]: TraceAbstraction took 745841.24ms. Allocated memory is still 332.4MB. Free memory was 290.5MB in the beginning and 291.7MB in the end (delta: -1.2MB). Peak memory consumption was 190.2MB. Max. memory is 8.0GB. [2023-12-23 22:08:04,871 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.14ms. Allocated memory is still 230.7MB. Free memory is still 177.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 273.51ms. Allocated memory is still 230.7MB. Free memory was 181.8MB in the beginning and 164.4MB in the end (delta: 17.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.65ms. Allocated memory is still 230.7MB. Free memory was 164.4MB in the beginning and 161.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.69ms. Allocated memory is still 230.7MB. Free memory was 161.3MB in the beginning and 156.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 18380.76ms. Allocated memory was 230.7MB in the beginning and 332.4MB in the end (delta: 101.7MB). Free memory was 156.4MB in the beginning and 291.6MB in the end (delta: -135.1MB). Peak memory consumption was 26.3MB. Max. memory is 8.0GB. * TraceAbstraction took 745841.24ms. Allocated memory is still 332.4MB. Free memory was 290.5MB in the beginning and 291.7MB in the end (delta: -1.2MB). Peak memory consumption was 190.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...