/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_w32_d16_e0.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 08:35:08,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 08:35:08,775 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-05 08:35:08,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 08:35:08,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 08:35:08,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 08:35:08,799 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 08:35:08,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 08:35:08,800 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 08:35:08,800 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 08:35:08,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 08:35:08,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 08:35:08,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 08:35:08,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 08:35:08,802 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 08:35:08,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 08:35:08,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 08:35:08,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 08:35:08,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 08:35:08,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 08:35:08,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 08:35:08,804 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 08:35:08,805 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 08:35:08,805 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 08:35:08,805 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 08:35:08,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 08:35:08,806 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 08:35:08,806 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 08:35:08,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 08:35:08,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 08:35:08,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 08:35:08,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:35:08,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 08:35:08,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 08:35:08,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 08:35:08,808 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 08:35:08,808 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 08:35:08,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 08:35:08,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 08:35:08,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 08:35:08,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 08:35:08,813 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-05 08:35:09,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 08:35:09,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 08:35:09,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 08:35:09,099 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 08:35:09,099 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 08:35:09,101 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_w32_d16_e0.c [2024-11-05 08:35:10,598 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 08:35:10,971 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 08:35:10,971 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n3_w32_d16_e0.c [2024-11-05 08:35:10,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cea0d1fb/524a4bc53cf54020a20ae7e67a750aa4/FLAGbe4bd2e65 [2024-11-05 08:35:11,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cea0d1fb/524a4bc53cf54020a20ae7e67a750aa4 [2024-11-05 08:35:11,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 08:35:11,024 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 08:35:11,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 08:35:11,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 08:35:11,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 08:35:11,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:35:11" (1/1) ... [2024-11-05 08:35:11,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@134817b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:11, skipping insertion in model container [2024-11-05 08:35:11,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:35:11" (1/1) ... [2024-11-05 08:35:11,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:35:11,364 WARN L250 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_w32_d16_e0.c[1325,1338] [2024-11-05 08:35:11,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:35:11,759 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 08:35:11,771 WARN L250 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_w32_d16_e0.c[1325,1338] [2024-11-05 08:35:11,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:35:11,956 INFO L204 MainTranslator]: Completed translation [2024-11-05 08:35:11,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:11 WrapperNode [2024-11-05 08:35:11,958 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 08:35:11,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 08:35:11,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 08:35:11,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 08:35:11,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:11" (1/1) ... [2024-11-05 08:35:12,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:11" (1/1) ... [2024-11-05 08:35:12,129 INFO L138 Inliner]: procedures = 18, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2642 [2024-11-05 08:35:12,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 08:35:12,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 08:35:12,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 08:35:12,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 08:35:12,142 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:11" (1/1) ... [2024-11-05 08:35:12,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:11" (1/1) ... [2024-11-05 08:35:12,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:11" (1/1) ... [2024-11-05 08:35:12,227 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-05 08:35:12,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:11" (1/1) ... [2024-11-05 08:35:12,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:11" (1/1) ... [2024-11-05 08:35:12,344 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:11" (1/1) ... [2024-11-05 08:35:12,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:11" (1/1) ... [2024-11-05 08:35:12,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:11" (1/1) ... [2024-11-05 08:35:12,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:11" (1/1) ... [2024-11-05 08:35:12,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 08:35:12,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 08:35:12,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 08:35:12,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 08:35:12,415 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:11" (1/1) ... [2024-11-05 08:35:12,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:35:12,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 08:35:12,455 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-05 08:35:12,457 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-05 08:35:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 08:35:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 08:35:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 08:35:12,477 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 08:35:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 08:35:12,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 08:35:12,887 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 08:35:12,888 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 08:35:15,044 INFO L? ?]: Removed 953 outVars from TransFormulas that were not future-live. [2024-11-05 08:35:15,045 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 08:35:15,057 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 08:35:15,057 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 08:35:15,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:35:15 BoogieIcfgContainer [2024-11-05 08:35:15,058 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 08:35:15,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 08:35:15,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 08:35:15,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 08:35:15,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:35:11" (1/3) ... [2024-11-05 08:35:15,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e34cc5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:35:15, skipping insertion in model container [2024-11-05 08:35:15,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:35:11" (2/3) ... [2024-11-05 08:35:15,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e34cc5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:35:15, skipping insertion in model container [2024-11-05 08:35:15,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:35:15" (3/3) ... [2024-11-05 08:35:15,067 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.arbitrated_top_n3_w32_d16_e0.c [2024-11-05 08:35:15,084 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 08:35:15,084 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 08:35:15,145 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 08:35:15,153 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;@c56a75f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 08:35:15,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 08:35:15,158 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-05 08:35:15,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-05 08:35:15,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:35:15,167 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-05 08:35:15,168 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:35:15,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:35:15,174 INFO L85 PathProgramCache]: Analyzing trace with hash -209771273, now seen corresponding path program 1 times [2024-11-05 08:35:15,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:35:15,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [707845113] [2024-11-05 08:35:15,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:35:15,183 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-05 08:35:15,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:35:15,187 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-05 08:35:15,188 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-05 08:35:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:35:17,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-05 08:35:17,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:35:17,516 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-05 08:35:17,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:35:18,112 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-05 08:35:18,114 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:35:18,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [707845113] [2024-11-05 08:35:18,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [707845113] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:35:18,115 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:35:18,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 08:35:18,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140221694] [2024-11-05 08:35:18,118 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:35:18,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:35:18,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:35:18,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:35:18,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 08:35:18,150 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-05 08:35:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:35:18,756 INFO L93 Difference]: Finished difference Result 85 states and 140 transitions. [2024-11-05 08:35:18,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:35:18,758 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-05 08:35:18,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:35:18,765 INFO L225 Difference]: With dead ends: 85 [2024-11-05 08:35:18,765 INFO L226 Difference]: Without dead ends: 53 [2024-11-05 08:35:18,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 08:35:18,775 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-05 08:35:18,776 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.6s Time] [2024-11-05 08:35:18,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-05 08:35:18,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-05 08:35:18,812 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-05 08:35:18,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 72 transitions. [2024-11-05 08:35:18,817 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 72 transitions. Word has length 65 [2024-11-05 08:35:18,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:35:18,819 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 72 transitions. [2024-11-05 08:35:18,819 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-05 08:35:18,819 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2024-11-05 08:35:18,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-05 08:35:18,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:35:18,824 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-05 08:35:18,842 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-05 08:35:19,028 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-05 08:35:19,029 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:35:19,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:35:19,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1242097501, now seen corresponding path program 1 times [2024-11-05 08:35:19,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:35:19,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1751641511] [2024-11-05 08:35:19,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:35:19,031 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-05 08:35:19,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:35:19,032 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-05 08:35:19,034 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-05 08:35:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:35:26,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 2215 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-05 08:35:27,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:35:27,703 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-05 08:35:27,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:35:32,018 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-05 08:35:32,019 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:35:32,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1751641511] [2024-11-05 08:35:32,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1751641511] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:35:32,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:35:32,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-05 08:35:32,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275237059] [2024-11-05 08:35:32,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:35:32,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-05 08:35:32,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:35:32,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-05 08:35:32,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-05 08:35:32,026 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-05 08:35:33,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:35:33,745 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2024-11-05 08:35:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-05 08:35:33,746 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-05 08:35:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:35:33,748 INFO L225 Difference]: With dead ends: 78 [2024-11-05 08:35:33,748 INFO L226 Difference]: Without dead ends: 76 [2024-11-05 08:35:33,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-11-05 08:35:33,750 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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, 1.6s IncrementalHoareTripleChecker+Time [2024-11-05 08:35:33,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 181 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-05 08:35:33,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-05 08:35:33,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-05 08:35:33,768 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-05 08:35:33,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 105 transitions. [2024-11-05 08:35:33,771 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 105 transitions. Word has length 128 [2024-11-05 08:35:33,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:35:33,772 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 105 transitions. [2024-11-05 08:35:33,772 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-05 08:35:33,772 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 105 transitions. [2024-11-05 08:35:33,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-05 08:35:33,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:35:33,775 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-05 08:35:33,805 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 [2024-11-05 08:35:33,976 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-05 08:35:33,976 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:35:33,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:35:33,977 INFO L85 PathProgramCache]: Analyzing trace with hash -2139398281, now seen corresponding path program 2 times [2024-11-05 08:35:33,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:35:33,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [975222675] [2024-11-05 08:35:33,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:35:33,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:35:33,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:35:33,984 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-05 08:35:33,985 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-05 08:35:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:35:54,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 3271 conjuncts, 154 conjuncts are in the unsatisfiable core [2024-11-05 08:35:54,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:36:00,073 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-05 08:36:00,074 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:36:07,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse22 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_344~0#1|)) (.cse16 (= ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_368~0#1|) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_428~0#1|))) (.cse1 (= |c_ULTIMATE.start_main_~input_11~0#1| (_ bv0 8))) (.cse4 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_422~0#1|)) (.cse5 (forall ((|v_ULTIMATE.start_main_~var_448_arg_1~0#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_451_arg_0~0#1_17| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_451_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_448_arg_1~0#1_16|)))))))))))))) (.cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_96~0#1|)) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_82~0#1|))))) (.cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_348~0#1|))) (let ((.cse0 (= (_ bv0 32) .cse7)) (.cse3 (forall ((|ULTIMATE.start_main_~var_305~0#1| (_ BitVec 8))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~var_305~0#1|)))) (_ bv0 32)))) .cse11))))))))) (.cse17 (forall ((|ULTIMATE.start_main_~var_305~0#1| (_ BitVec 8))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~var_305~0#1|)))) (_ bv1 32))))))))))))) (.cse20 (or .cse4 .cse5 (forall ((|v_ULTIMATE.start_main_~var_359_arg_1~0#1_16| (_ BitVec 8))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_359_arg_1~0#1_16|)))))))))) (.cse21 (forall ((|v_ULTIMATE.start_main_~var_359_arg_1~0#1_16| (_ BitVec 8))) (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_359_arg_1~0#1_16|)))))))))) (.cse14 (not .cse1)) (.cse15 (not .cse16)) (.cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse22))))) (and (or .cse0 (let ((.cse12 (and (or .cse4 .cse5) (or (forall ((|v_ULTIMATE.start_main_~var_366_arg_1~0#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_347_arg_1~0#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_451_arg_0~0#1_17| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ 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) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_347_arg_1~0#1_16|) .cse22))) (_ bv1 32)))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_366_arg_1~0#1_16|))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_451_arg_0~0#1_17|)))) .cse8)))) (not .cse4))))) (let ((.cse2 (and .cse20 (or .cse21 .cse12)))) (and (or (and (or .cse1 .cse2 .cse3) (or (and (or .cse4 .cse5 (forall ((|v_ULTIMATE.start_main_~var_353_arg_0~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~var_305~0#1| (_ BitVec 8))) (let ((.cse10 ((_ zero_extend 24) |ULTIMATE.start_main_~var_305~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_353_arg_0~0#1_15|)))))))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse10)))))))))))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse10))) (_ bv0 32)))) .cse11))))))))))) (or .cse12 (forall ((|v_ULTIMATE.start_main_~var_353_arg_0~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~var_305~0#1| (_ BitVec 8))) (let ((.cse13 ((_ zero_extend 24) |ULTIMATE.start_main_~var_305~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_353_arg_0~0#1_15|)))))))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse13)))))))))))) (_ bv0 32))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse13))) (_ bv0 32)))) .cse11)))))))))))) .cse14)) .cse15) (or .cse16 (and (or .cse1 .cse2 .cse17) (or (and (or .cse12 (forall ((|v_ULTIMATE.start_main_~var_353_arg_0~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~var_305~0#1| (_ BitVec 8))) (let ((.cse18 ((_ zero_extend 24) |ULTIMATE.start_main_~var_305~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_353_arg_0~0#1_15|)))))))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse18)))))))))))) (_ bv0 32))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse18))) (_ bv1 32))))))))))))))) (or .cse4 .cse5 (forall ((|v_ULTIMATE.start_main_~var_353_arg_0~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~var_305~0#1| (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) |ULTIMATE.start_main_~var_305~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_353_arg_0~0#1_15|)))))))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse19)))))))))))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse19))) (_ bv1 32)))))))))))))))) .cse14))))))) (or (not .cse0) (and (or .cse1 (and (or .cse15 .cse3) (or .cse16 .cse17)) (and .cse20 (or .cse4 .cse21 .cse5))) (or .cse14 (and (or .cse4 (and (or .cse16 (forall ((|v_ULTIMATE.start_main_~var_353_arg_0~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~var_305~0#1| (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~var_305~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_353_arg_0~0#1_15|))))))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse23))))))))))))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse23))) (_ bv1 32))))))))))))))) (or (forall ((|v_ULTIMATE.start_main_~var_353_arg_0~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~var_305~0#1| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) |ULTIMATE.start_main_~var_305~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_353_arg_0~0#1_15|))))))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse24))))))))))))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse24))) (_ bv0 32)))) .cse11)))))))))) .cse15)) .cse5) (or (and (or (forall ((|v_ULTIMATE.start_main_~var_353_arg_0~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~var_305~0#1| (_ BitVec 8))) (let ((.cse25 ((_ zero_extend 24) |ULTIMATE.start_main_~var_305~0#1|))) (or (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_353_arg_0~0#1_15|))))))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse25)))))))))))))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse25))) (_ bv0 32)))) .cse11)))))))))) .cse15) (or .cse16 (forall ((|v_ULTIMATE.start_main_~var_353_arg_0~0#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~var_305~0#1| (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) |ULTIMATE.start_main_~var_305~0#1|))) (or (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_353_arg_0~0#1_15|))))))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse26)))))))))))))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse26))) (_ bv1 32)))))))))))))))) .cse4 .cse5))))))))) is different from false [2024-11-05 08:36:32,604 WARN L286 SmtUtils]: Spent 10.79s on a formula simplification that was a NOOP. DAG size: 217 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)