./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.Heap.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.Heap.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 60dab3e2339bce2b045dd3b78258045145cb10b71bd20a1415e48f1177a4dd2d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:14:18,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:14:18,548 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:14:18,551 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:14:18,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:14:18,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:14:18,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:14:18,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:14:18,585 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:14:18,586 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:14:18,586 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:14:18,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:14:18,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:14:18,587 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:14:18,589 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:14:18,589 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:14:18,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:14:18,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:14:18,590 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:14:18,590 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:14:18,590 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:14:18,592 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:14:18,592 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:14:18,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:14:18,593 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:14:18,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:14:18,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:14:18,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:14:18,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:14:18,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:14:18,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:14:18,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:14:18,594 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:14:18,594 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:14:18,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:14:18,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:14:18,595 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:14:18,595 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:14:18,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:14:18,595 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 -> 60dab3e2339bce2b045dd3b78258045145cb10b71bd20a1415e48f1177a4dd2d [2024-10-11 05:14:18,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:14:18,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:14:18,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:14:18,837 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:14:18,838 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:14:18,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Heap.c [2024-10-11 05:14:20,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:14:20,480 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:14:20,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Heap.c [2024-10-11 05:14:20,500 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fc00234d1/d746e27a5f4847c8b59d548febdcef67/FLAGb5c25cffc [2024-10-11 05:14:20,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fc00234d1/d746e27a5f4847c8b59d548febdcef67 [2024-10-11 05:14:20,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:14:20,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:14:20,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:14:20,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:14:20,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:14:20,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:14:20" (1/1) ... [2024-10-11 05:14:20,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49c1aa53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:20, skipping insertion in model container [2024-10-11 05:14:20,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:14:20" (1/1) ... [2024-10-11 05:14:20,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:14:20,804 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.Heap.c[1244,1257] [2024-10-11 05:14:21,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:14:21,125 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:14:21,136 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.Heap.c[1244,1257] [2024-10-11 05:14:21,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:14:21,346 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:14:21,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:21 WrapperNode [2024-10-11 05:14:21,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:14:21,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:14:21,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:14:21,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:14:21,357 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:14:21" (1/1) ... [2024-10-11 05:14:21,459 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:14:21" (1/1) ... [2024-10-11 05:14:21,866 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4790 [2024-10-11 05:14:21,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:14:21,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:14:21,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:14:21,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:14:21,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:21" (1/1) ... [2024-10-11 05:14:21,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:21" (1/1) ... [2024-10-11 05:14:21,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:21" (1/1) ... [2024-10-11 05:14:22,052 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-10-11 05:14:22,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:21" (1/1) ... [2024-10-11 05:14:22,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:21" (1/1) ... [2024-10-11 05:14:22,167 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:21" (1/1) ... [2024-10-11 05:14:22,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:21" (1/1) ... [2024-10-11 05:14:22,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:21" (1/1) ... [2024-10-11 05:14:22,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:21" (1/1) ... [2024-10-11 05:14:22,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:14:22,299 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:14:22,300 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:14:22,300 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:14:22,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:21" (1/1) ... [2024-10-11 05:14:22,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:14:22,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:14:22,430 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:14:22,431 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:14:22,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:14:22,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:14:22,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 05:14:22,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:14:22,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:14:22,871 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:14:22,874 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:14:25,646 INFO L? ?]: Removed 3293 outVars from TransFormulas that were not future-live. [2024-10-11 05:14:25,646 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:14:25,724 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:14:25,724 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 05:14:25,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:14:25 BoogieIcfgContainer [2024-10-11 05:14:25,724 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:14:25,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:14:25,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:14:25,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:14:25,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:14:20" (1/3) ... [2024-10-11 05:14:25,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492f1277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:14:25, skipping insertion in model container [2024-10-11 05:14:25,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:21" (2/3) ... [2024-10-11 05:14:25,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492f1277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:14:25, skipping insertion in model container [2024-10-11 05:14:25,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:14:25" (3/3) ... [2024-10-11 05:14:25,731 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.Heap.c [2024-10-11 05:14:25,743 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:14:25,743 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 05:14:25,823 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:14:25,828 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;@bb0c4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:14:25,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 05:14:25,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 847 states, 845 states have (on average 1.5005917159763313) internal successors, (1268), 846 states have internal predecessors, (1268), 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:14:25,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 05:14:25,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:14:25,849 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] [2024-10-11 05:14:25,849 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:14:25,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:14:25,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1512731272, now seen corresponding path program 1 times [2024-10-11 05:14:25,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:14:25,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187272002] [2024-10-11 05:14:25,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:14:25,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:14:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:14:26,399 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:14:26,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:14:26,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187272002] [2024-10-11 05:14:26,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187272002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:14:26,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:14:26,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:14:26,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658162011] [2024-10-11 05:14:26,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:14:26,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:14:26,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:14:26,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:14:26,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:14:26,432 INFO L87 Difference]: Start difference. First operand has 847 states, 845 states have (on average 1.5005917159763313) internal successors, (1268), 846 states have internal predecessors, (1268), 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 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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:14:26,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:14:26,573 INFO L93 Difference]: Finished difference Result 1652 states and 2475 transitions. [2024-10-11 05:14:26,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:14:26,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2024-10-11 05:14:26,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:14:26,588 INFO L225 Difference]: With dead ends: 1652 [2024-10-11 05:14:26,589 INFO L226 Difference]: Without dead ends: 850 [2024-10-11 05:14:26,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:14:26,595 INFO L432 NwaCegarLoop]: 1260 mSDtfsCounter, 1237 mSDsluCounter, 2514 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1237 SdHoareTripleChecker+Valid, 3774 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:14:26,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1237 Valid, 3774 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:14:26,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2024-10-11 05:14:26,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 849. [2024-10-11 05:14:26,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 848 states have (on average 1.4964622641509433) internal successors, (1269), 848 states have internal predecessors, (1269), 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:14:26,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1269 transitions. [2024-10-11 05:14:26,659 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1269 transitions. Word has length 42 [2024-10-11 05:14:26,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:14:26,663 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1269 transitions. [2024-10-11 05:14:26,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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:14:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1269 transitions. [2024-10-11 05:14:26,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 05:14:26,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:14:26,665 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] [2024-10-11 05:14:26,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:14:26,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:14:26,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:14:26,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2045961602, now seen corresponding path program 1 times [2024-10-11 05:14:26,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:14:26,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673110543] [2024-10-11 05:14:26,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:14:26,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:14:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:14:27,202 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:14:27,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:14:27,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673110543] [2024-10-11 05:14:27,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673110543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:14:27,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:14:27,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:14:27,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669465665] [2024-10-11 05:14:27,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:14:27,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:14:27,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:14:27,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:14:27,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:14:27,207 INFO L87 Difference]: Start difference. First operand 849 states and 1269 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 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:14:27,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:14:27,393 INFO L93 Difference]: Finished difference Result 1653 states and 2471 transitions. [2024-10-11 05:14:27,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:14:27,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 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 43 [2024-10-11 05:14:27,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:14:27,397 INFO L225 Difference]: With dead ends: 1653 [2024-10-11 05:14:27,397 INFO L226 Difference]: Without dead ends: 849 [2024-10-11 05:14:27,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:14:27,399 INFO L432 NwaCegarLoop]: 1252 mSDtfsCounter, 1230 mSDsluCounter, 4987 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 6239 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:14:27,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 6239 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:14:27,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-10-11 05:14:27,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 846. [2024-10-11 05:14:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 845 states have (on average 1.4958579881656804) internal successors, (1264), 845 states have internal predecessors, (1264), 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:14:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1264 transitions. [2024-10-11 05:14:27,412 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1264 transitions. Word has length 43 [2024-10-11 05:14:27,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:14:27,412 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1264 transitions. [2024-10-11 05:14:27,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 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:14:27,413 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1264 transitions. [2024-10-11 05:14:27,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 05:14:27,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:14:27,414 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] [2024-10-11 05:14:27,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:14:27,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:14:27,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:14:27,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1368232139, now seen corresponding path program 1 times [2024-10-11 05:14:27,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:14:27,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245274689] [2024-10-11 05:14:27,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:14:27,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:14:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:14:27,625 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:14:27,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:14:27,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245274689] [2024-10-11 05:14:27,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245274689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:14:27,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:14:27,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:14:27,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50186662] [2024-10-11 05:14:27,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:14:27,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:14:27,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:14:27,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:14:27,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:14:27,629 INFO L87 Difference]: Start difference. First operand 846 states and 1264 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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:14:27,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:14:27,666 INFO L93 Difference]: Finished difference Result 850 states and 1268 transitions. [2024-10-11 05:14:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:14:27,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2024-10-11 05:14:27,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:14:27,669 INFO L225 Difference]: With dead ends: 850 [2024-10-11 05:14:27,669 INFO L226 Difference]: Without dead ends: 848 [2024-10-11 05:14:27,669 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:14:27,673 INFO L432 NwaCegarLoop]: 1261 mSDtfsCounter, 0 mSDsluCounter, 2517 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3778 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:14:27,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3778 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:14:27,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2024-10-11 05:14:27,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2024-10-11 05:14:27,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 847 states have (on average 1.4946871310507674) internal successors, (1266), 847 states have internal predecessors, (1266), 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:14:27,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1266 transitions. [2024-10-11 05:14:27,689 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1266 transitions. Word has length 44 [2024-10-11 05:14:27,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:14:27,690 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1266 transitions. [2024-10-11 05:14:27,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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:14:27,690 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1266 transitions. [2024-10-11 05:14:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 05:14:27,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:14:27,692 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] [2024-10-11 05:14:27,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:14:27,693 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:14:27,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:14:27,694 INFO L85 PathProgramCache]: Analyzing trace with hash 536172051, now seen corresponding path program 1 times [2024-10-11 05:14:27,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:14:27,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996886874] [2024-10-11 05:14:27,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:14:27,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:14:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:14:28,711 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:14:28,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:14:28,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996886874] [2024-10-11 05:14:28,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996886874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:14:28,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:14:28,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:14:28,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581210186] [2024-10-11 05:14:28,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:14:28,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:14:28,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:14:28,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:14:28,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:14:28,713 INFO L87 Difference]: Start difference. First operand 848 states and 1266 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 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:14:28,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:14:28,921 INFO L93 Difference]: Finished difference Result 1676 states and 2502 transitions. [2024-10-11 05:14:28,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:14:28,922 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 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 45 [2024-10-11 05:14:28,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:14:28,924 INFO L225 Difference]: With dead ends: 1676 [2024-10-11 05:14:28,925 INFO L226 Difference]: Without dead ends: 873 [2024-10-11 05:14:28,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-11 05:14:28,926 INFO L432 NwaCegarLoop]: 1247 mSDtfsCounter, 1307 mSDsluCounter, 7485 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 8732 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:14:28,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 8732 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:14:28,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-10-11 05:14:28,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 859. [2024-10-11 05:14:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 858 states have (on average 1.494172494172494) internal successors, (1282), 858 states have internal predecessors, (1282), 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:14:28,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1282 transitions. [2024-10-11 05:14:28,940 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1282 transitions. Word has length 45 [2024-10-11 05:14:28,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:14:28,940 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1282 transitions. [2024-10-11 05:14:28,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 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:14:28,941 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1282 transitions. [2024-10-11 05:14:28,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 05:14:28,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:14:28,942 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] [2024-10-11 05:14:28,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:14:28,942 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:14:28,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:14:28,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2139528371, now seen corresponding path program 1 times [2024-10-11 05:14:28,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:14:28,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383490377] [2024-10-11 05:14:28,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:14:28,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:14:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 05:14:29,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 05:14:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 05:14:29,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 05:14:29,110 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 05:14:29,111 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 05:14:29,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:14:29,115 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 05:14:29,160 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 05:14:29,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:14:29 BoogieIcfgContainer [2024-10-11 05:14:29,162 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 05:14:29,163 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 05:14:29,163 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 05:14:29,163 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 05:14:29,164 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:14:25" (3/4) ... [2024-10-11 05:14:29,165 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 05:14:29,166 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 05:14:29,166 INFO L158 Benchmark]: Toolchain (without parser) took 8648.52ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 68.2MB in the beginning and 650.1MB in the end (delta: -581.8MB). Peak memory consumption was 606.6MB. Max. memory is 16.1GB. [2024-10-11 05:14:29,167 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 106.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 05:14:29,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 827.88ms. Allocated memory was 142.6MB in the beginning and 199.2MB in the end (delta: 56.6MB). Free memory was 68.0MB in the beginning and 132.7MB in the end (delta: -64.6MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2024-10-11 05:14:29,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 519.17ms. Allocated memory was 199.2MB in the beginning and 398.5MB in the end (delta: 199.2MB). Free memory was 132.7MB in the beginning and 272.3MB in the end (delta: -139.7MB). Peak memory consumption was 104.8MB. Max. memory is 16.1GB. [2024-10-11 05:14:29,167 INFO L158 Benchmark]: Boogie Preprocessor took 431.33ms. Allocated memory is still 398.5MB. Free memory was 272.3MB in the beginning and 201.0MB in the end (delta: 71.3MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2024-10-11 05:14:29,168 INFO L158 Benchmark]: RCFGBuilder took 3425.03ms. Allocated memory was 398.5MB in the beginning and 796.9MB in the end (delta: 398.5MB). Free memory was 201.0MB in the beginning and 558.1MB in the end (delta: -357.0MB). Peak memory consumption was 134.7MB. Max. memory is 16.1GB. [2024-10-11 05:14:29,168 INFO L158 Benchmark]: TraceAbstraction took 3436.72ms. Allocated memory was 796.9MB in the beginning and 1.3GB in the end (delta: 532.7MB). Free memory was 557.0MB in the beginning and 650.1MB in the end (delta: -93.0MB). Peak memory consumption was 440.7MB. Max. memory is 16.1GB. [2024-10-11 05:14:29,168 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 1.3GB. Free memory is still 650.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 05:14:29,170 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.14ms. Allocated memory is still 142.6MB. Free memory is still 106.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 827.88ms. Allocated memory was 142.6MB in the beginning and 199.2MB in the end (delta: 56.6MB). Free memory was 68.0MB in the beginning and 132.7MB in the end (delta: -64.6MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 519.17ms. Allocated memory was 199.2MB in the beginning and 398.5MB in the end (delta: 199.2MB). Free memory was 132.7MB in the beginning and 272.3MB in the end (delta: -139.7MB). Peak memory consumption was 104.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 431.33ms. Allocated memory is still 398.5MB. Free memory was 272.3MB in the beginning and 201.0MB in the end (delta: 71.3MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * RCFGBuilder took 3425.03ms. Allocated memory was 398.5MB in the beginning and 796.9MB in the end (delta: 398.5MB). Free memory was 201.0MB in the beginning and 558.1MB in the end (delta: -357.0MB). Peak memory consumption was 134.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3436.72ms. Allocated memory was 796.9MB in the beginning and 1.3GB in the end (delta: 532.7MB). Free memory was 557.0MB in the beginning and 650.1MB in the end (delta: -93.0MB). Peak memory consumption was 440.7MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 1.3GB. Free memory is still 650.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 358. 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_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 2); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (2 - 1); [L32] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 32); [L33] const SORT_9 msb_SORT_9 = (SORT_9)1 << (32 - 1); [L35] const SORT_13 mask_SORT_13 = (SORT_13)-1 >> (sizeof(SORT_13) * 8 - 3); [L36] const SORT_13 msb_SORT_13 = (SORT_13)1 << (3 - 1); [L38] const SORT_55 mask_SORT_55 = (SORT_55)-1 >> (sizeof(SORT_55) * 8 - 29); [L39] const SORT_55 msb_SORT_55 = (SORT_55)1 << (29 - 1); [L41] const SORT_1 var_6 = 0; [L42] const SORT_9 var_11 = 0; [L43] const SORT_13 var_14 = 0; [L44] const SORT_1 var_27 = 1; [L45] const SORT_9 var_35 = 4; [L46] const SORT_3 var_38 = 0; [L47] const SORT_55 var_56 = 0; [L48] const SORT_9 var_60 = 1; [L49] const SORT_3 var_82 = 2; [L50] const SORT_3 var_87 = 3; [L51] const SORT_13 var_93 = 1; [L52] const SORT_13 var_96 = 3; [L53] const SORT_13 var_99 = 2; [L54] const SORT_13 var_103 = 5; [L55] const SORT_3 var_109 = 1; [L56] const SORT_13 var_117 = 7; [L57] const SORT_13 var_126 = 6; [L58] const SORT_13 var_130 = 4; [L60] SORT_1 input_2; [L61] SORT_3 input_4; [L62] SORT_3 input_5; [L63] SORT_1 input_81; [L64] SORT_1 input_106; [L65] SORT_3 input_107; [L66] SORT_13 input_137; [L67] SORT_13 input_138; [L68] SORT_13 input_139; [L69] SORT_13 input_150; [L70] SORT_13 input_151; [L71] SORT_3 input_191; [L72] SORT_3 input_192; [L73] SORT_3 input_193; [L74] SORT_3 input_199; [L75] SORT_3 input_200; [L76] SORT_3 input_201; [L77] SORT_3 input_202; [L78] SORT_3 input_203; [L79] SORT_3 input_251; [L80] SORT_3 input_263; [L81] SORT_3 input_281; [L82] SORT_3 input_282; [L83] SORT_3 input_290; [L84] SORT_3 input_316; [L85] SORT_3 input_341; [L86] SORT_3 input_342; [L87] SORT_3 input_343; [L88] SORT_3 input_360; [L89] SORT_3 input_361; [L90] SORT_3 input_369; [L91] SORT_3 input_377; [L92] SORT_3 input_378; [L93] SORT_3 input_397; [L94] SORT_3 input_398; [L95] SORT_3 input_399; [L96] SORT_3 input_407; [L97] SORT_3 input_414; [L98] SORT_3 input_425; [L99] SORT_3 input_426; [L100] SORT_3 input_435; [L101] SORT_3 input_440; [L102] SORT_3 input_444; [L103] SORT_3 input_445; [L104] SORT_3 input_474; [L105] SORT_3 input_475; [L106] SORT_3 input_483; [L107] SORT_3 input_487; [L108] SORT_3 input_488; [L109] SORT_3 input_507; [L110] SORT_3 input_508; [L111] SORT_3 input_509; [L112] SORT_3 input_517; [L113] SORT_3 input_519; [L114] SORT_3 input_523; [L115] SORT_3 input_524; [L116] SORT_3 input_533; [L117] SORT_3 input_538; [L118] SORT_3 input_542; [L119] SORT_3 input_543; [L120] SORT_3 input_572; [L121] SORT_3 input_573; [L122] SORT_3 input_581; [L123] SORT_3 input_585; [L124] SORT_3 input_586; [L125] SORT_3 input_605; [L126] SORT_3 input_606; [L127] SORT_3 input_607; [L128] SORT_3 input_615; [L129] SORT_3 input_617; [L130] SORT_3 input_621; [L131] SORT_3 input_622; [L132] SORT_3 input_631; [L133] SORT_3 input_636; [L134] SORT_3 input_640; [L135] SORT_3 input_641; [L136] SORT_3 input_670; [L137] SORT_3 input_671; [L138] SORT_3 input_679; [L139] SORT_3 input_683; [L140] SORT_3 input_684; [L141] SORT_3 input_703; [L142] SORT_3 input_704; [L143] SORT_3 input_705; [L144] SORT_3 input_713; [L145] SORT_3 input_715; [L146] SORT_3 input_719; [L147] SORT_3 input_720; [L148] SORT_3 input_729; [L149] SORT_3 input_734; [L150] SORT_3 input_738; [L151] SORT_3 input_739; [L152] SORT_13 input_766; [L153] SORT_13 input_767; [L154] SORT_13 input_768; [L155] SORT_13 input_774; [L156] SORT_13 input_775; [L157] SORT_13 input_792; [L158] SORT_13 input_803; [L159] SORT_13 input_804; [L160] SORT_13 input_806; [L161] SORT_13 input_815; [L162] SORT_13 input_833; [L163] SORT_13 input_834; [L164] SORT_13 input_835; [L165] SORT_13 input_841; [L166] SORT_13 input_842; [L167] SORT_13 input_859; [L168] SORT_13 input_868; [L169] SORT_13 input_869; [L170] SORT_13 input_871; [L171] SORT_13 input_880; [L172] SORT_13 input_884; [L174] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L174] SORT_1 state_7 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L175] EXPR __VERIFIER_nondet_uchar() & mask_SORT_13 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L175] SORT_13 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_13; [L176] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L176] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L177] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L177] SORT_3 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L178] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L178] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L179] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L179] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L180] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L180] SORT_3 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L181] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L181] SORT_3 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L182] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L182] SORT_3 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L183] EXPR __VERIFIER_nondet_uchar() & mask_SORT_13 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L183] SORT_13 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_13; [L184] EXPR __VERIFIER_nondet_uchar() & mask_SORT_13 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L184] SORT_13 state_75 = __VERIFIER_nondet_uchar() & mask_SORT_13; [L186] SORT_1 init_8_arg_1 = var_6; [L187] state_7 = init_8_arg_1 [L188] SORT_13 init_16_arg_1 = var_14; [L189] state_15 = init_16_arg_1 [L190] SORT_3 init_40_arg_1 = var_38; [L191] state_39 = init_40_arg_1 [L192] SORT_3 init_42_arg_1 = var_38; [L193] state_41 = init_42_arg_1 [L194] SORT_3 init_44_arg_1 = var_38; [L195] state_43 = init_44_arg_1 [L196] SORT_3 init_46_arg_1 = var_38; [L197] state_45 = init_46_arg_1 [L198] SORT_3 init_48_arg_1 = var_38; [L199] state_47 = init_48_arg_1 [L200] SORT_3 init_50_arg_1 = var_38; [L201] state_49 = init_50_arg_1 [L202] SORT_3 init_52_arg_1 = var_38; [L203] state_51 = init_52_arg_1 [L204] SORT_13 init_54_arg_1 = var_14; [L205] state_53 = init_54_arg_1 [L206] SORT_13 init_76_arg_1 = var_14; [L207] state_75 = init_76_arg_1 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=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_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L210] input_2 = __VERIFIER_nondet_uchar() [L211] input_4 = __VERIFIER_nondet_uchar() [L212] EXPR input_4 & mask_SORT_3 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=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_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L212] input_4 = input_4 & mask_SORT_3 [L213] input_5 = __VERIFIER_nondet_uchar() [L214] input_81 = __VERIFIER_nondet_uchar() [L215] input_106 = __VERIFIER_nondet_uchar() [L216] input_107 = __VERIFIER_nondet_uchar() [L217] input_137 = __VERIFIER_nondet_uchar() [L218] input_138 = __VERIFIER_nondet_uchar() [L219] input_139 = __VERIFIER_nondet_uchar() [L220] input_150 = __VERIFIER_nondet_uchar() [L221] input_151 = __VERIFIER_nondet_uchar() [L222] input_191 = __VERIFIER_nondet_uchar() [L223] input_192 = __VERIFIER_nondet_uchar() [L224] input_193 = __VERIFIER_nondet_uchar() [L225] input_199 = __VERIFIER_nondet_uchar() [L226] input_200 = __VERIFIER_nondet_uchar() [L227] input_201 = __VERIFIER_nondet_uchar() [L228] input_202 = __VERIFIER_nondet_uchar() [L229] input_203 = __VERIFIER_nondet_uchar() [L230] input_251 = __VERIFIER_nondet_uchar() [L231] input_263 = __VERIFIER_nondet_uchar() [L232] input_281 = __VERIFIER_nondet_uchar() [L233] input_282 = __VERIFIER_nondet_uchar() [L234] input_290 = __VERIFIER_nondet_uchar() [L235] input_316 = __VERIFIER_nondet_uchar() [L236] input_341 = __VERIFIER_nondet_uchar() [L237] input_342 = __VERIFIER_nondet_uchar() [L238] input_343 = __VERIFIER_nondet_uchar() [L239] input_360 = __VERIFIER_nondet_uchar() [L240] input_361 = __VERIFIER_nondet_uchar() [L241] input_369 = __VERIFIER_nondet_uchar() [L242] input_377 = __VERIFIER_nondet_uchar() [L243] input_378 = __VERIFIER_nondet_uchar() [L244] input_397 = __VERIFIER_nondet_uchar() [L245] input_398 = __VERIFIER_nondet_uchar() [L246] input_399 = __VERIFIER_nondet_uchar() [L247] input_407 = __VERIFIER_nondet_uchar() [L248] input_414 = __VERIFIER_nondet_uchar() [L249] input_425 = __VERIFIER_nondet_uchar() [L250] input_426 = __VERIFIER_nondet_uchar() [L251] input_435 = __VERIFIER_nondet_uchar() [L252] input_440 = __VERIFIER_nondet_uchar() [L253] input_444 = __VERIFIER_nondet_uchar() [L254] input_445 = __VERIFIER_nondet_uchar() [L255] input_474 = __VERIFIER_nondet_uchar() [L256] input_475 = __VERIFIER_nondet_uchar() [L257] input_483 = __VERIFIER_nondet_uchar() [L258] input_487 = __VERIFIER_nondet_uchar() [L259] input_488 = __VERIFIER_nondet_uchar() [L260] input_507 = __VERIFIER_nondet_uchar() [L261] input_508 = __VERIFIER_nondet_uchar() [L262] input_509 = __VERIFIER_nondet_uchar() [L263] input_517 = __VERIFIER_nondet_uchar() [L264] input_519 = __VERIFIER_nondet_uchar() [L265] input_523 = __VERIFIER_nondet_uchar() [L266] input_524 = __VERIFIER_nondet_uchar() [L267] input_533 = __VERIFIER_nondet_uchar() [L268] input_538 = __VERIFIER_nondet_uchar() [L269] input_542 = __VERIFIER_nondet_uchar() [L270] input_543 = __VERIFIER_nondet_uchar() [L271] input_572 = __VERIFIER_nondet_uchar() [L272] input_573 = __VERIFIER_nondet_uchar() [L273] input_581 = __VERIFIER_nondet_uchar() [L274] input_585 = __VERIFIER_nondet_uchar() [L275] input_586 = __VERIFIER_nondet_uchar() [L276] input_605 = __VERIFIER_nondet_uchar() [L277] input_606 = __VERIFIER_nondet_uchar() [L278] input_607 = __VERIFIER_nondet_uchar() [L279] input_615 = __VERIFIER_nondet_uchar() [L280] input_617 = __VERIFIER_nondet_uchar() [L281] input_621 = __VERIFIER_nondet_uchar() [L282] input_622 = __VERIFIER_nondet_uchar() [L283] input_631 = __VERIFIER_nondet_uchar() [L284] input_636 = __VERIFIER_nondet_uchar() [L285] input_640 = __VERIFIER_nondet_uchar() [L286] input_641 = __VERIFIER_nondet_uchar() [L287] input_670 = __VERIFIER_nondet_uchar() [L288] input_671 = __VERIFIER_nondet_uchar() [L289] input_679 = __VERIFIER_nondet_uchar() [L290] input_683 = __VERIFIER_nondet_uchar() [L291] input_684 = __VERIFIER_nondet_uchar() [L292] input_703 = __VERIFIER_nondet_uchar() [L293] input_704 = __VERIFIER_nondet_uchar() [L294] input_705 = __VERIFIER_nondet_uchar() [L295] input_713 = __VERIFIER_nondet_uchar() [L296] input_715 = __VERIFIER_nondet_uchar() [L297] input_719 = __VERIFIER_nondet_uchar() [L298] input_720 = __VERIFIER_nondet_uchar() [L299] input_729 = __VERIFIER_nondet_uchar() [L300] input_734 = __VERIFIER_nondet_uchar() [L301] input_738 = __VERIFIER_nondet_uchar() [L302] input_739 = __VERIFIER_nondet_uchar() [L303] input_766 = __VERIFIER_nondet_uchar() [L304] input_767 = __VERIFIER_nondet_uchar() [L305] input_768 = __VERIFIER_nondet_uchar() [L306] input_774 = __VERIFIER_nondet_uchar() [L307] input_775 = __VERIFIER_nondet_uchar() [L308] input_792 = __VERIFIER_nondet_uchar() [L309] input_803 = __VERIFIER_nondet_uchar() [L310] input_804 = __VERIFIER_nondet_uchar() [L311] input_806 = __VERIFIER_nondet_uchar() [L312] input_815 = __VERIFIER_nondet_uchar() [L313] input_833 = __VERIFIER_nondet_uchar() [L314] input_834 = __VERIFIER_nondet_uchar() [L315] input_835 = __VERIFIER_nondet_uchar() [L316] input_841 = __VERIFIER_nondet_uchar() [L317] input_842 = __VERIFIER_nondet_uchar() [L318] input_859 = __VERIFIER_nondet_uchar() [L319] input_868 = __VERIFIER_nondet_uchar() [L320] input_869 = __VERIFIER_nondet_uchar() [L321] input_871 = __VERIFIER_nondet_uchar() [L322] input_880 = __VERIFIER_nondet_uchar() [L323] input_884 = __VERIFIER_nondet_uchar() [L326] SORT_1 var_10_arg_0 = state_7; VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=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_75=0, state_7=0, var_103=5, var_109=1, var_10_arg_0=0, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L327] EXPR var_10_arg_0 & mask_SORT_1 VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=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_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L327] var_10_arg_0 = var_10_arg_0 & mask_SORT_1 [L328] SORT_9 var_10 = var_10_arg_0; [L329] SORT_9 var_12_arg_0 = var_10; [L330] SORT_9 var_12_arg_1 = var_11; [L331] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L332] SORT_13 var_17_arg_0 = state_15; [L333] SORT_1 var_17 = var_17_arg_0 >> 2; [L334] SORT_1 var_18_arg_0 = var_17; VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=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_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_12=1, var_130=4, var_14=0, var_18_arg_0=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L335] EXPR var_18_arg_0 & mask_SORT_1 VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=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_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_12=1, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L335] var_18_arg_0 = var_18_arg_0 & mask_SORT_1 [L336] SORT_9 var_18 = var_18_arg_0; [L337] SORT_9 var_19_arg_0 = var_18; [L338] SORT_9 var_19_arg_1 = var_11; [L339] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L340] SORT_13 var_20_arg_0 = state_15; [L341] SORT_3 var_20 = var_20_arg_0 >> 0; [L342] SORT_3 var_21_arg_0 = var_20; VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=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_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_12=1, var_130=4, var_14=0, var_19=1, var_21_arg_0=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L343] EXPR var_21_arg_0 & mask_SORT_3 VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=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_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_12=1, var_130=4, var_14=0, var_19=1, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L343] var_21_arg_0 = var_21_arg_0 & mask_SORT_3 [L344] SORT_9 var_21 = var_21_arg_0; [L345] SORT_9 var_22_arg_0 = var_21; [L346] SORT_9 var_22_arg_1 = var_11; [L347] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L348] SORT_1 var_23_arg_0 = var_19; [L349] SORT_1 var_23_arg_1 = var_22; VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=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_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_12=1, var_130=4, var_14=0, var_23_arg_0=1, var_23_arg_1=1, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L350] EXPR var_23_arg_0 | var_23_arg_1 VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=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_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_12=1, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L350] SORT_1 var_23 = var_23_arg_0 | var_23_arg_1; [L351] SORT_1 var_24_arg_0 = var_12; [L352] SORT_1 var_24_arg_1 = var_23; VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=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_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_24_arg_0=1, var_24_arg_1=1, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L353] EXPR var_24_arg_0 & var_24_arg_1 VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=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_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L353] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L354] SORT_1 var_28_arg_0 = var_24; [L355] SORT_1 var_28 = ~var_28_arg_0; [L356] SORT_1 var_29_arg_0 = var_27; [L357] SORT_1 var_29_arg_1 = var_28; VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=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_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_29_arg_0=1, var_29_arg_1=-2, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L358] EXPR var_29_arg_0 & var_29_arg_1 VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=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_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L358] SORT_1 var_29 = var_29_arg_0 & var_29_arg_1; [L359] EXPR var_29 & mask_SORT_1 VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=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_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L359] var_29 = var_29 & mask_SORT_1 [L360] SORT_1 bad_30_arg_0 = var_29; [L361] CALL __VERIFIER_assert(!(bad_30_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 847 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3774 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3774 mSDsluCounter, 22523 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17503 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 222 IncrementalHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 5020 mSDtfsCounter, 222 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=859occurred in iteration=4, 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.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 531 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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:14:29,201 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.Heap.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 60dab3e2339bce2b045dd3b78258045145cb10b71bd20a1415e48f1177a4dd2d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:14:31,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:14:31,736 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:14:31,741 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:14:31,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:14:31,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:14:31,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:14:31,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:14:31,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:14:31,774 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:14:31,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:14:31,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:14:31,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:14:31,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:14:31,775 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:14:31,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:14:31,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:14:31,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:14:31,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:14:31,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:14:31,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:14:31,778 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 05:14:31,778 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 05:14:31,778 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:14:31,778 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 05:14:31,779 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:14:31,779 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:14:31,779 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:14:31,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:14:31,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:14:31,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:14:31,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:14:31,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:14:31,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:14:31,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:14:31,781 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 05:14:31,781 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 05:14:31,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:14:31,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:14:31,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:14:31,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:14:31,784 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 05:14:31,784 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 -> 60dab3e2339bce2b045dd3b78258045145cb10b71bd20a1415e48f1177a4dd2d [2024-10-11 05:14:31,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:14:32,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:14:32,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:14:32,036 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:14:32,037 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:14:32,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Heap.c [2024-10-11 05:14:33,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:14:34,354 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:14:34,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Heap.c [2024-10-11 05:14:34,394 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4b917c29f/5a6f71f039224ef387444a58d0420b34/FLAG28c4d9f2a [2024-10-11 05:14:34,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4b917c29f/5a6f71f039224ef387444a58d0420b34 [2024-10-11 05:14:34,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:14:34,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:14:34,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:14:34,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:14:34,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:14:34,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:14:34" (1/1) ... [2024-10-11 05:14:34,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eee11d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:34, skipping insertion in model container [2024-10-11 05:14:34,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:14:34" (1/1) ... [2024-10-11 05:14:34,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:14:34,965 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.Heap.c[1244,1257] [2024-10-11 05:14:35,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:14:35,399 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:14:35,416 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.Heap.c[1244,1257] [2024-10-11 05:14:35,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:14:35,620 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:14:35,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35 WrapperNode [2024-10-11 05:14:35,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:14:35,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:14:35,622 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:14:35,622 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:14:35,628 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:14:35" (1/1) ... [2024-10-11 05:14:35,690 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:14:35" (1/1) ... [2024-10-11 05:14:35,808 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3110 [2024-10-11 05:14:35,810 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:14:35,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:14:35,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:14:35,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:14:35,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (1/1) ... [2024-10-11 05:14:35,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (1/1) ... [2024-10-11 05:14:35,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (1/1) ... [2024-10-11 05:14:35,943 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-10-11 05:14:35,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (1/1) ... [2024-10-11 05:14:35,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (1/1) ... [2024-10-11 05:14:35,986 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (1/1) ... [2024-10-11 05:14:35,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (1/1) ... [2024-10-11 05:14:36,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (1/1) ... [2024-10-11 05:14:36,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (1/1) ... [2024-10-11 05:14:36,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:14:36,043 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:14:36,043 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:14:36,043 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:14:36,044 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (1/1) ... [2024-10-11 05:14:36,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:14:36,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:14:36,074 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:14:36,079 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:14:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:14:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 05:14:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 05:14:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:14:36,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:14:36,578 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:14:36,582 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:14:37,846 INFO L? ?]: Removed 166 outVars from TransFormulas that were not future-live. [2024-10-11 05:14:37,847 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:14:37,933 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:14:37,933 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 05:14:37,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:14:37 BoogieIcfgContainer [2024-10-11 05:14:37,934 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:14:37,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:14:37,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:14:37,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:14:37,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:14:34" (1/3) ... [2024-10-11 05:14:37,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739d6992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:14:37, skipping insertion in model container [2024-10-11 05:14:37,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:35" (2/3) ... [2024-10-11 05:14:37,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739d6992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:14:37, skipping insertion in model container [2024-10-11 05:14:37,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:14:37" (3/3) ... [2024-10-11 05:14:37,945 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.Heap.c [2024-10-11 05:14:37,958 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:14:37,958 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 05:14:38,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:14:38,009 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;@21f745ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:14:38,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 05:14:38,012 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:14:38,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 05:14:38,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:14:38,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 05:14:38,017 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:14:38,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:14:38,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 05:14:38,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 05:14:38,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376313869] [2024-10-11 05:14:38,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:14:38,035 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:14:38,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 05:14:38,038 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:14:38,039 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:14:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:14:38,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 05:14:38,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:14:38,603 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:14:38,603 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:14:38,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 05:14:38,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376313869] [2024-10-11 05:14:38,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376313869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:14:38,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:14:38,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 05:14:38,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337231467] [2024-10-11 05:14:38,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:14:38,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:14:38,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 05:14:38,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:14:38,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:14:38,625 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:14:38,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:14:38,754 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-11 05:14:38,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:14:38,757 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:14:38,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:14:38,763 INFO L225 Difference]: With dead ends: 15 [2024-10-11 05:14:38,763 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 05:14:38,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:14:38,768 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:14:38,768 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.1s Time] [2024-10-11 05:14:38,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 05:14:38,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-11 05:14:38,818 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:14:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 05:14:38,820 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 05:14:38,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:14:38,820 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 05:14:38,820 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:14:38,821 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 05:14:38,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 05:14:38,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:14:38,821 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 05:14:38,830 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:14:39,025 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:14:39,026 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:14:39,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:14:39,028 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 05:14:39,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 05:14:39,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631973871] [2024-10-11 05:14:39,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:14:39,030 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:14:39,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 05:14:39,032 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:14:39,033 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:14:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:14:39,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-11 05:14:39,689 INFO L278 TraceCheckSpWp]: Computing forward predicates...