./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 8f99c9b906e0ce9dfb5a1fdac7e796a2c68c541e986f60427db8a196999b6c01 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:24:24,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:24:24,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 05:24:24,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:24:24,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:24:24,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:24:24,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:24:24,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:24:24,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:24:24,598 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:24:24,598 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:24:24,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:24:24,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:24:24,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:24:24,600 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:24:24,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:24:24,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:24:24,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:24:24,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:24:24,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:24:24,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:24:24,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:24:24,605 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:24:24,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:24:24,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:24:24,606 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:24:24,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:24:24,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:24:24,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:24:24,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:24:24,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:24:24,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:24:24,608 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:24:24,609 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:24:24,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:24:24,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:24:24,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:24:24,610 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:24:24,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:24:24,611 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-clean/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-clean/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 -> 8f99c9b906e0ce9dfb5a1fdac7e796a2c68c541e986f60427db8a196999b6c01 [2024-10-11 05:24:24,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:24:24,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:24:24,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:24:24,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:24:24,886 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:24:24,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c [2024-10-11 05:24:26,424 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:24:26,713 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:24:26,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c [2024-10-11 05:24:26,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/38b078161/96ca1b67c8474ab295cb18f02261ce6a/FLAGb51f7aa4a [2024-10-11 05:24:27,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/38b078161/96ca1b67c8474ab295cb18f02261ce6a [2024-10-11 05:24:27,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:24:27,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:24:27,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:24:27,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:24:27,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:24:27,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:24:27" (1/1) ... [2024-10-11 05:24:27,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a22e87c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:27, skipping insertion in model container [2024-10-11 05:24:27,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:24:27" (1/1) ... [2024-10-11 05:24:27,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:24:27,320 WARN L248 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.bakery.4.prop1-func-interl.c[1173,1186] [2024-10-11 05:24:27,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:24:27,748 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:24:27,762 WARN L248 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.bakery.4.prop1-func-interl.c[1173,1186] [2024-10-11 05:24:27,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:24:27,932 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:24:27,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:27 WrapperNode [2024-10-11 05:24:27,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:24:27,934 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:24:27,934 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:24:27,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:24:27,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:27" (1/1) ... [2024-10-11 05:24:28,006 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:27" (1/1) ... [2024-10-11 05:24:28,863 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 5234 [2024-10-11 05:24:28,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:24:28,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:24:28,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:24:28,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:24:28,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:27" (1/1) ... [2024-10-11 05:24:28,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:27" (1/1) ... [2024-10-11 05:24:29,055 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:27" (1/1) ... [2024-10-11 05:24:29,207 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-10-11 05:24:29,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:27" (1/1) ... [2024-10-11 05:24:29,208 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:27" (1/1) ... [2024-10-11 05:24:29,428 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:27" (1/1) ... [2024-10-11 05:24:29,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:27" (1/1) ... [2024-10-11 05:24:29,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:27" (1/1) ... [2024-10-11 05:24:29,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:27" (1/1) ... [2024-10-11 05:24:29,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:24:29,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:24:29,740 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:24:29,740 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:24:29,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:27" (1/1) ... [2024-10-11 05:24:29,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:24:29,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:24:29,779 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:24:29,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:24:29,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:24:29,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:24:29,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:24:29,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:24:30,185 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:24:30,188 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:24:35,335 INFO L? ?]: Removed 2933 outVars from TransFormulas that were not future-live. [2024-10-11 05:24:35,336 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:24:35,474 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:24:35,474 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 05:24:35,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:24:35 BoogieIcfgContainer [2024-10-11 05:24:35,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:24:35,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:24:35,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:24:35,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:24:35,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:24:27" (1/3) ... [2024-10-11 05:24:35,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c83cf17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:24:35, skipping insertion in model container [2024-10-11 05:24:35,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:27" (2/3) ... [2024-10-11 05:24:35,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c83cf17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:24:35, skipping insertion in model container [2024-10-11 05:24:35,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:24:35" (3/3) ... [2024-10-11 05:24:35,483 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bakery.4.prop1-func-interl.c [2024-10-11 05:24:35,497 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:24:35,497 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 05:24:35,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:24:35,612 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;@4f9a09cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:24:35,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 05:24:35,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 1799 states, 1797 states have (on average 1.5002782415136338) internal successors, (2696), 1798 states have internal predecessors, (2696), 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-10-11 05:24:35,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 05:24:35,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:24:35,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:24:35,640 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:24:35,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:24:35,647 INFO L85 PathProgramCache]: Analyzing trace with hash -126842389, now seen corresponding path program 1 times [2024-10-11 05:24:35,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:24:35,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140346008] [2024-10-11 05:24:35,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:24:35,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:24:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:24:36,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:24:36,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:24:36,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140346008] [2024-10-11 05:24:36,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140346008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:24:36,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:24:36,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:24:36,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487248941] [2024-10-11 05:24:36,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:24:36,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:24:36,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:24:36,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:24:36,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:24:36,677 INFO L87 Difference]: Start difference. First operand has 1799 states, 1797 states have (on average 1.5002782415136338) internal successors, (2696), 1798 states have internal predecessors, (2696), 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 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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-10-11 05:24:36,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:24:36,885 INFO L93 Difference]: Finished difference Result 3486 states and 5226 transitions. [2024-10-11 05:24:36,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:24:36,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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 106 [2024-10-11 05:24:36,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:24:36,913 INFO L225 Difference]: With dead ends: 3486 [2024-10-11 05:24:36,914 INFO L226 Difference]: Without dead ends: 1800 [2024-10-11 05:24:36,922 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-10-11 05:24:36,926 INFO L432 NwaCegarLoop]: 2691 mSDtfsCounter, 0 mSDsluCounter, 5377 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8068 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:24:36,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8068 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:24:36,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2024-10-11 05:24:37,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1800. [2024-10-11 05:24:37,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1799 states have (on average 1.4986103390772652) internal successors, (2696), 1799 states have internal predecessors, (2696), 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-10-11 05:24:37,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2696 transitions. [2024-10-11 05:24:37,063 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2696 transitions. Word has length 106 [2024-10-11 05:24:37,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:24:37,065 INFO L471 AbstractCegarLoop]: Abstraction has 1800 states and 2696 transitions. [2024-10-11 05:24:37,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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-10-11 05:24:37,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2696 transitions. [2024-10-11 05:24:37,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 05:24:37,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:24:37,069 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:24:37,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:24:37,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:24:37,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:24:37,073 INFO L85 PathProgramCache]: Analyzing trace with hash 364549053, now seen corresponding path program 1 times [2024-10-11 05:24:37,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:24:37,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114676363] [2024-10-11 05:24:37,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:24:37,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:24:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:24:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:24:37,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:24:37,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114676363] [2024-10-11 05:24:37,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114676363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:24:37,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:24:37,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:24:37,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711506024] [2024-10-11 05:24:37,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:24:37,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:24:37,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:24:37,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:24:37,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:24:37,539 INFO L87 Difference]: Start difference. First operand 1800 states and 2696 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-10-11 05:24:37,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:24:37,636 INFO L93 Difference]: Finished difference Result 3489 states and 5226 transitions. [2024-10-11 05:24:37,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:24:37,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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 107 [2024-10-11 05:24:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:24:37,701 INFO L225 Difference]: With dead ends: 3489 [2024-10-11 05:24:37,702 INFO L226 Difference]: Without dead ends: 1802 [2024-10-11 05:24:37,704 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-10-11 05:24:37,705 INFO L432 NwaCegarLoop]: 2691 mSDtfsCounter, 0 mSDsluCounter, 5374 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8065 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:24:37,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8065 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:24:37,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2024-10-11 05:24:37,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2024-10-11 05:24:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1801 states have (on average 1.4980566352026652) internal successors, (2698), 1801 states have internal predecessors, (2698), 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-10-11 05:24:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2698 transitions. [2024-10-11 05:24:37,745 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2698 transitions. Word has length 107 [2024-10-11 05:24:37,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:24:37,747 INFO L471 AbstractCegarLoop]: Abstraction has 1802 states and 2698 transitions. [2024-10-11 05:24:37,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-10-11 05:24:37,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2698 transitions. [2024-10-11 05:24:37,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 05:24:37,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:24:37,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:24:37,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:24:37,754 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:24:37,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:24:37,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1613120772, now seen corresponding path program 1 times [2024-10-11 05:24:37,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:24:37,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290330429] [2024-10-11 05:24:37,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:24:37,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:24:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:24:38,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:24:38,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:24:38,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290330429] [2024-10-11 05:24:38,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290330429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:24:38,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:24:38,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:24:38,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571165330] [2024-10-11 05:24:38,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:24:38,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:24:38,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:24:38,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:24:38,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:24:38,089 INFO L87 Difference]: Start difference. First operand 1802 states and 2698 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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-10-11 05:24:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:24:38,166 INFO L93 Difference]: Finished difference Result 3497 states and 5236 transitions. [2024-10-11 05:24:38,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:24:38,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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 108 [2024-10-11 05:24:38,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:24:38,174 INFO L225 Difference]: With dead ends: 3497 [2024-10-11 05:24:38,175 INFO L226 Difference]: Without dead ends: 1808 [2024-10-11 05:24:38,177 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-10-11 05:24:38,178 INFO L432 NwaCegarLoop]: 2691 mSDtfsCounter, 4 mSDsluCounter, 5368 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8059 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:24:38,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8059 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:24:38,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2024-10-11 05:24:38,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2024-10-11 05:24:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 1.4975096845600442) internal successors, (2706), 1807 states have internal predecessors, (2706), 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-10-11 05:24:38,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2706 transitions. [2024-10-11 05:24:38,220 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2706 transitions. Word has length 108 [2024-10-11 05:24:38,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:24:38,221 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 2706 transitions. [2024-10-11 05:24:38,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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-10-11 05:24:38,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2706 transitions. [2024-10-11 05:24:38,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 05:24:38,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:24:38,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:24:38,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:24:38,223 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:24:38,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:24:38,225 INFO L85 PathProgramCache]: Analyzing trace with hash -478806037, now seen corresponding path program 1 times [2024-10-11 05:24:38,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:24:38,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564837886] [2024-10-11 05:24:38,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:24:38,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:24:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:24:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:24:38,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:24:38,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564837886] [2024-10-11 05:24:38,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564837886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:24:38,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:24:38,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:24:38,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386913422] [2024-10-11 05:24:38,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:24:38,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:24:38,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:24:38,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:24:38,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:24:38,575 INFO L87 Difference]: Start difference. First operand 1808 states and 2706 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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-10-11 05:24:38,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:24:38,699 INFO L93 Difference]: Finished difference Result 3507 states and 5248 transitions. [2024-10-11 05:24:38,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:24:38,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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 109 [2024-10-11 05:24:38,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:24:38,710 INFO L225 Difference]: With dead ends: 3507 [2024-10-11 05:24:38,710 INFO L226 Difference]: Without dead ends: 1812 [2024-10-11 05:24:38,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:24:38,720 INFO L432 NwaCegarLoop]: 2691 mSDtfsCounter, 0 mSDsluCounter, 8042 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10733 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:24:38,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10733 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:24:38,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2024-10-11 05:24:38,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1808. [2024-10-11 05:24:38,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 1.4975096845600442) internal successors, (2706), 1807 states have internal predecessors, (2706), 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-10-11 05:24:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2706 transitions. [2024-10-11 05:24:38,771 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2706 transitions. Word has length 109 [2024-10-11 05:24:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:24:38,772 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 2706 transitions. [2024-10-11 05:24:38,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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-10-11 05:24:38,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2706 transitions. [2024-10-11 05:24:38,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 05:24:38,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:24:38,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:24:38,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:24:38,775 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:24:38,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:24:38,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1049197795, now seen corresponding path program 1 times [2024-10-11 05:24:38,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:24:38,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600604427] [2024-10-11 05:24:38,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:24:38,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:24:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:24:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:24:39,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:24:39,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600604427] [2024-10-11 05:24:39,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600604427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:24:39,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:24:39,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:24:39,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948622563] [2024-10-11 05:24:39,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:24:39,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:24:39,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:24:39,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:24:39,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:24:39,113 INFO L87 Difference]: Start difference. First operand 1808 states and 2706 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 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-10-11 05:24:41,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:24:41,303 INFO L93 Difference]: Finished difference Result 5182 states and 7756 transitions. [2024-10-11 05:24:41,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:24:41,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 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 110 [2024-10-11 05:24:41,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:24:41,317 INFO L225 Difference]: With dead ends: 5182 [2024-10-11 05:24:41,317 INFO L226 Difference]: Without dead ends: 3487 [2024-10-11 05:24:41,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:24:41,322 INFO L432 NwaCegarLoop]: 2082 mSDtfsCounter, 2579 mSDsluCounter, 6115 mSDsCounter, 0 mSdLazyCounter, 2410 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2579 SdHoareTripleChecker+Valid, 8197 SdHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:24:41,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2579 Valid, 8197 Invalid, 2411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2410 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 05:24:41,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2024-10-11 05:24:41,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 1887. [2024-10-11 05:24:41,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1886 states have (on average 1.4968186638388123) internal successors, (2823), 1886 states have internal predecessors, (2823), 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-10-11 05:24:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2823 transitions. [2024-10-11 05:24:41,389 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2823 transitions. Word has length 110 [2024-10-11 05:24:41,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:24:41,390 INFO L471 AbstractCegarLoop]: Abstraction has 1887 states and 2823 transitions. [2024-10-11 05:24:41,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 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-10-11 05:24:41,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2823 transitions. [2024-10-11 05:24:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 05:24:41,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:24:41,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:24:41,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:24:41,394 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:24:41,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:24:41,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2068591559, now seen corresponding path program 1 times [2024-10-11 05:24:41,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:24:41,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130145579] [2024-10-11 05:24:41,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:24:41,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:24:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:24:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:24:41,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:24:41,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130145579] [2024-10-11 05:24:41,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130145579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:24:41,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:24:41,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:24:41,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164491849] [2024-10-11 05:24:41,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:24:41,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:24:41,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:24:41,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:24:41,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:24:41,779 INFO L87 Difference]: Start difference. First operand 1887 states and 2823 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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-10-11 05:24:43,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:24:43,156 INFO L93 Difference]: Finished difference Result 3582 states and 5360 transitions. [2024-10-11 05:24:43,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:24:43,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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 111 [2024-10-11 05:24:43,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:24:43,164 INFO L225 Difference]: With dead ends: 3582 [2024-10-11 05:24:43,164 INFO L226 Difference]: Without dead ends: 1887 [2024-10-11 05:24:43,168 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-10-11 05:24:43,171 INFO L432 NwaCegarLoop]: 2072 mSDtfsCounter, 2591 mSDsluCounter, 4135 mSDsCounter, 0 mSdLazyCounter, 1860 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2591 SdHoareTripleChecker+Valid, 6207 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:24:43,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2591 Valid, 6207 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1860 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:24:43,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2024-10-11 05:24:43,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1887. [2024-10-11 05:24:43,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1886 states have (on average 1.494697773064687) internal successors, (2819), 1886 states have internal predecessors, (2819), 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-10-11 05:24:43,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2819 transitions. [2024-10-11 05:24:43,241 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2819 transitions. Word has length 111 [2024-10-11 05:24:43,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:24:43,241 INFO L471 AbstractCegarLoop]: Abstraction has 1887 states and 2819 transitions. [2024-10-11 05:24:43,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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-10-11 05:24:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2819 transitions. [2024-10-11 05:24:43,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 05:24:43,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:24:43,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:24:43,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:24:43,249 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:24:43,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:24:43,250 INFO L85 PathProgramCache]: Analyzing trace with hash 21175838, now seen corresponding path program 1 times [2024-10-11 05:24:43,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:24:43,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632171101] [2024-10-11 05:24:43,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:24:43,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:24:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 05:24:43,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 05:24:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 05:24:43,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 05:24:43,480 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 05:24:43,481 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 05:24:43,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:24:43,486 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:24:43,594 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 05:24:43,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:24:43 BoogieIcfgContainer [2024-10-11 05:24:43,599 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 05:24:43,600 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 05:24:43,600 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 05:24:43,600 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 05:24:43,601 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:24:35" (3/4) ... [2024-10-11 05:24:43,603 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 05:24:43,604 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 05:24:43,605 INFO L158 Benchmark]: Toolchain (without parser) took 16592.84ms. Allocated memory was 146.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 91.3MB in the beginning and 633.1MB in the end (delta: -541.8MB). Peak memory consumption was 757.2MB. Max. memory is 16.1GB. [2024-10-11 05:24:43,605 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 146.8MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 05:24:43,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 918.61ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 91.3MB in the beginning and 112.3MB in the end (delta: -21.1MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2024-10-11 05:24:43,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 930.57ms. Allocated memory was 192.9MB in the beginning and 195.0MB in the end (delta: 2.1MB). Free memory was 112.3MB in the beginning and 70.0MB in the end (delta: 42.4MB). Peak memory consumption was 160.3MB. Max. memory is 16.1GB. [2024-10-11 05:24:43,606 INFO L158 Benchmark]: Boogie Preprocessor took 873.40ms. Allocated memory was 195.0MB in the beginning and 390.1MB in the end (delta: 195.0MB). Free memory was 70.0MB in the beginning and 229.1MB in the end (delta: -159.2MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2024-10-11 05:24:43,606 INFO L158 Benchmark]: RCFGBuilder took 5735.72ms. Allocated memory was 390.1MB in the beginning and 962.6MB in the end (delta: 572.5MB). Free memory was 229.1MB in the beginning and 784.5MB in the end (delta: -555.4MB). Peak memory consumption was 212.2MB. Max. memory is 16.1GB. [2024-10-11 05:24:43,607 INFO L158 Benchmark]: TraceAbstraction took 8122.65ms. Allocated memory was 962.6MB in the beginning and 1.4GB in the end (delta: 480.2MB). Free memory was 783.5MB in the beginning and 633.1MB in the end (delta: 150.4MB). Peak memory consumption was 631.7MB. Max. memory is 16.1GB. [2024-10-11 05:24:43,607 INFO L158 Benchmark]: Witness Printer took 4.09ms. Allocated memory is still 1.4GB. Free memory is still 633.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 05:24:43,608 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.22ms. Allocated memory is still 146.8MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 918.61ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 91.3MB in the beginning and 112.3MB in the end (delta: -21.1MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 930.57ms. Allocated memory was 192.9MB in the beginning and 195.0MB in the end (delta: 2.1MB). Free memory was 112.3MB in the beginning and 70.0MB in the end (delta: 42.4MB). Peak memory consumption was 160.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 873.40ms. Allocated memory was 195.0MB in the beginning and 390.1MB in the end (delta: 195.0MB). Free memory was 70.0MB in the beginning and 229.1MB in the end (delta: -159.2MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. * RCFGBuilder took 5735.72ms. Allocated memory was 390.1MB in the beginning and 962.6MB in the end (delta: 572.5MB). Free memory was 229.1MB in the beginning and 784.5MB in the end (delta: -555.4MB). Peak memory consumption was 212.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8122.65ms. Allocated memory was 962.6MB in the beginning and 1.4GB in the end (delta: 480.2MB). Free memory was 783.5MB in the beginning and 633.1MB in the end (delta: 150.4MB). Peak memory consumption was 631.7MB. Max. memory is 16.1GB. * Witness Printer took 4.09ms. Allocated memory is still 1.4GB. Free memory is still 633.1MB. There was no memory consumed. 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 231. 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_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 8); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (8 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 24); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (24 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_2 var_5 = 0; [L39] const SORT_1 var_30 = 0; [L40] const SORT_4 var_63 = 1; [L41] const SORT_4 var_64 = 0; [L42] const SORT_2 var_74 = 0; [L43] const SORT_2 var_76 = 1; [L44] const SORT_3 var_91 = 0; [L45] const SORT_4 var_227 = 3; [L46] const SORT_2 var_239 = 3; [L47] const SORT_4 var_241 = 6; [L48] const SORT_4 var_343 = 2; [L50] SORT_1 input_73; [L51] SORT_1 input_75; [L52] SORT_1 input_80; [L53] SORT_1 input_81; [L54] SORT_1 input_85; [L55] SORT_1 input_86; [L56] SORT_1 input_90; [L57] SORT_1 input_98; [L58] SORT_1 input_105; [L59] SORT_1 input_112; [L60] SORT_1 input_116; [L61] SORT_1 input_117; [L62] SORT_1 input_131; [L63] SORT_1 input_135; [L64] SORT_1 input_136; [L65] SORT_1 input_150; [L66] SORT_1 input_154; [L67] SORT_1 input_155; [L68] SORT_1 input_176; [L69] SORT_1 input_179; [L70] SORT_1 input_195; [L71] SORT_1 input_198; [L72] SORT_1 input_214; [L73] SORT_1 input_217; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L75] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L76] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L77] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L78] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L79] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L80] SORT_2 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L81] SORT_2 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L82] SORT_2 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L83] SORT_2 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L84] SORT_2 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L85] SORT_2 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L86] SORT_2 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L87] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L88] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L89] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L90] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L91] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L92] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L93] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L94] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L95] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L96] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L97] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L97] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L98] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L98] SORT_1 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L99] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L99] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L100] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L100] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L101] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L101] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L102] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L102] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L104] SORT_2 init_7_arg_1 = var_5; [L105] state_6 = init_7_arg_1 [L106] SORT_2 init_9_arg_1 = var_5; [L107] state_8 = init_9_arg_1 [L108] SORT_2 init_11_arg_1 = var_5; [L109] state_10 = init_11_arg_1 [L110] SORT_2 init_13_arg_1 = var_5; [L111] state_12 = init_13_arg_1 [L112] SORT_2 init_15_arg_1 = var_5; [L113] state_14 = init_15_arg_1 [L114] SORT_2 init_17_arg_1 = var_5; [L115] state_16 = init_17_arg_1 [L116] SORT_2 init_19_arg_1 = var_5; [L117] state_18 = init_19_arg_1 [L118] SORT_2 init_21_arg_1 = var_5; [L119] state_20 = init_21_arg_1 [L120] SORT_2 init_23_arg_1 = var_5; [L121] state_22 = init_23_arg_1 [L122] SORT_2 init_25_arg_1 = var_5; [L123] state_24 = init_25_arg_1 [L124] SORT_2 init_27_arg_1 = var_5; [L125] state_26 = init_27_arg_1 [L126] SORT_2 init_29_arg_1 = var_5; [L127] state_28 = init_29_arg_1 [L128] SORT_1 init_32_arg_1 = var_30; [L129] state_31 = init_32_arg_1 [L130] SORT_1 init_34_arg_1 = var_30; [L131] state_33 = init_34_arg_1 [L132] SORT_1 init_36_arg_1 = var_30; [L133] state_35 = init_36_arg_1 [L134] SORT_1 init_38_arg_1 = var_30; [L135] state_37 = init_38_arg_1 [L136] SORT_1 init_40_arg_1 = var_30; [L137] state_39 = init_40_arg_1 [L138] SORT_1 init_42_arg_1 = var_30; [L139] state_41 = init_42_arg_1 [L140] SORT_1 init_44_arg_1 = var_30; [L141] state_43 = init_44_arg_1 [L142] SORT_1 init_46_arg_1 = var_30; [L143] state_45 = init_46_arg_1 [L144] SORT_1 init_48_arg_1 = var_30; [L145] state_47 = init_48_arg_1 [L146] SORT_1 init_50_arg_1 = var_30; [L147] state_49 = init_50_arg_1 [L148] SORT_1 init_52_arg_1 = var_30; [L149] state_51 = init_52_arg_1 [L150] SORT_1 init_54_arg_1 = var_30; [L151] state_53 = init_54_arg_1 [L152] SORT_1 init_56_arg_1 = var_30; [L153] state_55 = init_56_arg_1 [L154] SORT_1 init_58_arg_1 = var_30; [L155] state_57 = init_58_arg_1 [L156] SORT_1 init_60_arg_1 = var_30; [L157] state_59 = init_60_arg_1 [L158] SORT_1 init_62_arg_1 = var_30; [L159] state_61 = init_62_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L162] input_73 = __VERIFIER_nondet_uchar() [L163] EXPR input_73 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L163] input_73 = input_73 & mask_SORT_1 [L164] input_75 = __VERIFIER_nondet_uchar() [L165] EXPR input_75 & mask_SORT_1 VAL [input_73=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L165] input_75 = input_75 & mask_SORT_1 [L166] input_80 = __VERIFIER_nondet_uchar() [L167] EXPR input_80 & mask_SORT_1 VAL [input_73=0, input_75=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L167] input_80 = input_80 & mask_SORT_1 [L168] input_81 = __VERIFIER_nondet_uchar() [L169] EXPR input_81 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L169] input_81 = input_81 & mask_SORT_1 [L170] input_85 = __VERIFIER_nondet_uchar() [L171] EXPR input_85 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L171] input_85 = input_85 & mask_SORT_1 [L172] input_86 = __VERIFIER_nondet_uchar() [L173] EXPR input_86 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L173] input_86 = input_86 & mask_SORT_1 [L174] input_90 = __VERIFIER_nondet_uchar() [L175] EXPR input_90 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L175] input_90 = input_90 & mask_SORT_1 [L176] input_98 = __VERIFIER_nondet_uchar() [L177] EXPR input_98 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L177] input_98 = input_98 & mask_SORT_1 [L178] input_105 = __VERIFIER_nondet_uchar() [L179] EXPR input_105 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L179] input_105 = input_105 & mask_SORT_1 [L180] input_112 = __VERIFIER_nondet_uchar() [L181] EXPR input_112 & mask_SORT_1 VAL [input_105=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L181] input_112 = input_112 & mask_SORT_1 [L182] input_116 = __VERIFIER_nondet_uchar() [L183] EXPR input_116 & mask_SORT_1 VAL [input_105=0, input_112=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L183] input_116 = input_116 & mask_SORT_1 [L184] input_117 = __VERIFIER_nondet_uchar() [L185] EXPR input_117 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L185] input_117 = input_117 & mask_SORT_1 [L186] input_131 = __VERIFIER_nondet_uchar() [L187] EXPR input_131 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L187] input_131 = input_131 & mask_SORT_1 [L188] input_135 = __VERIFIER_nondet_uchar() [L189] EXPR input_135 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L189] input_135 = input_135 & mask_SORT_1 [L190] input_136 = __VERIFIER_nondet_uchar() [L191] EXPR input_136 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L191] input_136 = input_136 & mask_SORT_1 [L192] input_150 = __VERIFIER_nondet_uchar() [L193] EXPR input_150 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L193] input_150 = input_150 & mask_SORT_1 [L194] input_154 = __VERIFIER_nondet_uchar() [L195] EXPR input_154 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L195] input_154 = input_154 & mask_SORT_1 [L196] input_155 = __VERIFIER_nondet_uchar() [L197] EXPR input_155 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L197] input_155 = input_155 & mask_SORT_1 [L198] input_176 = __VERIFIER_nondet_uchar() [L199] input_179 = __VERIFIER_nondet_uchar() [L200] input_195 = __VERIFIER_nondet_uchar() [L201] input_198 = __VERIFIER_nondet_uchar() [L202] input_214 = __VERIFIER_nondet_uchar() [L203] input_217 = __VERIFIER_nondet_uchar() [L206] SORT_1 var_65_arg_0 = state_39; [L207] SORT_4 var_65_arg_1 = var_63; [L208] SORT_4 var_65_arg_2 = var_64; [L209] SORT_4 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L210] SORT_1 var_66_arg_0 = state_49; [L211] SORT_4 var_66_arg_1 = var_63; [L212] SORT_4 var_66_arg_2 = var_64; [L213] SORT_4 var_66 = var_66_arg_0 ? var_66_arg_1 : var_66_arg_2; [L214] SORT_4 var_67_arg_0 = var_65; [L215] SORT_4 var_67_arg_1 = var_66; [L216] SORT_4 var_67 = var_67_arg_0 + var_67_arg_1; [L217] SORT_1 var_68_arg_0 = state_59; [L218] SORT_4 var_68_arg_1 = var_63; [L219] SORT_4 var_68_arg_2 = var_64; [L220] SORT_4 var_68 = var_68_arg_0 ? var_68_arg_1 : var_68_arg_2; [L221] SORT_4 var_69_arg_0 = var_67; [L222] SORT_4 var_69_arg_1 = var_68; [L223] SORT_4 var_69 = var_69_arg_0 + var_69_arg_1; VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_69=0, var_74=0, var_76=1, var_91=0] [L224] EXPR var_69 & mask_SORT_4 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L224] var_69 = var_69 & mask_SORT_4 [L225] SORT_4 var_70_arg_0 = var_69; [L226] SORT_4 var_70_arg_1 = var_63; [L227] SORT_1 var_70 = var_70_arg_0 <= var_70_arg_1; [L228] SORT_1 var_71_arg_0 = ~state_61; VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_70=1, var_71_arg_0=-1, var_74=0, var_76=1, var_91=0] [L229] EXPR var_71_arg_0 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_70=1, var_74=0, var_76=1, var_91=0] [L229] var_71_arg_0 = var_71_arg_0 & mask_SORT_1 [L230] SORT_1 var_71_arg_1 = ~var_70; VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_71_arg_0=1, var_71_arg_1=-2, var_74=0, var_76=1, var_91=0] [L231] EXPR var_71_arg_1 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_71_arg_0=1, var_74=0, var_76=1, var_91=0] [L231] var_71_arg_1 = var_71_arg_1 & mask_SORT_1 [L232] EXPR var_71_arg_0 & var_71_arg_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L232] SORT_1 var_71 = var_71_arg_0 & var_71_arg_1; [L233] EXPR var_71 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L233] var_71 = var_71 & mask_SORT_1 [L234] SORT_1 bad_72_arg_0 = var_71; [L235] CALL __VERIFIER_assert(!(bad_72_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1799 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5174 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5174 mSDsluCounter, 49329 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34411 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4363 IncrementalHoareTripleChecker+Invalid, 4366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 14918 mSDtfsCounter, 4363 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1887occurred in iteration=5, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 1604 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 763 NumberOfCodeBlocks, 763 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 645 ConstructedInterpolants, 0 QuantifiedInterpolants, 1522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-10-11 05:24:43,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 8f99c9b906e0ce9dfb5a1fdac7e796a2c68c541e986f60427db8a196999b6c01 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:24:46,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:24:46,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 05:24:46,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:24:46,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:24:46,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:24:46,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:24:46,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:24:46,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:24:46,231 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:24:46,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:24:46,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:24:46,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:24:46,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:24:46,233 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:24:46,234 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:24:46,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:24:46,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:24:46,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:24:46,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:24:46,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:24:46,240 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 05:24:46,240 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 05:24:46,240 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:24:46,241 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 05:24:46,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:24:46,241 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:24:46,242 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:24:46,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:24:46,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:24:46,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:24:46,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:24:46,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:24:46,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:24:46,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:24:46,246 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 05:24:46,246 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 05:24:46,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:24:46,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:24:46,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:24:46,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:24:46,255 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 05:24:46,255 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-clean/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-clean/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 -> 8f99c9b906e0ce9dfb5a1fdac7e796a2c68c541e986f60427db8a196999b6c01 [2024-10-11 05:24:46,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:24:46,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:24:46,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:24:46,649 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:24:46,650 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:24:46,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c [2024-10-11 05:24:48,323 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:24:48,740 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:24:48,741 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c [2024-10-11 05:24:48,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/925ec56f6/29bc0f2fa3104f7183a693f043f6eeb2/FLAG2cd341e6e [2024-10-11 05:24:48,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/925ec56f6/29bc0f2fa3104f7183a693f043f6eeb2 [2024-10-11 05:24:48,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:24:48,789 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:24:48,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:24:48,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:24:48,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:24:48,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:24:48" (1/1) ... [2024-10-11 05:24:48,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e614b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:48, skipping insertion in model container [2024-10-11 05:24:48,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:24:48" (1/1) ... [2024-10-11 05:24:48,874 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:24:49,104 WARN L248 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.bakery.4.prop1-func-interl.c[1173,1186] [2024-10-11 05:24:49,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:24:49,451 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:24:49,462 WARN L248 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.bakery.4.prop1-func-interl.c[1173,1186] [2024-10-11 05:24:49,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:24:49,610 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:24:49,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:49 WrapperNode [2024-10-11 05:24:49,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:24:49,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:24:49,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:24:49,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:24:49,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:49" (1/1) ... [2024-10-11 05:24:49,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:49" (1/1) ... [2024-10-11 05:24:49,728 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1650 [2024-10-11 05:24:49,729 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:24:49,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:24:49,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:24:49,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:24:49,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:49" (1/1) ... [2024-10-11 05:24:49,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:49" (1/1) ... [2024-10-11 05:24:49,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:49" (1/1) ... [2024-10-11 05:24:49,822 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-10-11 05:24:49,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:49" (1/1) ... [2024-10-11 05:24:49,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:49" (1/1) ... [2024-10-11 05:24:49,862 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:49" (1/1) ... [2024-10-11 05:24:49,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:49" (1/1) ... [2024-10-11 05:24:49,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:49" (1/1) ... [2024-10-11 05:24:49,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:49" (1/1) ... [2024-10-11 05:24:49,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:24:49,913 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:24:49,913 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:24:49,913 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:24:49,914 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:49" (1/1) ... [2024-10-11 05:24:49,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:24:49,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:24:49,976 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:24:49,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:24:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:24:50,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 05:24:50,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:24:50,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:24:50,429 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:24:50,432 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:24:52,353 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-10-11 05:24:52,354 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:24:52,421 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:24:52,422 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 05:24:52,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:24:52 BoogieIcfgContainer [2024-10-11 05:24:52,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:24:52,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:24:52,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:24:52,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:24:52,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:24:48" (1/3) ... [2024-10-11 05:24:52,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e61e0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:24:52, skipping insertion in model container [2024-10-11 05:24:52,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:24:49" (2/3) ... [2024-10-11 05:24:52,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e61e0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:24:52, skipping insertion in model container [2024-10-11 05:24:52,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:24:52" (3/3) ... [2024-10-11 05:24:52,433 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bakery.4.prop1-func-interl.c [2024-10-11 05:24:52,451 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:24:52,451 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 05:24:52,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:24:52,517 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;@6c74fe0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:24:52,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 05:24:52,522 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-10-11 05:24:52,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 05:24:52,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:24:52,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 05:24:52,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:24:52,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:24:52,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 05:24:52,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 05:24:52,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959811542] [2024-10-11 05:24:52,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:24:52,551 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-10-11 05:24:52,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 05:24:52,554 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 05:24:52,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 05:24:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:24:52,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 05:24:52,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:24:53,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:24:53,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:24:53,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 05:24:53,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959811542] [2024-10-11 05:24:53,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959811542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:24:53,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:24:53,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 05:24:53,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431409406] [2024-10-11 05:24:53,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:24:53,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:24:53,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 05:24:53,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:24:53,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:24:53,373 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-11 05:24:53,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:24:53,609 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-11 05:24:53,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:24:53,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-10-11 05:24:53,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:24:53,619 INFO L225 Difference]: With dead ends: 15 [2024-10-11 05:24:53,619 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 05:24:53,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:24:53,626 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:24:53,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:24:53,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 05:24:53,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-11 05:24:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-10-11 05:24:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 05:24:53,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 05:24:53,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:24:53,666 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 05:24:53,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-11 05:24:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 05:24:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 05:24:53,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:24:53,668 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 05:24:53,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 05:24:53,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 05:24:53,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:24:53,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:24:53,874 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 05:24:53,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 05:24:53,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85644655] [2024-10-11 05:24:53,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:24:53,876 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-10-11 05:24:53,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 05:24:53,879 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 05:24:53,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 05:24:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:24:54,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-11 05:24:54,661 INFO L278 TraceCheckSpWp]: Computing forward predicates...