/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_50-while_file-71.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 04:21:56,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 04:21:56,590 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-24 04:21:56,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 04:21:56,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 04:21:56,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 04:21:56,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 04:21:56,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 04:21:56,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 04:21:56,623 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 04:21:56,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 04:21:56,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 04:21:56,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 04:21:56,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 04:21:56,624 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 04:21:56,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 04:21:56,625 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 04:21:56,625 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 04:21:56,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 04:21:56,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 04:21:56,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 04:21:56,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 04:21:56,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 04:21:56,626 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 04:21:56,626 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 04:21:56,626 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 04:21:56,626 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 04:21:56,627 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 04:21:56,627 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 04:21:56,627 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 04:21:56,628 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 04:21:56,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 04:21:56,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 04:21:56,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 04:21:56,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 04:21:56,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 04:21:56,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 04:21:56,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 04:21:56,629 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 04:21:56,629 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 04:21:56,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 04:21:56,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 04:21:56,630 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 04:21:56,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 04:21:56,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 04:21:56,630 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 04:21:56,630 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-24 04:21:56,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 04:21:56,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 04:21:56,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 04:21:56,813 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 04:21:56,813 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 04:21:56,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-71.i [2023-12-24 04:21:57,777 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 04:21:57,958 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 04:21:57,959 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-71.i [2023-12-24 04:21:57,968 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014b9b0d8/2a66b31a9b7548a8969273858f043b67/FLAGd1ead37a4 [2023-12-24 04:21:57,983 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014b9b0d8/2a66b31a9b7548a8969273858f043b67 [2023-12-24 04:21:57,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 04:21:57,989 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 04:21:57,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 04:21:57,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 04:21:57,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 04:21:57,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 04:21:57" (1/1) ... [2023-12-24 04:21:57,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37022ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:21:57, skipping insertion in model container [2023-12-24 04:21:57,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 04:21:57" (1/1) ... [2023-12-24 04:21:58,018 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 04:21:58,131 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_50-while_file-71.i[915,928] [2023-12-24 04:21:58,172 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 04:21:58,184 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 04:21:58,192 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_50-while_file-71.i[915,928] [2023-12-24 04:21:58,214 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 04:21:58,226 INFO L206 MainTranslator]: Completed translation [2023-12-24 04:21:58,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:21:58 WrapperNode [2023-12-24 04:21:58,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 04:21:58,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 04:21:58,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 04:21:58,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 04:21:58,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:21:58" (1/1) ... [2023-12-24 04:21:58,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:21:58" (1/1) ... [2023-12-24 04:21:58,262 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2023-12-24 04:21:58,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 04:21:58,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 04:21:58,263 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 04:21:58,263 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 04:21:58,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:21:58" (1/1) ... [2023-12-24 04:21:58,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:21:58" (1/1) ... [2023-12-24 04:21:58,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:21:58" (1/1) ... [2023-12-24 04:21:58,282 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-24 04:21:58,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:21:58" (1/1) ... [2023-12-24 04:21:58,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:21:58" (1/1) ... [2023-12-24 04:21:58,297 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:21:58" (1/1) ... [2023-12-24 04:21:58,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:21:58" (1/1) ... [2023-12-24 04:21:58,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:21:58" (1/1) ... [2023-12-24 04:21:58,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:21:58" (1/1) ... [2023-12-24 04:21:58,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 04:21:58,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 04:21:58,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 04:21:58,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 04:21:58,305 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:21:58" (1/1) ... [2023-12-24 04:21:58,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 04:21:58,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 04:21:58,332 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-24 04:21:58,334 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-24 04:21:58,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 04:21:58,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 04:21:58,352 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 04:21:58,353 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 04:21:58,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 04:21:58,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 04:21:58,406 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 04:21:58,408 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 04:22:07,597 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 04:22:07,626 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 04:22:07,627 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 04:22:07,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 04:22:07 BoogieIcfgContainer [2023-12-24 04:22:07,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 04:22:07,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 04:22:07,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 04:22:07,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 04:22:07,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 04:21:57" (1/3) ... [2023-12-24 04:22:07,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f29c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 04:22:07, skipping insertion in model container [2023-12-24 04:22:07,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:21:58" (2/3) ... [2023-12-24 04:22:07,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f29c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 04:22:07, skipping insertion in model container [2023-12-24 04:22:07,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 04:22:07" (3/3) ... [2023-12-24 04:22:07,633 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-71.i [2023-12-24 04:22:07,648 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 04:22:07,648 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 04:22:07,686 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 04:22:07,691 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;@76011fc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 04:22:07,691 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 04:22:07,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-24 04:22:07,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-24 04:22:07,703 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 04:22:07,704 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 04:22:07,704 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 04:22:07,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 04:22:07,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1171547984, now seen corresponding path program 1 times [2023-12-24 04:22:07,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 04:22:07,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581980481] [2023-12-24 04:22:07,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 04:22:07,718 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-24 04:22:07,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 04:22:07,720 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-24 04:22:07,723 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-24 04:22:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 04:22:08,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 04:22:08,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 04:22:08,215 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2023-12-24 04:22:08,215 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 04:22:08,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 04:22:08,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581980481] [2023-12-24 04:22:08,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581980481] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 04:22:08,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 04:22:08,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 04:22:08,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128267442] [2023-12-24 04:22:08,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 04:22:08,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 04:22:08,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 04:22:08,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 04:22:08,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 04:22:08,256 INFO L87 Difference]: Start difference. First operand has 56 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-24 04:22:12,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 04:22:12,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 04:22:12,525 INFO L93 Difference]: Finished difference Result 109 states and 193 transitions. [2023-12-24 04:22:12,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 04:22:12,619 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 129 [2023-12-24 04:22:12,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 04:22:12,624 INFO L225 Difference]: With dead ends: 109 [2023-12-24 04:22:12,624 INFO L226 Difference]: Without dead ends: 54 [2023-12-24 04:22:12,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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-24 04:22:12,631 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-24 04:22:12,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2023-12-24 04:22:12,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-24 04:22:12,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-12-24 04:22:12,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-24 04:22:12,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 82 transitions. [2023-12-24 04:22:12,666 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 82 transitions. Word has length 129 [2023-12-24 04:22:12,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 04:22:12,666 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 82 transitions. [2023-12-24 04:22:12,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-24 04:22:12,667 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 82 transitions. [2023-12-24 04:22:12,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-24 04:22:12,672 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 04:22:12,672 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 04:22:12,683 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-24 04:22:12,876 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-24 04:22:12,877 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 04:22:12,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 04:22:12,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1030626834, now seen corresponding path program 1 times [2023-12-24 04:22:12,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 04:22:12,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250985313] [2023-12-24 04:22:12,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 04:22:12,879 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-24 04:22:12,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 04:22:12,880 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-24 04:22:12,882 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-24 04:22:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 04:22:13,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 04:22:13,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 04:22:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-24 04:22:16,459 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 04:22:16,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 04:22:16,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250985313] [2023-12-24 04:22:16,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250985313] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 04:22:16,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 04:22:16,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 04:22:16,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318206437] [2023-12-24 04:22:16,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 04:22:16,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 04:22:16,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 04:22:16,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 04:22:16,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-24 04:22:16,462 INFO L87 Difference]: Start difference. First operand 54 states and 82 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-24 04:22:21,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 04:22:24,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 04:22:24,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 04:22:24,347 INFO L93 Difference]: Finished difference Result 161 states and 245 transitions. [2023-12-24 04:22:24,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 04:22:24,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 129 [2023-12-24 04:22:24,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 04:22:24,429 INFO L225 Difference]: With dead ends: 161 [2023-12-24 04:22:24,429 INFO L226 Difference]: Without dead ends: 108 [2023-12-24 04:22:24,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-24 04:22:24,431 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 61 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2023-12-24 04:22:24,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 240 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2023-12-24 04:22:24,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-24 04:22:24,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 93. [2023-12-24 04:22:24,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-24 04:22:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 142 transitions. [2023-12-24 04:22:24,460 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 142 transitions. Word has length 129 [2023-12-24 04:22:24,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 04:22:24,461 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 142 transitions. [2023-12-24 04:22:24,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-24 04:22:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 142 transitions. [2023-12-24 04:22:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-24 04:22:24,462 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 04:22:24,463 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 04:22:24,478 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-24 04:22:24,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 04:22:24,679 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 04:22:24,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 04:22:24,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1423653844, now seen corresponding path program 1 times [2023-12-24 04:22:24,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 04:22:24,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505642427] [2023-12-24 04:22:24,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 04:22:24,681 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-24 04:22:24,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 04:22:24,683 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 04:22:24,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 04:22:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 04:22:25,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-24 04:22:25,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 04:22:40,810 WARN L293 SmtUtils]: Spent 6.55s 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-24 04:22:47,085 WARN L293 SmtUtils]: Spent 6.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-24 04:22:56,943 WARN L293 SmtUtils]: Spent 6.66s 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-24 04:23:07,388 WARN L293 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:23:14,306 WARN L293 SmtUtils]: Spent 6.92s 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-24 04:23:20,869 WARN L293 SmtUtils]: Spent 6.56s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:23:50,514 WARN L293 SmtUtils]: Spent 5.14s 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-24 04:24:00,418 WARN L293 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:24:07,753 WARN L293 SmtUtils]: Spent 7.34s 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-24 04:24:13,538 WARN L293 SmtUtils]: Spent 5.78s 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-24 04:25:51,900 WARN L293 SmtUtils]: Spent 54.45s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 04:26:40,090 WARN L293 SmtUtils]: Spent 6.85s 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-24 04:26:53,106 WARN L293 SmtUtils]: Spent 6.19s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:27:04,943 WARN L293 SmtUtils]: Spent 6.56s 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-24 04:27:13,054 WARN L293 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:27:23,061 WARN L293 SmtUtils]: Spent 7.37s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:27:31,008 WARN L293 SmtUtils]: Spent 7.94s 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-24 04:27:40,352 WARN L293 SmtUtils]: Spent 5.53s 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-24 04:27:52,275 WARN L293 SmtUtils]: Spent 8.30s 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-24 04:27:57,290 WARN L293 SmtUtils]: Spent 5.01s 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-24 04:28:08,524 WARN L293 SmtUtils]: Spent 6.88s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:28:23,376 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_5~0))) (and (= ((_ sign_extend 8) c_~var_1_5~0) c_~var_1_21~0) (bvslt .cse0 ((_ zero_extend 16) c_~var_1_1~0)) (= c_~last_1_var_1_20~0 (_ bv10 16)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_11~0 (fp.neg .cse1)) (fp.leq c_~var_1_11~0 (fp.neg .cse2))) (and (fp.leq c_~var_1_11~0 .cse1) (fp.geq c_~var_1_11~0 .cse2)))) (let ((.cse5 ((_ sign_extend 24) c_~var_1_4~0)) (.cse7 (bvadd ((_ sign_extend 16) c_~var_1_15~0) (bvneg (bvadd (bvneg ((_ sign_extend 16) c_~var_1_17~0)) ((_ sign_extend 16) c_~var_1_16~0)))))) (let ((.cse6 (= ((_ extract 15 0) .cse7) c_~var_1_14~0)) (.cse3 (bvsgt .cse5 .cse0))) (or (and .cse3 (let ((.cse4 (bvslt .cse5 .cse7))) (or (and .cse4 (= ((_ extract 15 0) .cse5) c_~var_1_14~0)) (and (not .cse4) .cse6)))) (and (let ((.cse8 (bvslt .cse0 .cse7))) (or (and (= ((_ extract 15 0) .cse0) c_~var_1_14~0) .cse8) (and (not .cse8) .cse6))) (not .cse3))))) (= c_~var_1_11~0 c_~var_1_10~0) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (/ 511.0 2.0)))) (let ((.cse9 (fp.gt .cse10 c_~var_1_11~0))) (or (and (= c_~var_1_18~0 c_~var_1_11~0) (not .cse9)) (and (= c_~var_1_18~0 .cse10) .cse9)))) (not (= (_ bv0 8) c_~var_1_2~0)) (not (fp.geq c_~last_1_var_1_12~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_13~0) ((_ to_fp 8 24) c_currentRoundingMode (/ 319.0 10.0))))) (= c_~var_1_15~0 c_~var_1_20~0) (= (_ bv16 16) c_~last_1_var_1_21~0) (= c_~var_1_23~0 c_~var_1_22~0) (= (_ bv32 16) c_~last_1_var_1_14~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-12-24 04:28:29,389 WARN L293 SmtUtils]: Spent 5.98s 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-24 04:28:35,904 WARN L293 SmtUtils]: Spent 6.51s 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-24 04:28:56,921 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:29:06,269 WARN L293 SmtUtils]: Spent 6.52s 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-24 04:29:17,962 WARN L293 SmtUtils]: Spent 7.29s 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-24 04:29:23,641 WARN L293 SmtUtils]: Spent 5.68s 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-24 04:29:31,499 WARN L293 SmtUtils]: Spent 7.86s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:30:08,069 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:30:13,394 WARN L293 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:30:35,917 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_5~0))) (and (= ((_ sign_extend 8) c_~var_1_5~0) c_~var_1_21~0) (bvslt .cse0 ((_ zero_extend 16) c_~var_1_1~0)) (= c_~last_1_var_1_20~0 (_ bv10 16)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_11~0 (fp.neg .cse1)) (fp.leq c_~var_1_11~0 (fp.neg .cse2))) (and (fp.leq c_~var_1_11~0 .cse1) (fp.geq c_~var_1_11~0 .cse2)))) (let ((.cse5 ((_ sign_extend 24) c_~var_1_4~0)) (.cse7 (bvadd ((_ sign_extend 16) c_~var_1_15~0) (bvneg (bvadd (bvneg ((_ sign_extend 16) c_~var_1_17~0)) ((_ sign_extend 16) c_~var_1_16~0)))))) (let ((.cse6 (= ((_ extract 15 0) .cse7) c_~var_1_14~0)) (.cse3 (bvsgt .cse5 .cse0))) (or (and .cse3 (let ((.cse4 (bvslt .cse5 .cse7))) (or (and .cse4 (= ((_ extract 15 0) .cse5) c_~var_1_14~0)) (and (not .cse4) .cse6)))) (and (let ((.cse8 (bvslt .cse0 .cse7))) (or (and (= ((_ extract 15 0) .cse0) c_~var_1_14~0) .cse8) (and (not .cse8) .cse6))) (not .cse3))))) (= c_~var_1_11~0 c_~var_1_10~0) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (/ 511.0 2.0)))) (let ((.cse9 (fp.gt .cse10 c_~var_1_11~0))) (or (and (= c_~var_1_18~0 c_~var_1_11~0) (not .cse9)) (and (= c_~var_1_18~0 .cse10) .cse9)))) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_~var_1_19~0 .cse0) (not (fp.geq c_~last_1_var_1_12~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_13~0) ((_ to_fp 8 24) c_currentRoundingMode (/ 319.0 10.0))))) (= c_~var_1_15~0 c_~var_1_20~0) (= (_ bv16 16) c_~last_1_var_1_21~0) (= c_~var_1_23~0 c_~var_1_22~0) (= c_~var_1_3~0 (_ bv0 8)) (= (_ bv32 16) c_~last_1_var_1_14~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-24 04:30:39,996 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_5~0))) (and (= ((_ sign_extend 8) c_~var_1_5~0) c_~var_1_21~0) (bvslt .cse0 ((_ zero_extend 16) c_~var_1_1~0)) (= c_~last_1_var_1_20~0 (_ bv10 16)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_11~0 (fp.neg .cse1)) (fp.leq c_~var_1_11~0 (fp.neg .cse2))) (and (fp.leq c_~var_1_11~0 .cse1) (fp.geq c_~var_1_11~0 .cse2)))) (let ((.cse5 ((_ sign_extend 24) c_~var_1_4~0)) (.cse7 (bvadd ((_ sign_extend 16) c_~var_1_15~0) (bvneg (bvadd (bvneg ((_ sign_extend 16) c_~var_1_17~0)) ((_ sign_extend 16) c_~var_1_16~0)))))) (let ((.cse6 (= ((_ extract 15 0) .cse7) c_~var_1_14~0)) (.cse3 (bvsgt .cse5 .cse0))) (or (and .cse3 (let ((.cse4 (bvslt .cse5 .cse7))) (or (and .cse4 (= ((_ extract 15 0) .cse5) c_~var_1_14~0)) (and (not .cse4) .cse6)))) (and (let ((.cse8 (bvslt .cse0 .cse7))) (or (and (= ((_ extract 15 0) .cse0) c_~var_1_14~0) .cse8) (and (not .cse8) .cse6))) (not .cse3))))) (= c_~var_1_11~0 c_~var_1_10~0) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (/ 511.0 2.0)))) (let ((.cse9 (fp.gt .cse10 c_~var_1_11~0))) (or (and (= c_~var_1_18~0 c_~var_1_11~0) (not .cse9)) (and (= c_~var_1_18~0 .cse10) .cse9)))) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_~var_1_19~0 .cse0) (not (fp.geq c_~last_1_var_1_12~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_13~0) ((_ to_fp 8 24) c_currentRoundingMode (/ 319.0 10.0))))) (= c_~var_1_15~0 c_~var_1_20~0) (= (_ bv16 16) c_~last_1_var_1_21~0) (= c_~var_1_23~0 c_~var_1_22~0) (= c_~var_1_3~0 (_ bv0 8)) (= (_ bv32 16) c_~last_1_var_1_14~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true