/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver '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' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n3_w8_d8_e0.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-356b6ba-m [2024-11-01 16:29:20,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-01 16:29:20,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-01 16:29:20,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-01 16:29:20,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-01 16:29:20,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-01 16:29:20,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-01 16:29:20,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-01 16:29:20,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-01 16:29:20,123 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-01 16:29:20,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-01 16:29:20,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-01 16:29:20,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-01 16:29:20,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-01 16:29:20,125 INFO L153 SettingsManager]: * Use SBE=true [2024-11-01 16:29:20,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-01 16:29:20,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-01 16:29:20,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-01 16:29:20,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-01 16:29:20,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-01 16:29:20,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-01 16:29:20,130 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-01 16:29:20,130 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-01 16:29:20,130 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-01 16:29:20,130 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-01 16:29:20,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-01 16:29:20,131 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-01 16:29:20,131 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-01 16:29:20,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-01 16:29:20,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-01 16:29:20,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-01 16:29:20,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 16:29:20,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-01 16:29:20,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-01 16:29:20,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-01 16:29:20,133 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-01 16:29:20,133 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-01 16:29:20,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-01 16:29:20,133 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-01 16:29:20,133 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-01 16:29:20,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-01 16:29:20,134 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-11-01 16:29:20,134 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 16:29:20,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-01 16:29:20,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-01 16:29:20,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-01 16:29:20,431 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-01 16:29:20,431 INFO L274 PluginConnector]: CDTParser initialized [2024-11-01 16:29:20,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n3_w8_d8_e0.c [2024-11-01 16:29:21,716 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-01 16:29:21,962 INFO L384 CDTParser]: Found 1 translation units. [2024-11-01 16:29:21,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n3_w8_d8_e0.c [2024-11-01 16:29:21,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d6978345/5e3779b349de4e25bd4f9e7ed3de55a7/FLAGdb877014f [2024-11-01 16:29:22,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d6978345/5e3779b349de4e25bd4f9e7ed3de55a7 [2024-11-01 16:29:22,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-01 16:29:22,296 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-01 16:29:22,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-01 16:29:22,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-01 16:29:22,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-01 16:29:22,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 04:29:22" (1/1) ... [2024-11-01 16:29:22,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d6ee3e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:29:22, skipping insertion in model container [2024-11-01 16:29:22,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 04:29:22" (1/1) ... [2024-11-01 16:29:22,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-01 16:29:22,539 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n3_w8_d8_e0.c[1269,1282] [2024-11-01 16:29:22,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 16:29:22,816 INFO L200 MainTranslator]: Completed pre-run [2024-11-01 16:29:22,824 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n3_w8_d8_e0.c[1269,1282] [2024-11-01 16:29:22,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 16:29:22,925 INFO L204 MainTranslator]: Completed translation [2024-11-01 16:29:22,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:29:22 WrapperNode [2024-11-01 16:29:22,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-01 16:29:22,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-01 16:29:22,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-01 16:29:22,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-01 16:29:22,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:29:22" (1/1) ... [2024-11-01 16:29:22,959 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:29:22" (1/1) ... [2024-11-01 16:29:23,039 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1578 [2024-11-01 16:29:23,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-01 16:29:23,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-01 16:29:23,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-01 16:29:23,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-01 16:29:23,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:29:22" (1/1) ... [2024-11-01 16:29:23,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:29:22" (1/1) ... [2024-11-01 16:29:23,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:29:22" (1/1) ... [2024-11-01 16:29:23,111 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]. [2024-11-01 16:29:23,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:29:22" (1/1) ... [2024-11-01 16:29:23,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:29:22" (1/1) ... [2024-11-01 16:29:23,149 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:29:22" (1/1) ... [2024-11-01 16:29:23,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:29:22" (1/1) ... [2024-11-01 16:29:23,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:29:22" (1/1) ... [2024-11-01 16:29:23,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:29:22" (1/1) ... [2024-11-01 16:29:23,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-01 16:29:23,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-01 16:29:23,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-01 16:29:23,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-01 16:29:23,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:29:22" (1/1) ... [2024-11-01 16:29:23,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 16:29:23,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 16:29:23,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-01 16:29:23,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-01 16:29:23,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-01 16:29:23,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-01 16:29:23,241 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-01 16:29:23,241 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-01 16:29:23,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-01 16:29:23,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-01 16:29:23,577 INFO L238 CfgBuilder]: Building ICFG [2024-11-01 16:29:23,579 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-01 16:29:24,502 INFO L? ?]: Removed 521 outVars from TransFormulas that were not future-live. [2024-11-01 16:29:24,502 INFO L287 CfgBuilder]: Performing block encoding [2024-11-01 16:29:24,513 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-01 16:29:24,513 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-01 16:29:24,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 04:29:24 BoogieIcfgContainer [2024-11-01 16:29:24,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-01 16:29:24,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-01 16:29:24,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-01 16:29:24,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-01 16:29:24,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 04:29:22" (1/3) ... [2024-11-01 16:29:24,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6856b0f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 04:29:24, skipping insertion in model container [2024-11-01 16:29:24,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:29:22" (2/3) ... [2024-11-01 16:29:24,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6856b0f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 04:29:24, skipping insertion in model container [2024-11-01 16:29:24,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 04:29:24" (3/3) ... [2024-11-01 16:29:24,520 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.arbitrated_top_n3_w8_d8_e0.c [2024-11-01 16:29:24,531 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-01 16:29:24,531 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-01 16:29:24,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-01 16:29:24,580 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@c8bb186, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-01 16:29:24,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-01 16:29:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-01 16:29:24,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-01 16:29:24,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 16:29:24,590 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-01 16:29:24,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 16:29:24,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 16:29:24,595 INFO L85 PathProgramCache]: Analyzing trace with hash -209771273, now seen corresponding path program 1 times [2024-11-01 16:29:24,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 16:29:24,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1783476773] [2024-11-01 16:29:24,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 16:29:24,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 16:29:24,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 16:29:24,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-01 16:29:24,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-01 16:29:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 16:29:25,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-01 16:29:25,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 16:29:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-01 16:29:25,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 16:29:25,939 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-01 16:29:25,940 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 16:29:25,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1783476773] [2024-11-01 16:29:25,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1783476773] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 16:29:25,941 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 16:29:25,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-01 16:29:25,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029171684] [2024-11-01 16:29:25,942 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 16:29:25,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-01 16:29:25,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 16:29:25,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-01 16:29:25,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-01 16:29:25,967 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-01 16:29:26,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 16:29:26,162 INFO L93 Difference]: Finished difference Result 85 states and 140 transitions. [2024-11-01 16:29:26,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-01 16:29:26,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 65 [2024-11-01 16:29:26,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 16:29:26,171 INFO L225 Difference]: With dead ends: 85 [2024-11-01 16:29:26,171 INFO L226 Difference]: Without dead ends: 53 [2024-11-01 16:29:26,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-01 16:29:26,176 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-01 16:29:26,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-01 16:29:26,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-01 16:29:26,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-01 16:29:26,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-01 16:29:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 72 transitions. [2024-11-01 16:29:26,213 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 72 transitions. Word has length 65 [2024-11-01 16:29:26,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 16:29:26,214 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 72 transitions. [2024-11-01 16:29:26,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-01 16:29:26,214 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2024-11-01 16:29:26,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-01 16:29:26,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 16:29:26,218 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-01 16:29:26,227 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 [2024-11-01 16:29:26,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 16:29:26,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 16:29:26,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 16:29:26,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1242097501, now seen corresponding path program 1 times [2024-11-01 16:29:26,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 16:29:26,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [949113802] [2024-11-01 16:29:26,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 16:29:26,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 16:29:26,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 16:29:26,425 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-01 16:29:26,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-01 16:29:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 16:29:28,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-01 16:29:28,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 16:29:29,195 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 18 proven. 61 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-01 16:29:29,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 16:29:34,518 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 18 proven. 61 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-01 16:29:34,518 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 16:29:34,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [949113802] [2024-11-01 16:29:34,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [949113802] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 16:29:34,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 16:29:34,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-01 16:29:34,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204777787] [2024-11-01 16:29:34,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 16:29:34,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-01 16:29:34,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 16:29:34,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-01 16:29:34,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-01 16:29:34,522 INFO L87 Difference]: Start difference. First operand 53 states and 72 transitions. Second operand has 15 states, 13 states have (on average 4.769230769230769) internal successors, (62), 15 states have internal predecessors, (62), 8 states have call successors, (40), 1 states have call predecessors, (40), 2 states have return successors, (40), 6 states have call predecessors, (40), 8 states have call successors, (40) [2024-11-01 16:29:35,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 16:29:35,300 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2024-11-01 16:29:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-01 16:29:35,301 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.769230769230769) internal successors, (62), 15 states have internal predecessors, (62), 8 states have call successors, (40), 1 states have call predecessors, (40), 2 states have return successors, (40), 6 states have call predecessors, (40), 8 states have call successors, (40) Word has length 128 [2024-11-01 16:29:35,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 16:29:35,302 INFO L225 Difference]: With dead ends: 78 [2024-11-01 16:29:35,302 INFO L226 Difference]: Without dead ends: 76 [2024-11-01 16:29:35,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-11-01 16:29:35,304 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-01 16:29:35,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 181 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-01 16:29:35,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-01 16:29:35,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-01 16:29:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-01 16:29:35,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 105 transitions. [2024-11-01 16:29:35,324 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 105 transitions. Word has length 128 [2024-11-01 16:29:35,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 16:29:35,325 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 105 transitions. [2024-11-01 16:29:35,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.769230769230769) internal successors, (62), 15 states have internal predecessors, (62), 8 states have call successors, (40), 1 states have call predecessors, (40), 2 states have return successors, (40), 6 states have call predecessors, (40), 8 states have call successors, (40) [2024-11-01 16:29:35,325 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 105 transitions. [2024-11-01 16:29:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-01 16:29:35,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 16:29:35,337 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2024-11-01 16:29:35,349 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 (3)] Ended with exit code 0 [2024-11-01 16:29:35,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 16:29:35,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 16:29:35,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 16:29:35,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2139398281, now seen corresponding path program 2 times [2024-11-01 16:29:35,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 16:29:35,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1278338518] [2024-11-01 16:29:35,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 16:29:35,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 16:29:35,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 16:29:35,547 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-01 16:29:35,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-01 16:29:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 16:29:39,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 1919 conjuncts, 154 conjuncts are in the unsatisfiable core [2024-11-01 16:29:39,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 16:29:50,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 234 proven. 208 refuted. 0 times theorem prover too weak. 1365 trivial. 0 not checked. [2024-11-01 16:29:50,924 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 16:29:57,165 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse5 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_160~0#1|))) (let ((.cse11 (= |c_ULTIMATE.start_main_~state_234~0#1| (_ bv0 8))) (.cse10 (= .cse5 (_ bv0 32))) (.cse12 (forall ((|v_ULTIMATE.start_main_~var_263_arg_0~0#1_17| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_260_arg_1~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_263_arg_0~0#1_17|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_260_arg_1~0#1_16|))))))))))))))) (let ((.cse8 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_156~0#1|)) (.cse9 (or .cse11 (not .cse10) .cse12))) (let ((.cse1 (and (or .cse10 .cse11 .cse12) .cse9)) (.cse3 (and .cse9 (or .cse10 (and (or (forall ((|v_ULTIMATE.start_main_~var_159_arg_1~0#1_15| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_263_arg_0~0#1_17| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_178_arg_1~0#1_16| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_178_arg_1~0#1_16|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_159_arg_1~0#1_15|))))))) (_ bv255 32))))))))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_263_arg_0~0#1_17|)))))) (_ bv0 8))) (not .cse11)) (or .cse11 .cse12))))) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_58~0#1|)) (.cse0 (= |c_ULTIMATE.start_main_~input_11~0#1| (_ bv0 8)))) (and (or .cse0 (and (or .cse1 (forall ((|v_ULTIMATE.start_main_~var_171_arg_1~0#1_16| (_ BitVec 8))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_171_arg_1~0#1_16|))))))))) (or .cse3 (forall ((|v_ULTIMATE.start_main_~var_171_arg_1~0#1_16| (_ BitVec 8))) (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_171_arg_1~0#1_16|)))))))))))) (or (let ((.cse4 (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_141~0#1|)))))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse8))))) (and (or .cse1 (forall ((|v_ULTIMATE.start_main_~var_165_arg_0~0#1_15| (_ BitVec 8))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_165_arg_0~0#1_15|) .cse6))) .cse7))))))))))))))))) (or .cse3 (forall ((|v_ULTIMATE.start_main_~var_165_arg_0~0#1_15| (_ BitVec 8))) (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_165_arg_0~0#1_15|) .cse6))) .cse7)))))))))))))))))))) (not .cse0))))))) is different from false [2024-11-01 16:30:48,819 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_160~0#1|))) (let ((.cse17 (= |c_ULTIMATE.start_main_~state_234~0#1| (_ bv0 8))) (.cse16 (= .cse4 (_ bv0 32))) (.cse18 (forall ((|v_ULTIMATE.start_main_~var_263_arg_0~0#1_17| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_260_arg_1~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_263_arg_0~0#1_17|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_260_arg_1~0#1_16|))))))))))))))) (let ((.cse14 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_156~0#1|)) (.cse15 (or .cse17 (not .cse16) .cse18))) (let ((.cse7 (and (or .cse16 .cse17 .cse18) .cse15)) (.cse6 (and .cse15 (or .cse16 (and (or (forall ((|v_ULTIMATE.start_main_~var_159_arg_1~0#1_15| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_263_arg_0~0#1_17| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_178_arg_1~0#1_16| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_178_arg_1~0#1_16|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_159_arg_1~0#1_15|))))))) (_ bv255 32))))))))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_263_arg_0~0#1_17|)))))) (_ bv0 8))) (not .cse17)) (or .cse17 .cse18))))) (.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_58~0#1|)) (.cse10 (= |c_ULTIMATE.start_main_~input_11~0#1| (_ bv0 8)))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse14)))) (.cse9 (not .cse10)) (.cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_45~0#1|))))) (.cse11 (and (or .cse7 (forall ((|v_ULTIMATE.start_main_~var_171_arg_1~0#1_16| (_ BitVec 8))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_171_arg_1~0#1_16|))))))))) (or .cse6 (forall ((|v_ULTIMATE.start_main_~var_171_arg_1~0#1_16| (_ BitVec 8))) (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_171_arg_1~0#1_16|))))))))))))) (and (or (= ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_180~0#1|) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_240~0#1|)) (and (or (and (or (forall ((|ULTIMATE.start_main_~var_141~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_165_arg_0~0#1_15| (_ BitVec 8))) (let ((.cse2 ((_ zero_extend 24) |ULTIMATE.start_main_~var_141~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse2)))))))))))) (_ bv0 32)) (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_165_arg_0~0#1_15|) .cse5))) .cse0)))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse2))))))))))))))))) .cse6) (or .cse7 (forall ((|ULTIMATE.start_main_~var_141~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_165_arg_0~0#1_15| (_ BitVec 8))) (let ((.cse8 ((_ zero_extend 24) |ULTIMATE.start_main_~var_141~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_165_arg_0~0#1_15|) .cse5))) .cse0)))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse8))))))))))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse8)))))))))))) (_ bv0 32))))))) .cse9) (or .cse10 (forall ((|ULTIMATE.start_main_~var_141~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~var_141~0#1|))))))))))))) (_ bv0 32))) .cse11))) (or (and (or .cse6 (forall ((|ULTIMATE.start_main_~var_141~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_165_arg_0~0#1_15| (_ BitVec 8))) (let ((.cse12 ((_ zero_extend 24) |ULTIMATE.start_main_~var_141~0#1|))) (or (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_165_arg_0~0#1_15|) .cse5))) .cse0)))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse12)))))))))))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse12)))))) .cse1)))))) (_ bv0 32)))))) (or .cse7 (forall ((|ULTIMATE.start_main_~var_141~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_165_arg_0~0#1_15| (_ BitVec 8))) (let ((.cse13 ((_ zero_extend 24) |ULTIMATE.start_main_~var_141~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_165_arg_0~0#1_15|) .cse5))) .cse0)))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse13))))))))))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse13)))))) .cse1)))))) (_ bv0 32))))))) .cse9) (or .cse10 (forall ((|ULTIMATE.start_main_~var_141~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~var_141~0#1|))))))) .cse1)))))) (_ bv0 32))) .cse11))))))) is different from false