/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_n5_w8_d16_e0.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 08:38:19,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 08:38:19,576 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:38:19,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 08:38:19,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 08:38:19,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 08:38:19,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 08:38:19,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 08:38:19,613 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 08:38:19,613 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 08:38:19,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 08:38:19,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 08:38:19,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 08:38:19,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 08:38:19,617 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 08:38:19,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 08:38:19,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 08:38:19,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 08:38:19,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 08:38:19,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 08:38:19,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 08:38:19,622 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 08:38:19,622 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 08:38:19,623 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 08:38:19,623 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 08:38:19,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 08:38:19,623 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 08:38:19,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 08:38:19,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 08:38:19,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 08:38:19,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 08:38:19,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:38:19,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 08:38:19,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 08:38:19,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 08:38:19,626 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 08:38:19,626 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 08:38:19,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 08:38:19,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 08:38:19,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 08:38:19,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 08:38:19,628 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:38:19,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 08:38:19,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 08:38:19,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 08:38:19,881 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 08:38:19,882 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 08:38:19,883 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_n5_w8_d16_e0.c [2024-11-05 08:38:21,228 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 08:38:21,626 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 08:38:21,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n5_w8_d16_e0.c [2024-11-05 08:38:21,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8f5a2f6d/71bcb0ba6b984348a1a4c3bc3437da50/FLAGbea8f672e [2024-11-05 08:38:21,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8f5a2f6d/71bcb0ba6b984348a1a4c3bc3437da50 [2024-11-05 08:38:21,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 08:38:21,821 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 08:38:21,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 08:38:21,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 08:38:21,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 08:38:21,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:38:21" (1/1) ... [2024-11-05 08:38:21,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d629687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:21, skipping insertion in model container [2024-11-05 08:38:21,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:38:21" (1/1) ... [2024-11-05 08:38:21,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:38:22,132 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_n5_w8_d16_e0.c[1270,1283] [2024-11-05 08:38:22,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:38:22,597 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 08:38:22,607 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_n5_w8_d16_e0.c[1270,1283] [2024-11-05 08:38:22,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:38:22,793 INFO L204 MainTranslator]: Completed translation [2024-11-05 08:38:22,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:22 WrapperNode [2024-11-05 08:38:22,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 08:38:22,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 08:38:22,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 08:38:22,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 08:38:22,801 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:38:22" (1/1) ... [2024-11-05 08:38:22,857 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:38:22" (1/1) ... [2024-11-05 08:38:22,983 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3676 [2024-11-05 08:38:22,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 08:38:22,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 08:38:22,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 08:38:22,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 08:38:22,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:22" (1/1) ... [2024-11-05 08:38:22,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:22" (1/1) ... [2024-11-05 08:38:23,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:22" (1/1) ... [2024-11-05 08:38:23,080 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:38:23,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:22" (1/1) ... [2024-11-05 08:38:23,081 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:22" (1/1) ... [2024-11-05 08:38:23,182 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:22" (1/1) ... [2024-11-05 08:38:23,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:22" (1/1) ... [2024-11-05 08:38:23,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:22" (1/1) ... [2024-11-05 08:38:23,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:22" (1/1) ... [2024-11-05 08:38:23,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 08:38:23,253 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 08:38:23,253 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 08:38:23,254 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 08:38:23,254 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:22" (1/1) ... [2024-11-05 08:38:23,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:38:23,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 08:38:23,286 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:38:23,290 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:38:23,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 08:38:23,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 08:38:23,315 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 08:38:23,315 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 08:38:23,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 08:38:23,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 08:38:23,924 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 08:38:23,926 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 08:38:26,711 INFO L? ?]: Removed 1135 outVars from TransFormulas that were not future-live. [2024-11-05 08:38:26,711 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 08:38:26,725 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 08:38:26,725 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 08:38:26,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:38:26 BoogieIcfgContainer [2024-11-05 08:38:26,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 08:38:26,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 08:38:26,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 08:38:26,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 08:38:26,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:38:21" (1/3) ... [2024-11-05 08:38:26,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ece59e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:38:26, skipping insertion in model container [2024-11-05 08:38:26,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:22" (2/3) ... [2024-11-05 08:38:26,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ece59e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:38:26, skipping insertion in model container [2024-11-05 08:38:26,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:38:26" (3/3) ... [2024-11-05 08:38:26,735 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.arbitrated_top_n5_w8_d16_e0.c [2024-11-05 08:38:26,750 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 08:38:26,751 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 08:38:26,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 08:38:26,816 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;@222da84e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 08:38:26,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 08:38:26,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-05 08:38:26,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-05 08:38:26,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:38:26,834 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:26,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:38:26,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:38:26,840 INFO L85 PathProgramCache]: Analyzing trace with hash -726051243, now seen corresponding path program 1 times [2024-11-05 08:38:26,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:38:26,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [81868327] [2024-11-05 08:38:26,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:38:26,849 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:38:26,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:38:26,851 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:38:26,853 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:38:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:38:28,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 1407 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 08:38:28,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:38:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-05 08:38:28,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:38:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-05 08:38:28,234 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:38:28,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [81868327] [2024-11-05 08:38:28,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [81868327] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:38:28,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:38:28,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 08:38:28,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772737292] [2024-11-05 08:38:28,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:38:28,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 08:38:28,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:38:28,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 08:38:28,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 08:38:28,265 INFO L87 Difference]: Start difference. First operand has 46 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-05 08:38:28,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:38:28,290 INFO L93 Difference]: Finished difference Result 87 states and 138 transitions. [2024-11-05 08:38:28,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 08:38:28,292 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 101 [2024-11-05 08:38:28,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:38:28,299 INFO L225 Difference]: With dead ends: 87 [2024-11-05 08:38:28,300 INFO L226 Difference]: Without dead ends: 43 [2024-11-05 08:38:28,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 08:38:28,307 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:38:28,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:38:28,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-05 08:38:28,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-05 08:38:28,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-05 08:38:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2024-11-05 08:38:28,350 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 101 [2024-11-05 08:38:28,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:38:28,350 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2024-11-05 08:38:28,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-05 08:38:28,351 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2024-11-05 08:38:28,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-05 08:38:28,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:38:28,354 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:28,368 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:38:28,555 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:38:28,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:38:28,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:38:28,556 INFO L85 PathProgramCache]: Analyzing trace with hash -520200651, now seen corresponding path program 1 times [2024-11-05 08:38:28,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:38:28,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [385600242] [2024-11-05 08:38:28,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:38:28,557 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:38:28,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:38:28,560 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:38:28,561 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:38:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:38:30,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 1407 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-05 08:38:30,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:38:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-05 08:38:30,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:38:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-05 08:38:31,845 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:38:31,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [385600242] [2024-11-05 08:38:31,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [385600242] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:38:31,846 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:38:31,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 08:38:31,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368952336] [2024-11-05 08:38:31,847 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:38:31,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:38:31,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:38:31,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:38:31,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 08:38:31,852 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-05 08:38:32,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:38:32,379 INFO L93 Difference]: Finished difference Result 79 states and 110 transitions. [2024-11-05 08:38:32,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:38:32,379 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 101 [2024-11-05 08:38:32,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:38:32,382 INFO L225 Difference]: With dead ends: 79 [2024-11-05 08:38:32,382 INFO L226 Difference]: Without dead ends: 77 [2024-11-05 08:38:32,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 196 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:38:32,383 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 08:38:32,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 08:38:32,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-05 08:38:32,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-05 08:38:32,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-05 08:38:32,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 108 transitions. [2024-11-05 08:38:32,403 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 108 transitions. Word has length 101 [2024-11-05 08:38:32,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:38:32,404 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 108 transitions. [2024-11-05 08:38:32,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-05 08:38:32,405 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 108 transitions. [2024-11-05 08:38:32,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-05 08:38:32,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:38:32,411 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 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, 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:38:32,423 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:38:32,613 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:38:32,614 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:38:32,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:38:32,615 INFO L85 PathProgramCache]: Analyzing trace with hash -511202845, now seen corresponding path program 1 times [2024-11-05 08:38:32,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:38:32,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1279873924] [2024-11-05 08:38:32,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:38:32,615 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:38:32,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:38:32,621 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:38:32,623 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:38:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:38:40,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 2755 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-05 08:38:40,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:38:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2018 backedges. 30 proven. 97 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-05 08:38:41,546 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:38:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2018 backedges. 30 proven. 97 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-05 08:38:50,279 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:38:50,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1279873924] [2024-11-05 08:38:50,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1279873924] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:38:50,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:38:50,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-05 08:38:50,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471736722] [2024-11-05 08:38:50,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:38:50,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-05 08:38:50,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:38:50,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-05 08:38:50,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-05 08:38:50,283 INFO L87 Difference]: Start difference. First operand 77 states and 108 transitions. Second operand has 15 states, 13 states have (on average 6.615384615384615) internal successors, (86), 15 states have internal predecessors, (86), 8 states have call successors, (64), 1 states have call predecessors, (64), 2 states have return successors, (64), 6 states have call predecessors, (64), 8 states have call successors, (64) [2024-11-05 08:38:51,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:38:51,912 INFO L93 Difference]: Finished difference Result 114 states and 161 transitions. [2024-11-05 08:38:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-05 08:38:51,913 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.615384615384615) internal successors, (86), 15 states have internal predecessors, (86), 8 states have call successors, (64), 1 states have call predecessors, (64), 2 states have return successors, (64), 6 states have call predecessors, (64), 8 states have call successors, (64) Word has length 200 [2024-11-05 08:38:51,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:38:51,916 INFO L225 Difference]: With dead ends: 114 [2024-11-05 08:38:51,916 INFO L226 Difference]: Without dead ends: 112 [2024-11-05 08:38:51,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 385 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:38:51,917 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 19 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-05 08:38:51,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 339 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-05 08:38:51,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-05 08:38:51,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-05 08:38:51,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-05 08:38:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 159 transitions. [2024-11-05 08:38:51,938 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 159 transitions. Word has length 200 [2024-11-05 08:38:51,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:38:51,939 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 159 transitions. [2024-11-05 08:38:51,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.615384615384615) internal successors, (86), 15 states have internal predecessors, (86), 8 states have call successors, (64), 1 states have call predecessors, (64), 2 states have return successors, (64), 6 states have call predecessors, (64), 8 states have call successors, (64) [2024-11-05 08:38:51,940 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 159 transitions. [2024-11-05 08:38:51,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-05 08:38:51,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:38:51,945 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 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, 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:38:51,971 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 (4)] Ended with exit code 0 [2024-11-05 08:38:52,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:38:52,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:38:52,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:38:52,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2140848267, now seen corresponding path program 2 times [2024-11-05 08:38:52,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:38:52,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [452024903] [2024-11-05 08:38:52,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:38:52,147 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:38:52,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:38:52,148 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:38:52,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 08:39:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:39:14,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 4103 conjuncts, 154 conjuncts are in the unsatisfiable core [2024-11-05 08:39:14,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:39:27,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4615 backedges. 405 proven. 343 refuted. 0 times theorem prover too weak. 3867 trivial. 0 not checked. [2024-11-05 08:39:27,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:39:40,420 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_396~0#1|)) (.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_96~0#1|)) (.cse18 (= |c_ULTIMATE.start_main_~input_11~0#1| (_ bv0 8))) (.cse29 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_392~0#1|)) (.cse1 (= |c_ULTIMATE.start_main_~state_506~0#1| (_ bv0 8))) (.cse2 (forall ((|v_ULTIMATE.start_main_~var_547_arg_0~0#1_18| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_544_arg_1~0#1_17| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_547_arg_0~0#1_18|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_544_arg_1~0#1_17|)))))))))))))) (.cse0 (= (_ bv0 32) .cse6))) (let ((.cse16 (not .cse0)) (.cse13 (and (or (forall ((|v_ULTIMATE.start_main_~var_414_arg_1~0#1_17| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_395_arg_1~0#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_547_arg_0~0#1_18| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_547_arg_0~0#1_18|) ((_ 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 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse29 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_395_arg_1~0#1_16|))))))) (_ bv255 32))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_414_arg_1~0#1_17|)))))))))))))))) (not .cse1)) (or .cse1 .cse2))) (.cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse29)))) (.cse9 (not .cse18)) (.cse17 (forall ((|v_ULTIMATE.start_main_~var_407_arg_1~0#1_17| (_ 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_407_arg_1~0#1_17|))))))))) (.cse20 (forall ((|v_ULTIMATE.start_main_~var_407_arg_1~0#1_17| (_ 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_407_arg_1~0#1_17|)))))))))) (.cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_82~0#1|))))) (.cse21 (= ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_435~0#1|) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_512~0#1|)))) (and (or (let ((.cse19 (forall ((|ULTIMATE.start_main_~var_373~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~var_373~0#1|))))))))))))) (_ bv0 32))))) (let ((.cse11 (or .cse18 .cse19 .cse20)) (.cse10 (or .cse17 .cse18 .cse19))) (and (or .cse0 (and (or .cse1 .cse2 (and (or (forall ((|v_ULTIMATE.start_main_~var_401_arg_0~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~var_373~0#1| (_ BitVec 8))) (let ((.cse7 ((_ zero_extend 24) |ULTIMATE.start_main_~var_373~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 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_401_arg_0~0#1_16|))))))) .cse6))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 .cse7))))))))))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse7)))))))))))) (_ bv0 32))))) .cse9) .cse10)) (or (and .cse11 (or (forall ((|v_ULTIMATE.start_main_~var_401_arg_0~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~var_373~0#1| (_ BitVec 8))) (let ((.cse12 ((_ zero_extend 24) |ULTIMATE.start_main_~var_373~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 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_401_arg_0~0#1_16|))))))) .cse6))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 .cse12)))))))))))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse12)))))))))))) (_ bv0 32))))) .cse9)) .cse13))) (or (and (or (and .cse11 (or (forall ((|v_ULTIMATE.start_main_~var_401_arg_0~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~var_373~0#1| (_ BitVec 8))) (let ((.cse14 ((_ zero_extend 24) |ULTIMATE.start_main_~var_373~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 .cse14)))) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_401_arg_0~0#1_16|))))))))))))))))) (_ bv0 32))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse14)))))))))))) (_ bv0 32))))) .cse9)) .cse1 .cse2) (or (and (or (forall ((|v_ULTIMATE.start_main_~var_401_arg_0~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~var_373~0#1| (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) |ULTIMATE.start_main_~var_373~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 .cse15)))) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_401_arg_0~0#1_16|))))))))))))))))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse15)))))))))))) (_ bv0 32))))) .cse9) .cse10) .cse1 .cse2)) .cse16)))) .cse21) (or (let ((.cse28 (forall ((|ULTIMATE.start_main_~var_373~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~var_373~0#1|)))))))))) .cse4))) (_ bv0 32))))) (let ((.cse24 (or .cse28 .cse18 .cse20)) (.cse23 (or .cse17 .cse28 .cse18))) (and (or .cse16 (and (or .cse1 .cse2 (and (or (forall ((|v_ULTIMATE.start_main_~var_401_arg_0~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~var_373~0#1| (_ BitVec 8))) (let ((.cse22 ((_ zero_extend 24) |ULTIMATE.start_main_~var_373~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 .cse22)))) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_401_arg_0~0#1_16|))))))))))))))))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse22))))))))) .cse4))) (_ bv0 32))))) .cse9) .cse23)) (or .cse1 (and .cse24 (or .cse9 (forall ((|v_ULTIMATE.start_main_~var_401_arg_0~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~var_373~0#1| (_ BitVec 8))) (let ((.cse25 ((_ zero_extend 24) |ULTIMATE.start_main_~var_373~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse25))))))))) .cse4))) (_ bv0 32)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 .cse25)))) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_401_arg_0~0#1_16|))))))))))))))))) (_ bv0 32)))))))) .cse2))) (or (and (or (and .cse24 (or (forall ((|v_ULTIMATE.start_main_~var_401_arg_0~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~var_373~0#1| (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) |ULTIMATE.start_main_~var_373~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse26))))))))) .cse4))) (_ 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 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_401_arg_0~0#1_16|))))))) .cse6))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 .cse26))))))))))))))))) .cse9)) .cse13) (or .cse1 .cse2 (and .cse23 (or (forall ((|v_ULTIMATE.start_main_~var_401_arg_0~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~var_373~0#1| (_ BitVec 8))) (let ((.cse27 ((_ zero_extend 24) |ULTIMATE.start_main_~var_373~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 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_401_arg_0~0#1_16|))))))) .cse6))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 .cse27))))))))))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse27))))))))) .cse4))) (_ bv0 32))))) .cse9)))) .cse0)))) (not .cse21)))))) is different from false