./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 17717b63b09459fcd66600a5d5a8a3b248f0a597d7e83f55a52c01ebdad7484d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 18:12:46,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:12:46,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-08 18:12:46,570 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:12:46,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:12:46,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:12:46,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:12:46,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:12:46,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:12:46,587 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:12:46,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:12:46,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:12:46,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:12:46,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:12:46,589 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:12:46,589 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:12:46,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:12:46,590 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:12:46,590 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:12:46,590 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:12:46,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:12:46,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:12:46,592 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:12:46,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:12:46,592 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:12:46,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:12:46,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:12:46,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:12:46,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:12:46,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:12:46,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:12:46,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:12:46,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:12:46,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:12:46,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:12:46,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:12:46,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:12:46,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:12:46,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:12:46,596 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17717b63b09459fcd66600a5d5a8a3b248f0a597d7e83f55a52c01ebdad7484d [2024-11-08 18:12:46,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:12:46,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:12:46,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:12:46,844 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:12:46,845 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:12:46,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.c [2024-11-08 18:12:48,128 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:12:48,303 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:12:48,303 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.c [2024-11-08 18:12:48,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d04d8798a/fa00fcc9d1624f4bb44411277961a29c/FLAG401dba43d [2024-11-08 18:12:48,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d04d8798a/fa00fcc9d1624f4bb44411277961a29c [2024-11-08 18:12:48,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:12:48,701 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:12:48,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:12:48,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:12:48,707 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:12:48,709 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:12:48" (1/1) ... [2024-11-08 18:12:48,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65354b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:48, skipping insertion in model container [2024-11-08 18:12:48,711 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:12:48" (1/1) ... [2024-11-08 18:12:48,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:12:48,941 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.c[1247,1260] [2024-11-08 18:12:48,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:12:48,984 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:12:48,993 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.c[1247,1260] [2024-11-08 18:12:49,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:12:49,017 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:12:49,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:49 WrapperNode [2024-11-08 18:12:49,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:12:49,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:12:49,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:12:49,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:12:49,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:49" (1/1) ... [2024-11-08 18:12:49,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:49" (1/1) ... [2024-11-08 18:12:49,060 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 109 [2024-11-08 18:12:49,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:12:49,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:12:49,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:12:49,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:12:49,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:49" (1/1) ... [2024-11-08 18:12:49,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:49" (1/1) ... [2024-11-08 18:12:49,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:49" (1/1) ... [2024-11-08 18:12:49,094 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-08 18:12:49,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:49" (1/1) ... [2024-11-08 18:12:49,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:49" (1/1) ... [2024-11-08 18:12:49,100 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:49" (1/1) ... [2024-11-08 18:12:49,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:49" (1/1) ... [2024-11-08 18:12:49,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:49" (1/1) ... [2024-11-08 18:12:49,107 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:49" (1/1) ... [2024-11-08 18:12:49,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:12:49,110 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:12:49,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:12:49,110 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:12:49,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:49" (1/1) ... [2024-11-08 18:12:49,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:12:49,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:12:49,143 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-08 18:12:49,146 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-08 18:12:49,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:12:49,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:12:49,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:12:49,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:12:49,251 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:12:49,255 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:12:49,470 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-08 18:12:49,471 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:12:49,481 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:12:49,482 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:12:49,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:12:49 BoogieIcfgContainer [2024-11-08 18:12:49,484 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:12:49,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:12:49,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:12:49,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:12:49,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:12:48" (1/3) ... [2024-11-08 18:12:49,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc57623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:12:49, skipping insertion in model container [2024-11-08 18:12:49,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:49" (2/3) ... [2024-11-08 18:12:49,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc57623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:12:49, skipping insertion in model container [2024-11-08 18:12:49,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:12:49" (3/3) ... [2024-11-08 18:12:49,491 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.counter.c [2024-11-08 18:12:49,504 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:12:49,505 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:12:49,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:12:49,560 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;@15db19cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:12:49,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:12:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:12:49,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 18:12:49,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:12:49,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:12:49,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:12:49,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:12:49,573 INFO L85 PathProgramCache]: Analyzing trace with hash -209312282, now seen corresponding path program 1 times [2024-11-08 18:12:49,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:12:49,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782017486] [2024-11-08 18:12:49,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:12:49,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:12:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:12:49,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:12:49,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782017486] [2024-11-08 18:12:49,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782017486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:12:49,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:12:49,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:12:49,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366697454] [2024-11-08 18:12:49,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:12:49,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:12:49,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:12:49,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:12:49,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:12:49,958 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:12:49,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:12:49,999 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2024-11-08 18:12:50,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:12:50,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-08 18:12:50,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:12:50,008 INFO L225 Difference]: With dead ends: 53 [2024-11-08 18:12:50,008 INFO L226 Difference]: Without dead ends: 29 [2024-11-08 18:12:50,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:12:50,015 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:12:50,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:12:50,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-08 18:12:50,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-08 18:12:50,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:12:50,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2024-11-08 18:12:50,044 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 13 [2024-11-08 18:12:50,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:12:50,044 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2024-11-08 18:12:50,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:12:50,045 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-11-08 18:12:50,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 18:12:50,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:12:50,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:12:50,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:12:50,046 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:12:50,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:12:50,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2102949055, now seen corresponding path program 1 times [2024-11-08 18:12:50,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:12:50,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557710166] [2024-11-08 18:12:50,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:12:50,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:12:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:50,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:12:50,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:12:50,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557710166] [2024-11-08 18:12:50,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557710166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:12:50,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:12:50,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:12:50,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636795939] [2024-11-08 18:12:50,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:12:50,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:12:50,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:12:50,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:12:50,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:12:50,178 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:12:50,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:12:50,204 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2024-11-08 18:12:50,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:12:50,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-08 18:12:50,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:12:50,206 INFO L225 Difference]: With dead ends: 54 [2024-11-08 18:12:50,206 INFO L226 Difference]: Without dead ends: 31 [2024-11-08 18:12:50,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:12:50,208 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:12:50,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:12:50,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-08 18:12:50,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-08 18:12:50,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:12:50,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-11-08 18:12:50,212 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 14 [2024-11-08 18:12:50,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:12:50,212 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-11-08 18:12:50,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:12:50,213 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-11-08 18:12:50,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 18:12:50,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:12:50,213 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:12:50,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:12:50,213 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:12:50,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:12:50,214 INFO L85 PathProgramCache]: Analyzing trace with hash -331054625, now seen corresponding path program 1 times [2024-11-08 18:12:50,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:12:50,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873816176] [2024-11-08 18:12:50,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:12:50,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:12:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:12:50,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:12:50,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873816176] [2024-11-08 18:12:50,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873816176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:12:50,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:12:50,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:12:50,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175514140] [2024-11-08 18:12:50,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:12:50,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:12:50,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:12:50,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:12:50,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:12:50,357 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:12:50,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:12:50,383 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2024-11-08 18:12:50,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:12:50,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-08 18:12:50,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:12:50,384 INFO L225 Difference]: With dead ends: 54 [2024-11-08 18:12:50,384 INFO L226 Difference]: Without dead ends: 29 [2024-11-08 18:12:50,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:12:50,386 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 30 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:12:50,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 61 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:12:50,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-08 18:12:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-08 18:12:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:12:50,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-08 18:12:50,389 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2024-11-08 18:12:50,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:12:50,389 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-08 18:12:50,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:12:50,390 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-11-08 18:12:50,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 18:12:50,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:12:50,390 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:12:50,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:12:50,390 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:12:50,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:12:50,391 INFO L85 PathProgramCache]: Analyzing trace with hash -108213630, now seen corresponding path program 1 times [2024-11-08 18:12:50,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:12:50,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271307999] [2024-11-08 18:12:50,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:12:50,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:12:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:12:50,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:12:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:12:50,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:12:50,459 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:12:50,459 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:12:50,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:12:50,463 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 18:12:50,485 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:12:50,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:12:50 BoogieIcfgContainer [2024-11-08 18:12:50,487 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:12:50,488 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:12:50,488 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:12:50,488 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:12:50,488 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:12:49" (3/4) ... [2024-11-08 18:12:50,490 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:12:50,491 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:12:50,491 INFO L158 Benchmark]: Toolchain (without parser) took 1791.12ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 86.1MB in the end (delta: 25.5MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2024-11-08 18:12:50,491 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 96.5MB. Free memory is still 49.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:12:50,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.87ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 135.3MB in the end (delta: -23.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 18:12:50,492 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.74ms. Allocated memory is still 167.8MB. Free memory was 134.7MB in the beginning and 131.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:12:50,492 INFO L158 Benchmark]: Boogie Preprocessor took 48.18ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 128.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:12:50,492 INFO L158 Benchmark]: RCFGBuilder took 374.46ms. Allocated memory is still 167.8MB. Free memory was 128.9MB in the beginning and 110.9MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 18:12:50,492 INFO L158 Benchmark]: TraceAbstraction took 1001.29ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 87.1MB in the end (delta: 23.0MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2024-11-08 18:12:50,492 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 167.8MB. Free memory was 87.1MB in the beginning and 86.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:12:50,496 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 96.5MB. Free memory is still 49.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.87ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 135.3MB in the end (delta: -23.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.74ms. Allocated memory is still 167.8MB. Free memory was 134.7MB in the beginning and 131.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.18ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 128.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 374.46ms. Allocated memory is still 167.8MB. Free memory was 128.9MB in the beginning and 110.9MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1001.29ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 87.1MB in the end (delta: 23.0MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 167.8MB. Free memory was 87.1MB in the beginning and 86.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 58. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L32] const SORT_4 var_5 = 1; [L33] const SORT_4 var_8 = 0; [L34] const SORT_1 var_12 = 1; [L35] const SORT_4 var_18 = 15; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_18=15, var_5=1, var_8=0] [L40] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L42] SORT_4 init_7_arg_1 = var_5; [L43] state_6 = init_7_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_18=15, var_5=1, var_8=0] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_3 = __VERIFIER_nondet_uchar() [L48] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_18=15, var_5=1, var_8=0] [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_9_arg_0 = state_6; [L52] SORT_4 var_9_arg_1 = var_8; [L53] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L54] SORT_1 var_13_arg_0 = var_9; [L55] SORT_1 var_13 = ~var_13_arg_0; [L56] SORT_1 var_14_arg_0 = var_12; [L57] SORT_1 var_14_arg_1 = var_13; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_18=15, var_5=1, var_8=0] [L58] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_18=15, var_5=1, var_8=0] [L58] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L59] EXPR var_14 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_18=15, var_5=1, var_8=0] [L59] var_14 = var_14 & mask_SORT_1 [L60] SORT_1 bad_15_arg_0 = var_14; [L61] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 101 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 74 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 18:12:50,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 17717b63b09459fcd66600a5d5a8a3b248f0a597d7e83f55a52c01ebdad7484d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 18:12:52,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:12:52,480 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-08 18:12:52,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:12:52,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:12:52,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:12:52,511 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:12:52,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:12:52,512 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:12:52,513 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:12:52,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:12:52,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:12:52,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:12:52,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:12:52,514 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:12:52,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:12:52,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:12:52,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:12:52,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:12:52,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:12:52,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:12:52,519 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:12:52,519 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:12:52,519 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:12:52,519 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:12:52,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:12:52,520 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:12:52,520 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:12:52,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:12:52,520 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:12:52,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:12:52,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:12:52,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:12:52,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:12:52,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:12:52,521 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 18:12:52,521 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:12:52,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:12:52,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:12:52,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:12:52,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:12:52,523 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17717b63b09459fcd66600a5d5a8a3b248f0a597d7e83f55a52c01ebdad7484d [2024-11-08 18:12:52,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:12:52,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:12:52,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:12:52,822 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:12:52,822 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:12:52,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.c [2024-11-08 18:12:54,185 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:12:54,377 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:12:54,378 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.c [2024-11-08 18:12:54,385 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/351bf20f6/adab0b6cfc28459693e770c6e7b33020/FLAG5e7877b9d [2024-11-08 18:12:54,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/351bf20f6/adab0b6cfc28459693e770c6e7b33020 [2024-11-08 18:12:54,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:12:54,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:12:54,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:12:54,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:12:54,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:12:54,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:12:54" (1/1) ... [2024-11-08 18:12:54,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae25ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:54, skipping insertion in model container [2024-11-08 18:12:54,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:12:54" (1/1) ... [2024-11-08 18:12:54,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:12:54,963 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.c[1247,1260] [2024-11-08 18:12:54,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:12:55,005 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:12:55,015 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter.c[1247,1260] [2024-11-08 18:12:55,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:12:55,050 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:12:55,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55 WrapperNode [2024-11-08 18:12:55,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:12:55,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:12:55,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:12:55,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:12:55,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,085 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-11-08 18:12:55,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:12:55,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:12:55,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:12:55,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:12:55,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,098 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,112 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-08 18:12:55,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:12:55,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:12:55,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:12:55,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:12:55,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (1/1) ... [2024-11-08 18:12:55,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:12:55,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:12:55,160 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-08 18:12:55,166 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-08 18:12:55,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:12:55,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:12:55,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:12:55,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:12:55,272 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:12:55,273 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:12:55,419 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 18:12:55,420 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:12:55,431 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:12:55,431 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:12:55,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:12:55 BoogieIcfgContainer [2024-11-08 18:12:55,434 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:12:55,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:12:55,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:12:55,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:12:55,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:12:54" (1/3) ... [2024-11-08 18:12:55,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195df900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:12:55, skipping insertion in model container [2024-11-08 18:12:55,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:12:55" (2/3) ... [2024-11-08 18:12:55,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195df900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:12:55, skipping insertion in model container [2024-11-08 18:12:55,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:12:55" (3/3) ... [2024-11-08 18:12:55,440 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.counter.c [2024-11-08 18:12:55,453 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:12:55,453 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:12:55,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:12:55,501 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;@2b77db2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:12:55,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:12:55,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:12:55,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 18:12:55,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:12:55,511 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 18:12:55,512 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:12:55,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:12:55,518 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-08 18:12:55,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 18:12:55,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081849484] [2024-11-08 18:12:55,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:12:55,531 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-08 18:12:55,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 18:12:55,537 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-08 18:12:55,549 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-08 18:12:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:55,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 18:12:55,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:12:55,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:12:55,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:12:55,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 18:12:55,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081849484] [2024-11-08 18:12:55,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081849484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:12:55,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:12:55,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:12:55,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233482184] [2024-11-08 18:12:55,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:12:55,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:12:55,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 18:12:55,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:12:55,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:12:55,880 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:12:55,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:12:55,916 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-08 18:12:55,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:12:55,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-08 18:12:55,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:12:55,923 INFO L225 Difference]: With dead ends: 18 [2024-11-08 18:12:55,923 INFO L226 Difference]: Without dead ends: 10 [2024-11-08 18:12:55,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:12:55,930 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:12:55,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:12:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-08 18:12:55,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-08 18:12:55,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:12:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 18:12:55,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-08 18:12:55,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:12:55,955 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 18:12:55,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:12:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 18:12:55,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 18:12:55,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:12:55,955 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-08 18:12:55,959 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 (2)] Forceful destruction successful, exit code 0 [2024-11-08 18:12:56,158 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-08 18:12:56,159 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:12:56,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:12:56,160 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-08 18:12:56,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 18:12:56,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382558025] [2024-11-08 18:12:56,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:12:56,161 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-08 18:12:56,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 18:12:56,163 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-08 18:12:56,164 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-08 18:12:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:12:56,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 18:12:56,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:12:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:12:56,493 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:12:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:12:56,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 18:12:56,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382558025] [2024-11-08 18:12:56,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382558025] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:12:56,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:12:56,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-08 18:12:56,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325332745] [2024-11-08 18:12:56,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:12:56,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:12:56,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 18:12:56,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:12:56,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:12:56,959 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:12:57,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:12:57,196 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-08 18:12:57,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:12:57,197 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-08 18:12:57,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:12:57,197 INFO L225 Difference]: With dead ends: 18 [2024-11-08 18:12:57,197 INFO L226 Difference]: Without dead ends: 16 [2024-11-08 18:12:57,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:12:57,199 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:12:57,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:12:57,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-08 18:12:57,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-08 18:12:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:12:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-08 18:12:57,205 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-08 18:12:57,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:12:57,206 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-08 18:12:57,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:12:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-08 18:12:57,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 18:12:57,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:12:57,208 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-08 18:12:57,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 18:12:57,410 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-08 18:12:57,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:12:57,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:12:57,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2024-11-08 18:12:57,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 18:12:57,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884490170] [2024-11-08 18:12:57,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:12:57,413 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-08 18:12:57,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 18:12:57,416 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-08 18:12:57,417 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-08 18:12:57,480 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:12:57,480 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:12:57,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 18:12:57,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:12:57,897 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:12:57,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:13:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:13:02,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 18:13:02,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884490170] [2024-11-08 18:13:02,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884490170] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:13:02,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:13:02,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-08 18:13:02,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697881464] [2024-11-08 18:13:02,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:13:02,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 18:13:02,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 18:13:02,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 18:13:02,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:13:02,113 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:04,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:13:04,032 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-08 18:13:04,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 18:13:04,032 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-08 18:13:04,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:13:04,033 INFO L225 Difference]: With dead ends: 30 [2024-11-08 18:13:04,033 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 18:13:04,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2024-11-08 18:13:04,034 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:13:04,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:13:04,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 18:13:04,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-08 18:13:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:04,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-08 18:13:04,045 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2024-11-08 18:13:04,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:13:04,045 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-08 18:13:04,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:13:04,045 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-08 18:13:04,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 18:13:04,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:13:04,046 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2024-11-08 18:13:04,050 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-08 18:13:04,248 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-08 18:13:04,249 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:13:04,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:13:04,250 INFO L85 PathProgramCache]: Analyzing trace with hash 96933411, now seen corresponding path program 3 times [2024-11-08 18:13:04,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 18:13:04,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349472370] [2024-11-08 18:13:04,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 18:13:04,250 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-08 18:13:04,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 18:13:04,254 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-08 18:13:04,254 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-08 18:13:04,321 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-08 18:13:04,322 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:13:04,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 18:13:04,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:13:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-08 18:13:04,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:13:10,842 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse79 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse84 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_12~0#1|)) (.cse5 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse20 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_5~0#1|))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse20)))))))) (.cse3 (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse79 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) .cse84)))))))) (.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_8~0#1|)) (.cse8 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_18~0#1|))) (let ((.cse35 (or .cse3 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse86 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse85 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse86 .cse20))))))) .cse5))))) (or (= .cse4 .cse85) (not (= .cse8 .cse85)) (= .cse86 .cse8))))))) (.cse1 (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse79 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) .cse84)))))))) (.cse10 (= .cse19 .cse4)) (.cse0 (forall ((|v_ULTIMATE.start_main_~var_14_arg_0~0#1_31| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse79 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_14_arg_0~0#1_31|) (_ bv254 32)))))))))) (let ((.cse13 (or .cse0 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse83 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse82 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse83))))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse82)))))) (not (= .cse8 .cse82)) (= .cse83 .cse8))))))) (.cse67 (or .cse0 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse81 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse80 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse81))))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse80)))))) (not (= .cse8 .cse80)) (not (= .cse81 .cse8)))))))) (.cse11 (forall ((|v_ULTIMATE.start_main_~var_14_arg_0~0#1_31| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse79 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_14_arg_0~0#1_31|) (_ bv255 32))))))))) (.cse12 (not .cse10)) (.cse42 (and .cse35 (or .cse1 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse78 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (not (= .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse78 .cse20))))))) .cse5))))) (= .cse78 .cse8)))))))) (and (or .cse0 (let ((.cse2 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse7 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse7))))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse6)))))) (= .cse7 .cse8) (= .cse8 .cse6))))))) (and (or .cse1 .cse2) (or .cse3 .cse2)))) (or .cse3 (let ((.cse9 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse15))))))) (or (not (= .cse8 .cse14)) (= .cse4 .cse14) (= .cse15 .cse8))))))) (and (or .cse9 .cse0 .cse10) (or .cse9 .cse11 .cse12) .cse13))) (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|) .cse8))) (let ((.cse22 (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse19)))))))) (let ((.cse17 (or .cse22 .cse0)) (.cse18 (or .cse11 (not .cse22))) (.cse21 (= .cse8 .cse19))) (and (or (let ((.cse16 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse19 .cse20))))))) .cse5))) .cse4))) (and (or .cse0 .cse16) .cse17 .cse18 (or .cse11 (not .cse16)))) .cse21) (or (and (or .cse0 .cse10) .cse17 (or .cse11 .cse12) .cse18) (not .cse21))))) (and (or .cse3 .cse10) .cse1)) (or .cse0 (and (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 .cse20))))))) .cse5))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse23)))))) (= .cse8 .cse23) (= .cse24 .cse8))))) .cse1) (or .cse3 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 .cse20))))))) .cse5))))) (or (= .cse4 .cse25) (= .cse8 .cse25) (= .cse26 .cse8)))))))) (or (and (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse28 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse28))))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse27 .cse20))))))))))) (not (= .cse28 .cse8)) (= .cse4 .cse27) (= .cse8 .cse27))))) .cse3) (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse30 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse30))))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 .cse20))))))))))) (not (= .cse30 .cse8)) (= .cse8 .cse29))))) .cse1)) .cse0) (or .cse11 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse32 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse32 .cse20))))))) .cse5))))) (or (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse31))))))) (not (= .cse8 .cse31)) (= .cse32 .cse8))))) .cse1) (or .cse0 (and (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse34 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 .cse20))))))) .cse5))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse33)))))) (not (= .cse8 .cse33)) (= .cse34 .cse8))))) .cse1) .cse35)) (or (let ((.cse36 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse39 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (not (= .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse39))))))) (= .cse39 .cse8)))))) (and (or .cse11 .cse36 .cse12) (or .cse0 .cse36 .cse10) (or .cse11 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse38 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse38))))))) (or (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse37))))))) (not (= .cse8 .cse37)) (= .cse38 .cse8)))))) .cse13)) .cse1) (or .cse11 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse41 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse41))))))) (or (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse40))))))) (= .cse41 .cse8) (= .cse8 .cse40))))) .cse1) (or .cse0 .cse10 .cse42) (or .cse11 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse44 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse44))))))) (or (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse43))))))) (not (= .cse44 .cse8)) (= .cse8 .cse43))))) .cse1) (or .cse11 (and (or .cse3 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse46 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse46))))))) (or (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse45 .cse20)))))))))))) (= .cse4 .cse45) (= .cse46 .cse8) (= .cse8 .cse45)))))) (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse48 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse48))))))) (or (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse47 .cse20)))))))))))) (= .cse48 .cse8) (= .cse8 .cse47))))) .cse1))) (or .cse0 (and (or .cse3 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse50 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse50))))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse49 .cse20))))))))))) (= .cse4 .cse49) (= .cse50 .cse8) (= .cse8 .cse49)))))) (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse52 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse52))))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse51 .cse20))))))))))) (= .cse52 .cse8) (= .cse8 .cse51))))) .cse1))) (or (and (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse54 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse54 .cse20))))))) .cse5))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse53 .cse20))))))))))) (= .cse8 .cse53) (= .cse54 .cse8))))) .cse1) (or .cse3 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse56 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse55 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse56 .cse20))))))) .cse5))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse55 .cse20))))))))))) (= .cse4 .cse55) (= .cse8 .cse55) (= .cse56 .cse8))))))) .cse0) (or (and (or .cse3 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse58 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse57 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse58))))))) (or (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse57 .cse20)))))))))))) (not (= .cse58 .cse8)) (= .cse4 .cse57) (= .cse8 .cse57)))))) (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse60 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse59 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse60))))))) (or (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse59 .cse20)))))))))))) (not (= .cse60 .cse8)) (= .cse8 .cse59))))) .cse1)) .cse11) (or .cse0 (let ((.cse61 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse63 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse62 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse63))))))) (or (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse62)))))) (not (= .cse63 .cse8)) (= .cse8 .cse62))))))) (and (or .cse1 .cse61) (or .cse3 .cse61)))) (or (let ((.cse64 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse68 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (not (= .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse68))))))) (not (= .cse68 .cse8))))))) (and (or .cse11 .cse64 .cse12) (or .cse0 .cse64 .cse10) (or .cse11 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse66 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse65 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse66))))))) (or (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse65))))))) (not (= .cse8 .cse65)) (not (= .cse66 .cse8))))))) .cse67)) .cse1) (or .cse3 (let ((.cse69 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse71 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse70 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse71))))))) (or (not (= .cse8 .cse70)) (not (= .cse71 .cse8)) (= .cse4 .cse70))))))) (and (or .cse0 .cse10 .cse69) .cse67 (or .cse11 .cse69 .cse12)))) (or .cse11 (and (or .cse3 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse73 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse73 .cse20))))))) .cse5))))) (or (= .cse4 .cse72) (= .cse8 .cse72) (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse72 .cse20)))))))))))) (= .cse73 .cse8)))))) (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse75 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse74 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse75 .cse20))))))) .cse5))))) (or (= .cse8 .cse74) (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse74 .cse20)))))))))))) (= .cse75 .cse8))))) .cse1))) (or .cse11 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse77 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse77 .cse20))))))) .cse5))))) (or (not (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse76))))))) (= .cse8 .cse76) (= .cse77 .cse8))))) .cse1) (or .cse11 .cse12 .cse42)))))) is different from false