/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-6.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 21:42:13,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 21:42:13,173 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:42:13,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 21:42:13,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 21:42:13,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 21:42:13,198 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 21:42:13,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 21:42:13,199 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 21:42:13,202 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 21:42:13,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 21:42:13,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 21:42:13,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 21:42:13,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 21:42:13,204 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 21:42:13,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 21:42:13,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 21:42:13,205 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 21:42:13,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 21:42:13,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 21:42:13,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 21:42:13,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 21:42:13,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 21:42:13,206 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 21:42:13,206 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 21:42:13,206 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 21:42:13,206 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 21:42:13,207 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 21:42:13,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 21:42:13,207 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 21:42:13,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 21:42:13,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 21:42:13,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 21:42:13,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 21:42:13,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 21:42:13,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 21:42:13,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 21:42:13,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 21:42:13,209 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 21:42:13,209 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 21:42:13,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 21:42:13,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 21:42:13,209 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 21:42:13,209 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 21:42:13,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 21:42:13,210 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 21:42:13,210 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:42:13,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 21:42:13,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 21:42:13,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 21:42:13,408 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 21:42:13,408 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 21:42:13,409 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-6.i [2023-12-23 21:42:14,459 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 21:42:14,649 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 21:42:14,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-6.i [2023-12-23 21:42:14,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec492caf2/afa218c27e444bb8baa3d068049dc2c9/FLAGfb94d91cd [2023-12-23 21:42:14,668 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec492caf2/afa218c27e444bb8baa3d068049dc2c9 [2023-12-23 21:42:14,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 21:42:14,671 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 21:42:14,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 21:42:14,672 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 21:42:14,676 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 21:42:14,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:42:14" (1/1) ... [2023-12-23 21:42:14,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d3f79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:42:14, skipping insertion in model container [2023-12-23 21:42:14,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:42:14" (1/1) ... [2023-12-23 21:42:14,700 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 21:42:14,832 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-6.i[915,928] [2023-12-23 21:42:14,896 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 21:42:14,909 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 21:42:14,916 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-6.i[915,928] [2023-12-23 21:42:14,944 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 21:42:14,956 INFO L206 MainTranslator]: Completed translation [2023-12-23 21:42:14,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:42:14 WrapperNode [2023-12-23 21:42:14,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 21:42:14,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 21:42:14,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 21:42:14,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 21:42:14,961 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:42:14" (1/1) ... [2023-12-23 21:42:14,971 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:42:14" (1/1) ... [2023-12-23 21:42:14,994 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2023-12-23 21:42:14,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 21:42:14,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 21:42:14,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 21:42:14,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 21:42:15,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:42:14" (1/1) ... [2023-12-23 21:42:15,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:42:14" (1/1) ... [2023-12-23 21:42:15,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:42:14" (1/1) ... [2023-12-23 21:42:15,021 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:42:15,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:42:14" (1/1) ... [2023-12-23 21:42:15,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:42:14" (1/1) ... [2023-12-23 21:42:15,029 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:42:14" (1/1) ... [2023-12-23 21:42:15,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:42:14" (1/1) ... [2023-12-23 21:42:15,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:42:14" (1/1) ... [2023-12-23 21:42:15,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:42:14" (1/1) ... [2023-12-23 21:42:15,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 21:42:15,038 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 21:42:15,039 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 21:42:15,039 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 21:42:15,039 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:42:14" (1/1) ... [2023-12-23 21:42:15,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 21:42:15,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 21:42:15,081 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:42:15,098 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:42:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 21:42:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 21:42:15,117 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 21:42:15,117 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 21:42:15,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 21:42:15,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 21:42:15,178 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 21:42:15,180 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 21:42:30,943 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 21:42:31,000 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 21:42:31,000 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 21:42:31,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:42:31 BoogieIcfgContainer [2023-12-23 21:42:31,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 21:42:31,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 21:42:31,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 21:42:31,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 21:42:31,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:42:14" (1/3) ... [2023-12-23 21:42:31,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c243feb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:42:31, skipping insertion in model container [2023-12-23 21:42:31,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:42:14" (2/3) ... [2023-12-23 21:42:31,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c243feb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:42:31, skipping insertion in model container [2023-12-23 21:42:31,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:42:31" (3/3) ... [2023-12-23 21:42:31,006 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-6.i [2023-12-23 21:42:31,018 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 21:42:31,018 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 21:42:31,054 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 21:42:31,058 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;@74725e25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 21:42:31,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 21:42:31,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-23 21:42:31,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-23 21:42:31,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 21:42:31,071 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:31,072 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 21:42:31,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 21:42:31,076 INFO L85 PathProgramCache]: Analyzing trace with hash 56485099, now seen corresponding path program 1 times [2023-12-23 21:42:31,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 21:42:31,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931352026] [2023-12-23 21:42:31,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 21:42:31,086 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:42:31,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 21:42:31,087 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:42:31,090 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:42:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 21:42:32,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 21:42:32,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 21:42:32,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2023-12-23 21:42:32,277 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 21:42:32,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 21:42:32,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931352026] [2023-12-23 21:42:32,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931352026] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 21:42:32,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 21:42:32,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 21:42:32,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619485741] [2023-12-23 21:42:32,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 21:42:32,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 21:42:32,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 21:42:32,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 21:42:32,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 21:42:32,303 INFO L87 Difference]: Start difference. First operand has 74 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-23 21:42:37,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:42:37,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 21:42:37,449 INFO L93 Difference]: Finished difference Result 146 states and 258 transitions. [2023-12-23 21:42:37,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 21:42:37,452 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2023-12-23 21:42:37,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 21:42:37,457 INFO L225 Difference]: With dead ends: 146 [2023-12-23 21:42:37,457 INFO L226 Difference]: Without dead ends: 71 [2023-12-23 21:42:37,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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:42:37,463 INFO L413 NwaCegarLoop]: 108 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, 108 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:42:37,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2023-12-23 21:42:37,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-23 21:42:37,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-12-23 21:42:37,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 46 states have internal predecessors, (65), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-23 21:42:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 111 transitions. [2023-12-23 21:42:37,496 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 111 transitions. Word has length 147 [2023-12-23 21:42:37,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 21:42:37,497 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 111 transitions. [2023-12-23 21:42:37,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-23 21:42:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 111 transitions. [2023-12-23 21:42:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-23 21:42:37,500 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 21:42:37,500 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:37,527 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:42:37,706 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:42:37,706 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 21:42:37,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 21:42:37,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1184810993, now seen corresponding path program 1 times [2023-12-23 21:42:37,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 21:42:37,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632706787] [2023-12-23 21:42:37,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 21:42:37,708 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:42:37,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 21:42:37,709 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:42:37,710 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:42:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 21:42:38,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-23 21:42:38,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 21:42:40,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2023-12-23 21:42:40,836 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 21:42:42,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 21:42:42,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632706787] [2023-12-23 21:42:42,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632706787] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 21:42:42,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1999281005] [2023-12-23 21:42:42,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 21:42:42,846 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-23 21:42:42,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-23 21:42:42,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-23 21:42:42,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2023-12-23 21:42:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 21:42:46,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-23 21:42:46,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 21:42:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2023-12-23 21:42:47,258 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 21:42:47,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1999281005] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 21:42:47,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 21:42:47,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2023-12-23 21:42:47,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740876539] [2023-12-23 21:42:47,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 21:42:47,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-23 21:42:47,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 21:42:47,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-23 21:42:47,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-23 21:42:47,892 INFO L87 Difference]: Start difference. First operand 71 states and 111 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-23 21:42:56,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 21:43:00,391 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 [0] [2023-12-23 21:43:04,400 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 [0] [2023-12-23 21:43:08,409 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 [0] [2023-12-23 21:43:13,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.74s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:43:17,444 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:43:21,467 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:43:25,481 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:43:29,484 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:43:33,491 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 [0] [2023-12-23 21:43:37,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 21:43:37,987 INFO L93 Difference]: Finished difference Result 269 states and 407 transitions. [2023-12-23 21:43:37,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-23 21:43:37,988 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2023-12-23 21:43:37,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 21:43:37,990 INFO L225 Difference]: With dead ends: 269 [2023-12-23 21:43:37,990 INFO L226 Difference]: Without dead ends: 199 [2023-12-23 21:43:37,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=223, Invalid=707, Unknown=0, NotChecked=0, Total=930 [2023-12-23 21:43:37,992 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 255 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 143 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.4s IncrementalHoareTripleChecker+Time [2023-12-23 21:43:37,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 558 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 478 Invalid, 10 Unknown, 0 Unchecked, 47.4s Time] [2023-12-23 21:43:37,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-12-23 21:43:38,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 82. [2023-12-23 21:43:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-23 21:43:38,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2023-12-23 21:43:38,015 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 147 [2023-12-23 21:43:38,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 21:43:38,016 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2023-12-23 21:43:38,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-23 21:43:38,016 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2023-12-23 21:43:38,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-23 21:43:38,017 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 21:43:38,017 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:38,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2023-12-23 21:43:38,244 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:43:38,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:43:38,420 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 21:43:38,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 21:43:38,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1946016766, now seen corresponding path program 1 times [2023-12-23 21:43:38,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 21:43:38,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690312066] [2023-12-23 21:43:38,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 21:43:38,421 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:43:38,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 21:43:38,422 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:43:38,422 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:43:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 21:43:39,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 21:43:39,406 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 21:43:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-23 21:43:39,597 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 21:43:39,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 21:43:39,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690312066] [2023-12-23 21:43:39,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690312066] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 21:43:39,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 21:43:39,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 21:43:39,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33080898] [2023-12-23 21:43:39,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 21:43:39,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 21:43:39,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 21:43:39,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 21:43:39,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 21:43:39,599 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-23 21:43:44,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.72s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:43:49,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:43:53,644 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:43:53,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 21:43:53,961 INFO L93 Difference]: Finished difference Result 190 states and 291 transitions. [2023-12-23 21:43:53,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 21:43:53,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 148 [2023-12-23 21:43:53,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 21:43:53,965 INFO L225 Difference]: With dead ends: 190 [2023-12-23 21:43:53,965 INFO L226 Difference]: Without dead ends: 109 [2023-12-23 21:43:53,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 21:43:53,966 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 24 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2023-12-23 21:43:53,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 194 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 3 Unknown, 0 Unchecked, 14.3s Time] [2023-12-23 21:43:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-23 21:43:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2023-12-23 21:43:53,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 77 states have internal predecessors, (112), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-23 21:43:53,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 158 transitions. [2023-12-23 21:43:53,976 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 158 transitions. Word has length 148 [2023-12-23 21:43:53,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 21:43:53,977 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 158 transitions. [2023-12-23 21:43:53,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-23 21:43:53,977 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 158 transitions. [2023-12-23 21:43:53,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-23 21:43:53,978 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 21:43:53,979 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:54,010 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:43:54,192 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:43:54,192 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 21:43:54,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 21:43:54,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1433591519, now seen corresponding path program 1 times [2023-12-23 21:43:54,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 21:43:54,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561412720] [2023-12-23 21:43:54,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 21:43:54,194 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:43:54,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 21:43:54,195 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:43:54,195 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:43:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 21:43:55,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 21:43:55,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 21:43:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-23 21:43:55,373 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 21:43:55,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 21:43:55,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561412720] [2023-12-23 21:43:55,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561412720] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 21:43:55,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 21:43:55,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 21:43:55,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824832458] [2023-12-23 21:43:55,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 21:43:55,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 21:43:55,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 21:43:55,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 21:43:55,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 21:43:55,375 INFO L87 Difference]: Start difference. First operand 103 states and 158 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-23 21:43:57,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:44:02,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.75s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:44:06,420 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:44:10,426 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:44:10,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 21:44:10,785 INFO L93 Difference]: Finished difference Result 247 states and 376 transitions. [2023-12-23 21:44:10,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 21:44:10,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 148 [2023-12-23 21:44:10,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 21:44:10,787 INFO L225 Difference]: With dead ends: 247 [2023-12-23 21:44:10,787 INFO L226 Difference]: Without dead ends: 145 [2023-12-23 21:44:10,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 21:44:10,789 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 37 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2023-12-23 21:44:10,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 206 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 3 Unknown, 0 Unchecked, 15.4s Time] [2023-12-23 21:44:10,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-12-23 21:44:10,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2023-12-23 21:44:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 113 states have (on average 1.4424778761061947) internal successors, (163), 114 states have internal predecessors, (163), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-23 21:44:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 213 transitions. [2023-12-23 21:44:10,800 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 213 transitions. Word has length 148 [2023-12-23 21:44:10,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 21:44:10,800 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 213 transitions. [2023-12-23 21:44:10,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-23 21:44:10,801 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 213 transitions. [2023-12-23 21:44:10,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-23 21:44:10,802 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 21:44:10,802 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:10,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-23 21:44:11,016 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 21:44:11,016 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 21:44:11,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 21:44:11,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1850258527, now seen corresponding path program 1 times [2023-12-23 21:44:11,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 21:44:11,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559181034] [2023-12-23 21:44:11,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 21:44:11,018 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:44:11,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 21:44:11,018 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 21:44:11,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-23 21:44:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 21:44:12,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-23 21:44:12,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 21:44:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2023-12-23 21:44:14,365 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 21:44:14,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 21:44:14,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559181034] [2023-12-23 21:44:14,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559181034] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 21:44:14,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1692519233] [2023-12-23 21:44:14,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 21:44:14,983 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-23 21:44:14,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-23 21:44:14,984 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-23 21:44:14,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-23 21:44:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 21:44:17,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-23 21:44:17,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 21:46:37,902 WARN L293 SmtUtils]: Spent 50.03s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-23 21:49:12,140 WARN L293 SmtUtils]: Spent 54.43s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-23 21:49:20,423 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 21:49:28,628 WARN L293 SmtUtils]: Spent 8.20s 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 21:49:36,864 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 21:49:45,112 WARN L293 SmtUtils]: Spent 8.25s 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 21:49:53,263 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 21:50:01,488 WARN L293 SmtUtils]: Spent 8.22s 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 21:50:09,892 WARN L293 SmtUtils]: Spent 8.40s 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 21:50:18,150 WARN L293 SmtUtils]: Spent 8.26s 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 21:50:26,387 WARN L293 SmtUtils]: Spent 8.24s 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 21:50:34,631 WARN L293 SmtUtils]: Spent 8.24s 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 21:50:42,983 WARN L293 SmtUtils]: Spent 8.35s 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 21:50:51,225 WARN L293 SmtUtils]: Spent 8.24s 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:50:59,469 WARN L293 SmtUtils]: Spent 8.24s 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 21:51:07,702 WARN L293 SmtUtils]: Spent 8.23s 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 21:51:15,915 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 21:51:24,162 WARN L293 SmtUtils]: Spent 8.25s 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 21:51:32,410 WARN L293 SmtUtils]: Spent 8.25s 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 21:51:40,674 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 21:51:48,932 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 21:51:57,195 WARN L293 SmtUtils]: Spent 8.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 21:52:05,449 WARN L293 SmtUtils]: Spent 8.25s 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 21:52:13,705 WARN L293 SmtUtils]: Spent 8.26s 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 21:52:21,978 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 21:52:26,075 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse1)) (.cse0 ((_ zero_extend 24) c_~var_1_22~0))) (and (= c_~var_1_16~0 (bvadd c_~var_1_9~0 (_ bv200 32))) (= c_~var_1_24~0 (_ bv2 16)) (= c_~var_1_1~0 ((_ extract 15 0) .cse0)) (or (not (= (_ bv0 8) c_~var_1_2~0)) (not (= c_~var_1_3~0 (_ bv0 8)))) (or (and (fp.geq c_~var_1_15~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1))) (fp.leq c_~var_1_15~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse2)))) (and (fp.leq c_~var_1_15~0 .cse3) (fp.geq c_~var_1_15~0 .cse4))) (fp.geq c_~var_1_14~0 .cse4) (= c_~var_1_9~0 (let ((.cse5 ((_ zero_extend 24) c_~last_1_var_1_22~0))) (bvadd (bvneg .cse5) .cse5))) (fp.leq c_~var_1_14~0 .cse3) (fp.geq c_~var_1_13~0 .cse4) (= c_~var_1_12~0 (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_13~0 (fp.sub c_currentRoundingMode c_~var_1_14~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 127.0 2.0)))) c_~var_1_15~0)) (fp.leq c_~var_1_13~0 .cse3) (= c_~var_1_23~0 c_~var_1_22~0) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1277.0 5.0))))) (let ((.cse6 (fp.lt c_~var_1_14~0 .cse7))) (or (and (= c_~var_1_17~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode c_~var_1_14~0 c_~var_1_13~0))) .cse6) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode .cse7 c_~var_1_13~0)) c_~var_1_17~0) (not .cse6))))) (= ((_ extract 15 0) (bvadd ((_ zero_extend 16) c_~var_1_5~0) (bvneg (bvadd .cse0 (_ bv1000 32))))) c_~var_1_10~0) (= ((_ zero_extend 8) c_~var_1_22~0) c_~var_1_7~0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-12-23 21:52:38,300 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 21:52:46,517 WARN L293 SmtUtils]: Spent 8.22s 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 21:52:54,795 WARN L293 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 21:53:03,073 WARN L293 SmtUtils]: Spent 8.28s 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 21:53:11,245 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 21:53:19,519 WARN L293 SmtUtils]: Spent 8.27s 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 21:53:27,788 WARN L293 SmtUtils]: Spent 8.27s 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 21:53:36,060 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 21:53:44,336 WARN L293 SmtUtils]: Spent 8.28s 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 21:53:52,604 WARN L293 SmtUtils]: Spent 8.27s 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 21:54:00,871 WARN L293 SmtUtils]: Spent 8.27s 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 21:54:09,166 WARN L293 SmtUtils]: Spent 8.29s 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 21:54:17,432 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 21:54:25,703 WARN L293 SmtUtils]: Spent 8.27s 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 21:54:33,974 WARN L293 SmtUtils]: Spent 8.27s 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 21:54:42,218 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 21:54:50,471 WARN L293 SmtUtils]: Spent 8.25s 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 21:54:58,744 WARN L293 SmtUtils]: Spent 8.27s 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 21:55:07,000 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 21:55:15,257 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 21:55:23,521 WARN L293 SmtUtils]: Spent 8.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 21:55:31,775 WARN L293 SmtUtils]: Spent 8.25s 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 21:55:40,033 WARN L293 SmtUtils]: Spent 8.26s 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 21:55:48,288 WARN L293 SmtUtils]: Spent 8.25s 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:55:52,361 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse1)) (.cse0 ((_ zero_extend 24) c_~var_1_22~0))) (and (= c_~var_1_16~0 (bvadd c_~var_1_9~0 (_ bv200 32))) (= c_~var_1_24~0 (_ bv2 16)) (= c_~var_1_1~0 ((_ extract 15 0) .cse0)) (or (not (= (_ bv0 8) c_~var_1_2~0)) (not (= c_~var_1_3~0 (_ bv0 8)))) (= c_~var_1_21~0 c_~var_1_28~0) (or (and (fp.geq c_~var_1_15~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1))) (fp.leq c_~var_1_15~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse2)))) (and (fp.leq c_~var_1_15~0 .cse3) (fp.geq c_~var_1_15~0 .cse4))) (fp.geq c_~var_1_14~0 .cse4) (= c_~var_1_9~0 (let ((.cse5 ((_ zero_extend 24) c_~last_1_var_1_22~0))) (bvadd (bvneg .cse5) .cse5))) (fp.leq c_~var_1_14~0 .cse3) (fp.geq c_~var_1_13~0 .cse4) (= c_~var_1_12~0 (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_13~0 (fp.sub c_currentRoundingMode c_~var_1_14~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 127.0 2.0)))) c_~var_1_15~0)) (fp.leq c_~var_1_13~0 .cse3) (= c_~var_1_23~0 c_~var_1_22~0) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1277.0 5.0))))) (let ((.cse6 (fp.lt c_~var_1_14~0 .cse7))) (or (and (= c_~var_1_17~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode c_~var_1_14~0 c_~var_1_13~0))) .cse6) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode .cse7 c_~var_1_13~0)) c_~var_1_17~0) (not .cse6))))) (= ((_ extract 15 0) (bvadd ((_ zero_extend 16) c_~var_1_5~0) (bvneg (bvadd .cse0 (_ bv1000 32))))) c_~var_1_10~0) (= ((_ zero_extend 8) c_~var_1_22~0) c_~var_1_7~0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-12-23 21:55:56,401 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse1)) (.cse0 ((_ zero_extend 24) c_~var_1_22~0))) (and (= c_~var_1_16~0 (bvadd c_~var_1_9~0 (_ bv200 32))) (= c_~var_1_24~0 (_ bv2 16)) (= c_~var_1_1~0 ((_ extract 15 0) .cse0)) (or (not (= (_ bv0 8) c_~var_1_2~0)) (not (= c_~var_1_3~0 (_ bv0 8)))) (= c_~var_1_21~0 c_~var_1_28~0) (or (and (fp.geq c_~var_1_15~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1))) (fp.leq c_~var_1_15~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse2)))) (and (fp.leq c_~var_1_15~0 .cse3) (fp.geq c_~var_1_15~0 .cse4))) (fp.geq c_~var_1_14~0 .cse4) (= c_~var_1_9~0 (let ((.cse5 ((_ zero_extend 24) c_~last_1_var_1_22~0))) (bvadd (bvneg .cse5) .cse5))) (fp.leq c_~var_1_14~0 .cse3) (fp.geq c_~var_1_13~0 .cse4) (= c_~var_1_12~0 (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_13~0 (fp.sub c_currentRoundingMode c_~var_1_14~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 127.0 2.0)))) c_~var_1_15~0)) (fp.leq c_~var_1_13~0 .cse3) (= c_~var_1_23~0 c_~var_1_22~0) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1277.0 5.0))))) (let ((.cse6 (fp.lt c_~var_1_14~0 .cse7))) (or (and (= c_~var_1_17~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode c_~var_1_14~0 c_~var_1_13~0))) .cse6) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode .cse7 c_~var_1_13~0)) c_~var_1_17~0) (not .cse6))))) (= ((_ extract 15 0) (bvadd ((_ zero_extend 16) c_~var_1_5~0) (bvneg (bvadd .cse0 (_ bv1000 32))))) c_~var_1_10~0) (= ((_ zero_extend 8) c_~var_1_22~0) c_~var_1_7~0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-12-23 21:56:04,646 WARN L293 SmtUtils]: Spent 8.23s 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:56:12,878 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 21:56:21,042 WARN L293 SmtUtils]: Spent 8.16s 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 21:56:29,269 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 21:56:37,499 WARN L293 SmtUtils]: Spent 8.23s 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 21:56:45,593 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 21:56:53,831 WARN L293 SmtUtils]: Spent 8.24s 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) Received shutdown request... [2023-12-23 21:56:59,637 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 21:56:59,638 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 21:56:59,637 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 21:57:00,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2023-12-23 21:57:00,670 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 (7)] Ended with exit code 0 [2023-12-23 21:57:00,838 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-23 21:57:00,902 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 137 [2023-12-23 21:57:00,904 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-23 21:57:00,904 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 149 with TraceHistMax 23,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2023-12-23 21:57:00,907 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-23 21:57:00,909 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-23 21:57:00,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 09:57:00 BoogieIcfgContainer [2023-12-23 21:57:00,911 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-23 21:57:00,911 INFO L158 Benchmark]: Toolchain (without parser) took 886239.89ms. Allocated memory was 177.2MB in the beginning and 238.0MB in the end (delta: 60.8MB). Free memory was 127.3MB in the beginning and 118.9MB in the end (delta: 8.4MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. [2023-12-23 21:57:00,911 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 177.2MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-23 21:57:00,911 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.21ms. Allocated memory is still 177.2MB. Free memory was 126.9MB in the beginning and 110.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-23 21:57:00,911 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.09ms. Allocated memory is still 177.2MB. Free memory was 110.5MB in the beginning and 107.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-23 21:57:00,912 INFO L158 Benchmark]: Boogie Preprocessor took 42.42ms. Allocated memory is still 177.2MB. Free memory was 107.9MB in the beginning and 103.3MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-23 21:57:00,912 INFO L158 Benchmark]: RCFGBuilder took 15962.22ms. Allocated memory was 177.2MB in the beginning and 238.0MB in the end (delta: 60.8MB). Free memory was 103.3MB in the beginning and 200.2MB in the end (delta: -96.9MB). Peak memory consumption was 26.7MB. Max. memory is 8.0GB. [2023-12-23 21:57:00,912 INFO L158 Benchmark]: TraceAbstraction took 869908.56ms. Allocated memory is still 238.0MB. Free memory was 199.2MB in the beginning and 118.9MB in the end (delta: 80.3MB). Peak memory consumption was 80.3MB. Max. memory is 8.0GB. [2023-12-23 21:57:00,913 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 177.2MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 284.21ms. Allocated memory is still 177.2MB. Free memory was 126.9MB in the beginning and 110.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.09ms. Allocated memory is still 177.2MB. Free memory was 110.5MB in the beginning and 107.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.42ms. Allocated memory is still 177.2MB. Free memory was 107.9MB in the beginning and 103.3MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 15962.22ms. Allocated memory was 177.2MB in the beginning and 238.0MB in the end (delta: 60.8MB). Free memory was 103.3MB in the beginning and 200.2MB in the end (delta: -96.9MB). Peak memory consumption was 26.7MB. Max. memory is 8.0GB. * TraceAbstraction took 869908.56ms. Allocated memory is still 238.0MB. Free memory was 199.2MB in the beginning and 118.9MB in the end (delta: 80.3MB). Peak memory consumption was 80.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 149 with TraceHistMax 23,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 869.9s, OverallIterations: 5, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 85.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 17 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 82.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 316 mSDsluCounter, 1066 SdHoareTripleChecker+Invalid, 80.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 611 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 521 IncrementalHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 455 mSDtfsCounter, 521 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 793 GetRequests, 762 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=4, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 126 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 7.2s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 737 NumberOfCodeBlocks, 737 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 732 ConstructedInterpolants, 1 QuantifiedInterpolants, 1020 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1237 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 5018/5060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown