./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 03c3c0226be86be0ec03a0662affe26020abe8242f0c910b49f1d4231c5f2564 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:30:10,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:30:11,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 18:30:11,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:30:11,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:30:11,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:30:11,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:30:11,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:30:11,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:30:11,068 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:30:11,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:30:11,068 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:30:11,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:30:11,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:30:11,069 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:30:11,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:30:11,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:30:11,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:30:11,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:30:11,069 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:30:11,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:30:11,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:30:11,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:30:11,069 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:30:11,069 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:30:11,069 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:30:11,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:30:11,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:30:11,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:30:11,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:30:11,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:30:11,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:30:11,072 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:30:11,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:30:11,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:30:11,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:30:11,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:30:11,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:30:11,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:30:11,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:30:11,072 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03c3c0226be86be0ec03a0662affe26020abe8242f0c910b49f1d4231c5f2564 [2025-03-03 18:30:11,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:30:11,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:30:11,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:30:11,320 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:30:11,320 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:30:11,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c [2025-03-03 18:30:12,434 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a3ee29b4/dc3e0f586ab3401dbea7e8c7e931b0bf/FLAGe81252678 [2025-03-03 18:30:12,787 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:30:12,791 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c [2025-03-03 18:30:12,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a3ee29b4/dc3e0f586ab3401dbea7e8c7e931b0bf/FLAGe81252678 [2025-03-03 18:30:13,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a3ee29b4/dc3e0f586ab3401dbea7e8c7e931b0bf [2025-03-03 18:30:13,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:30:13,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:30:13,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:30:13,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:30:13,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:30:13,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:30:13" (1/1) ... [2025-03-03 18:30:13,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c6d1b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:13, skipping insertion in model container [2025-03-03 18:30:13,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:30:13" (1/1) ... [2025-03-03 18:30:13,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:30:13,179 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c[1260,1273] [2025-03-03 18:30:13,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:30:13,432 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:30:13,439 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c[1260,1273] [2025-03-03 18:30:13,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:30:13,597 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:30:13,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:13 WrapperNode [2025-03-03 18:30:13,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:30:13,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:30:13,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:30:13,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:30:13,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:13" (1/1) ... [2025-03-03 18:30:13,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:13" (1/1) ... [2025-03-03 18:30:14,000 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4859 [2025-03-03 18:30:14,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:30:14,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:30:14,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:30:14,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:30:14,008 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:13" (1/1) ... [2025-03-03 18:30:14,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:13" (1/1) ... [2025-03-03 18:30:14,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:13" (1/1) ... [2025-03-03 18:30:14,186 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:30:14,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:13" (1/1) ... [2025-03-03 18:30:14,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:13" (1/1) ... [2025-03-03 18:30:14,338 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:13" (1/1) ... [2025-03-03 18:30:14,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:13" (1/1) ... [2025-03-03 18:30:14,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:13" (1/1) ... [2025-03-03 18:30:14,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:13" (1/1) ... [2025-03-03 18:30:14,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:30:14,506 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:30:14,506 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:30:14,506 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:30:14,507 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:13" (1/1) ... [2025-03-03 18:30:14,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:30:14,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:30:14,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:30:14,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:30:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:30:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:30:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:30:14,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:30:14,849 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:30:14,850 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:30:18,810 INFO L? ?]: Removed 2854 outVars from TransFormulas that were not future-live. [2025-03-03 18:30:18,811 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:30:18,935 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:30:18,936 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:30:18,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:30:18 BoogieIcfgContainer [2025-03-03 18:30:18,936 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:30:18,938 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:30:18,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:30:18,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:30:18,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:30:13" (1/3) ... [2025-03-03 18:30:18,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8d2d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:30:18, skipping insertion in model container [2025-03-03 18:30:18,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:13" (2/3) ... [2025-03-03 18:30:18,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8d2d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:30:18, skipping insertion in model container [2025-03-03 18:30:18,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:30:18" (3/3) ... [2025-03-03 18:30:18,944 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p3.c [2025-03-03 18:30:18,956 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:30:18,959 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_am2910_p3.c that has 1 procedures, 1522 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:30:19,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:30:19,031 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;@9f869aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:30:19,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:30:19,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 1522 states, 1520 states have (on average 1.499342105263158) internal successors, (2279), 1521 states have internal predecessors, (2279), 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) [2025-03-03 18:30:19,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 18:30:19,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:19,042 INFO L218 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] [2025-03-03 18:30:19,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:19,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:19,046 INFO L85 PathProgramCache]: Analyzing trace with hash -346577164, now seen corresponding path program 1 times [2025-03-03 18:30:19,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:19,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792553845] [2025-03-03 18:30:19,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:19,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:19,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 18:30:19,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 18:30:19,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:19,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:19,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:19,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:19,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792553845] [2025-03-03 18:30:19,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792553845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:19,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:19,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:30:19,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659744730] [2025-03-03 18:30:19,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:19,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:30:19,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:19,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:30:19,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:30:19,719 INFO L87 Difference]: Start difference. First operand has 1522 states, 1520 states have (on average 1.499342105263158) internal successors, (2279), 1521 states have internal predecessors, (2279), 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 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:20,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:20,419 INFO L93 Difference]: Finished difference Result 2997 states and 4491 transitions. [2025-03-03 18:30:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:30:20,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-03 18:30:20,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:20,435 INFO L225 Difference]: With dead ends: 2997 [2025-03-03 18:30:20,435 INFO L226 Difference]: Without dead ends: 1521 [2025-03-03 18:30:20,442 INFO L434 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 [2025-03-03 18:30:20,447 INFO L435 NwaCegarLoop]: 1895 mSDtfsCounter, 0 mSDsluCounter, 3785 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5680 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:20,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5680 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:30:20,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2025-03-03 18:30:20,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1521. [2025-03-03 18:30:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1520 states have (on average 1.4980263157894738) internal successors, (2277), 1520 states have internal predecessors, (2277), 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) [2025-03-03 18:30:20,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2277 transitions. [2025-03-03 18:30:20,537 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2277 transitions. Word has length 41 [2025-03-03 18:30:20,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:20,537 INFO L471 AbstractCegarLoop]: Abstraction has 1521 states and 2277 transitions. [2025-03-03 18:30:20,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:20,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2277 transitions. [2025-03-03 18:30:20,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 18:30:20,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:20,539 INFO L218 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] [2025-03-03 18:30:20,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 18:30:20,540 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:20,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:20,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2145691469, now seen corresponding path program 1 times [2025-03-03 18:30:20,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:20,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427031825] [2025-03-03 18:30:20,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:20,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:20,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 18:30:20,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 18:30:20,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:20,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:20,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:20,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427031825] [2025-03-03 18:30:20,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427031825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:20,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:20,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:30:20,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888068530] [2025-03-03 18:30:20,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:20,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:30:20,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:20,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:30:20,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:30:20,738 INFO L87 Difference]: Start difference. First operand 1521 states and 2277 transitions. Second operand has 4 states, 4 states have (on average 10.5) 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) [2025-03-03 18:30:21,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:21,334 INFO L93 Difference]: Finished difference Result 2998 states and 4489 transitions. [2025-03-03 18:30:21,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:30:21,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) 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 [2025-03-03 18:30:21,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:21,340 INFO L225 Difference]: With dead ends: 2998 [2025-03-03 18:30:21,341 INFO L226 Difference]: Without dead ends: 1523 [2025-03-03 18:30:21,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:30:21,344 INFO L435 NwaCegarLoop]: 1895 mSDtfsCounter, 0 mSDsluCounter, 3782 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5677 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:21,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5677 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:30:21,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2025-03-03 18:30:21,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1523. [2025-03-03 18:30:21,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1522 states have (on average 1.497371879106439) internal successors, (2279), 1522 states have internal predecessors, (2279), 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) [2025-03-03 18:30:21,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 2279 transitions. [2025-03-03 18:30:21,383 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 2279 transitions. Word has length 42 [2025-03-03 18:30:21,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:21,383 INFO L471 AbstractCegarLoop]: Abstraction has 1523 states and 2279 transitions. [2025-03-03 18:30:21,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) 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) [2025-03-03 18:30:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 2279 transitions. [2025-03-03 18:30:21,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 18:30:21,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:21,384 INFO L218 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] [2025-03-03 18:30:21,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:30:21,384 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:21,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:21,385 INFO L85 PathProgramCache]: Analyzing trace with hash -271529457, now seen corresponding path program 1 times [2025-03-03 18:30:21,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:21,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648843438] [2025-03-03 18:30:21,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:21,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:21,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 18:30:21,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 18:30:21,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:21,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:22,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:22,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:22,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648843438] [2025-03-03 18:30:22,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648843438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:22,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:22,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:30:22,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263915296] [2025-03-03 18:30:22,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:22,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:30:22,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:22,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:30:22,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:30:22,143 INFO L87 Difference]: Start difference. First operand 1523 states and 2279 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 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) [2025-03-03 18:30:23,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:23,491 INFO L93 Difference]: Finished difference Result 3020 states and 4520 transitions. [2025-03-03 18:30:23,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:30:23,491 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 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 [2025-03-03 18:30:23,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:23,497 INFO L225 Difference]: With dead ends: 3020 [2025-03-03 18:30:23,497 INFO L226 Difference]: Without dead ends: 1543 [2025-03-03 18:30:23,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:30:23,499 INFO L435 NwaCegarLoop]: 1884 mSDtfsCounter, 2294 mSDsluCounter, 11293 mSDsCounter, 0 mSdLazyCounter, 2748 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2294 SdHoareTripleChecker+Valid, 13177 SdHoareTripleChecker+Invalid, 2750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:23,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2294 Valid, 13177 Invalid, 2750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2748 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 18:30:23,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2025-03-03 18:30:23,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1539. [2025-03-03 18:30:23,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1538 states have (on average 1.4960988296488946) internal successors, (2301), 1538 states have internal predecessors, (2301), 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) [2025-03-03 18:30:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 2301 transitions. [2025-03-03 18:30:23,525 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 2301 transitions. Word has length 43 [2025-03-03 18:30:23,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:23,525 INFO L471 AbstractCegarLoop]: Abstraction has 1539 states and 2301 transitions. [2025-03-03 18:30:23,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 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) [2025-03-03 18:30:23,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 2301 transitions. [2025-03-03 18:30:23,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 18:30:23,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:23,526 INFO L218 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] [2025-03-03 18:30:23,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:30:23,526 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:23,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:23,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2060886450, now seen corresponding path program 1 times [2025-03-03 18:30:23,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:23,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134248353] [2025-03-03 18:30:23,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:23,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:23,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 18:30:23,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 18:30:23,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:23,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:23,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:23,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:23,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134248353] [2025-03-03 18:30:23,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134248353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:23,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:23,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:30:23,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935153096] [2025-03-03 18:30:23,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:23,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:30:23,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:23,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:30:23,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:30:23,881 INFO L87 Difference]: Start difference. First operand 1539 states and 2301 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 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) [2025-03-03 18:30:25,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:25,074 INFO L93 Difference]: Finished difference Result 3028 states and 4530 transitions. [2025-03-03 18:30:25,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:30:25,075 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 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 [2025-03-03 18:30:25,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:25,079 INFO L225 Difference]: With dead ends: 3028 [2025-03-03 18:30:25,080 INFO L226 Difference]: Without dead ends: 1551 [2025-03-03 18:30:25,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:30:25,082 INFO L435 NwaCegarLoop]: 1881 mSDtfsCounter, 2260 mSDsluCounter, 11272 mSDsCounter, 0 mSdLazyCounter, 2767 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2260 SdHoareTripleChecker+Valid, 13153 SdHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:25,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2260 Valid, 13153 Invalid, 2768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2767 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 18:30:25,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2025-03-03 18:30:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1549. [2025-03-03 18:30:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1549 states, 1548 states have (on average 1.4954780361757105) internal successors, (2315), 1548 states have internal predecessors, (2315), 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) [2025-03-03 18:30:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 2315 transitions. [2025-03-03 18:30:25,104 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 2315 transitions. Word has length 44 [2025-03-03 18:30:25,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:25,104 INFO L471 AbstractCegarLoop]: Abstraction has 1549 states and 2315 transitions. [2025-03-03 18:30:25,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 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) [2025-03-03 18:30:25,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 2315 transitions. [2025-03-03 18:30:25,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 18:30:25,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:25,105 INFO L218 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] [2025-03-03 18:30:25,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:30:25,106 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:25,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:25,106 INFO L85 PathProgramCache]: Analyzing trace with hash -748401001, now seen corresponding path program 1 times [2025-03-03 18:30:25,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:25,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39030065] [2025-03-03 18:30:25,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:25,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:25,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 18:30:25,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 18:30:25,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:25,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:25,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:25,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:25,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39030065] [2025-03-03 18:30:25,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39030065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:25,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:25,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:30:25,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266290498] [2025-03-03 18:30:25,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:25,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:30:25,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:25,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:30:25,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:30:25,639 INFO L87 Difference]: Start difference. First operand 1549 states and 2315 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 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) [2025-03-03 18:30:26,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:26,991 INFO L93 Difference]: Finished difference Result 3044 states and 4551 transitions. [2025-03-03 18:30:26,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:30:26,992 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 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 [2025-03-03 18:30:26,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:26,996 INFO L225 Difference]: With dead ends: 3044 [2025-03-03 18:30:26,996 INFO L226 Difference]: Without dead ends: 1557 [2025-03-03 18:30:26,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:30:26,998 INFO L435 NwaCegarLoop]: 1837 mSDtfsCounter, 2294 mSDsluCounter, 11012 mSDsCounter, 0 mSdLazyCounter, 3095 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2294 SdHoareTripleChecker+Valid, 12849 SdHoareTripleChecker+Invalid, 3095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:26,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2294 Valid, 12849 Invalid, 3095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3095 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 18:30:27,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2025-03-03 18:30:27,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1552. [2025-03-03 18:30:27,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1551 states have (on average 1.495164410058027) internal successors, (2319), 1551 states have internal predecessors, (2319), 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) [2025-03-03 18:30:27,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2319 transitions. [2025-03-03 18:30:27,017 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2319 transitions. Word has length 44 [2025-03-03 18:30:27,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:27,017 INFO L471 AbstractCegarLoop]: Abstraction has 1552 states and 2319 transitions. [2025-03-03 18:30:27,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 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) [2025-03-03 18:30:27,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2319 transitions. [2025-03-03 18:30:27,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 18:30:27,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:27,018 INFO L218 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] [2025-03-03 18:30:27,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 18:30:27,018 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:27,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:27,019 INFO L85 PathProgramCache]: Analyzing trace with hash 100575337, now seen corresponding path program 1 times [2025-03-03 18:30:27,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:27,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779982100] [2025-03-03 18:30:27,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:27,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:27,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 18:30:27,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 18:30:27,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:27,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:27,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:27,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779982100] [2025-03-03 18:30:27,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779982100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:27,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:27,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:30:27,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234538404] [2025-03-03 18:30:27,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:27,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:30:27,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:27,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:30:27,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:30:27,313 INFO L87 Difference]: Start difference. First operand 1552 states and 2319 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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) [2025-03-03 18:30:27,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:27,771 INFO L93 Difference]: Finished difference Result 3038 states and 4543 transitions. [2025-03-03 18:30:27,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:30:27,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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 [2025-03-03 18:30:27,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:27,775 INFO L225 Difference]: With dead ends: 3038 [2025-03-03 18:30:27,775 INFO L226 Difference]: Without dead ends: 1550 [2025-03-03 18:30:27,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:30:27,777 INFO L435 NwaCegarLoop]: 1893 mSDtfsCounter, 0 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3783 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:27,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3783 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:30:27,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2025-03-03 18:30:27,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1550. [2025-03-03 18:30:27,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1549 states have (on average 1.4945125887669464) internal successors, (2315), 1549 states have internal predecessors, (2315), 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) [2025-03-03 18:30:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2315 transitions. [2025-03-03 18:30:27,793 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2315 transitions. Word has length 45 [2025-03-03 18:30:27,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:27,793 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2315 transitions. [2025-03-03 18:30:27,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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) [2025-03-03 18:30:27,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2315 transitions. [2025-03-03 18:30:27,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 18:30:27,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:27,794 INFO L218 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] [2025-03-03 18:30:27,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 18:30:27,794 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:27,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:27,794 INFO L85 PathProgramCache]: Analyzing trace with hash 373519436, now seen corresponding path program 1 times [2025-03-03 18:30:27,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:27,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858320038] [2025-03-03 18:30:27,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:27,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:27,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 18:30:27,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 18:30:27,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:27,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:30:27,833 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:30:27,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 18:30:27,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 18:30:27,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:27,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:30:27,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:30:27,921 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:30:27,922 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:30:27,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 18:30:27,925 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:27,967 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 18:30:27,983 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:30:27,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:30:27 BoogieIcfgContainer [2025-03-03 18:30:27,987 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:30:27,988 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:30:27,988 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:30:27,988 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:30:27,988 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:30:18" (3/4) ... [2025-03-03 18:30:27,990 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:30:27,990 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:30:27,991 INFO L158 Benchmark]: Toolchain (without parser) took 14972.32ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 121.9MB in the beginning and 280.9MB in the end (delta: -159.1MB). Peak memory consumption was 178.1MB. Max. memory is 16.1GB. [2025-03-03 18:30:27,991 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:30:27,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.45ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 46.3MB in the end (delta: 75.6MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-03 18:30:27,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 402.35ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 46.3MB in the beginning and 64.0MB in the end (delta: -17.8MB). Peak memory consumption was 90.3MB. Max. memory is 16.1GB. [2025-03-03 18:30:27,992 INFO L158 Benchmark]: Boogie Preprocessor took 502.20ms. Allocated memory was 176.2MB in the beginning and 419.4MB in the end (delta: 243.3MB). Free memory was 64.0MB in the beginning and 280.8MB in the end (delta: -216.7MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2025-03-03 18:30:27,992 INFO L158 Benchmark]: IcfgBuilder took 4430.22ms. Allocated memory was 419.4MB in the beginning and 536.9MB in the end (delta: 117.4MB). Free memory was 280.8MB in the beginning and 165.6MB in the end (delta: 115.2MB). Peak memory consumption was 331.3MB. Max. memory is 16.1GB. [2025-03-03 18:30:27,992 INFO L158 Benchmark]: TraceAbstraction took 9048.57ms. Allocated memory was 536.9MB in the beginning and 503.3MB in the end (delta: -33.6MB). Free memory was 165.6MB in the beginning and 281.0MB in the end (delta: -115.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:30:27,992 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 503.3MB. Free memory was 281.0MB in the beginning and 280.9MB in the end (delta: 27.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:30:27,993 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.15ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 579.45ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 46.3MB in the end (delta: 75.6MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 402.35ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 46.3MB in the beginning and 64.0MB in the end (delta: -17.8MB). Peak memory consumption was 90.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 502.20ms. Allocated memory was 176.2MB in the beginning and 419.4MB in the end (delta: 243.3MB). Free memory was 64.0MB in the beginning and 280.8MB in the end (delta: -216.7MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. * IcfgBuilder took 4430.22ms. Allocated memory was 419.4MB in the beginning and 536.9MB in the end (delta: 117.4MB). Free memory was 280.8MB in the beginning and 165.6MB in the end (delta: 115.2MB). Peak memory consumption was 331.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9048.57ms. Allocated memory was 536.9MB in the beginning and 503.3MB in the end (delta: -33.6MB). Free memory was 165.6MB in the beginning and 281.0MB in the end (delta: -115.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 503.3MB. Free memory was 281.0MB in the beginning and 280.9MB in the end (delta: 27.3kB). 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 214. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 12); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (12 - 1); [L29] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 1); [L30] const SORT_8 msb_SORT_8 = (SORT_8)1 << (1 - 1); [L32] const SORT_13 mask_SORT_13 = (SORT_13)-1 >> (sizeof(SORT_13) * 8 - 4); [L33] const SORT_13 msb_SORT_13 = (SORT_13)1 << (4 - 1); [L35] const SORT_97 mask_SORT_97 = (SORT_97)-1 >> (sizeof(SORT_97) * 8 - 3); [L36] const SORT_97 msb_SORT_97 = (SORT_97)1 << (3 - 1); [L38] const SORT_305 mask_SORT_305 = (SORT_305)-1 >> (sizeof(SORT_305) * 8 - 2); [L39] const SORT_305 msb_SORT_305 = (SORT_305)1 << (2 - 1); [L41] const SORT_309 mask_SORT_309 = (SORT_309)-1 >> (sizeof(SORT_309) * 8 - 5); [L42] const SORT_309 msb_SORT_309 = (SORT_309)1 << (5 - 1); [L44] const SORT_311 mask_SORT_311 = (SORT_311)-1 >> (sizeof(SORT_311) * 8 - 6); [L45] const SORT_311 msb_SORT_311 = (SORT_311)1 << (6 - 1); [L47] const SORT_313 mask_SORT_313 = (SORT_313)-1 >> (sizeof(SORT_313) * 8 - 7); [L48] const SORT_313 msb_SORT_313 = (SORT_313)1 << (7 - 1); [L50] const SORT_315 mask_SORT_315 = (SORT_315)-1 >> (sizeof(SORT_315) * 8 - 8); [L51] const SORT_315 msb_SORT_315 = (SORT_315)1 << (8 - 1); [L53] const SORT_317 mask_SORT_317 = (SORT_317)-1 >> (sizeof(SORT_317) * 8 - 9); [L54] const SORT_317 msb_SORT_317 = (SORT_317)1 << (9 - 1); [L56] const SORT_319 mask_SORT_319 = (SORT_319)-1 >> (sizeof(SORT_319) * 8 - 10); [L57] const SORT_319 msb_SORT_319 = (SORT_319)1 << (10 - 1); [L59] const SORT_321 mask_SORT_321 = (SORT_321)-1 >> (sizeof(SORT_321) * 8 - 11); [L60] const SORT_321 msb_SORT_321 = (SORT_321)1 << (11 - 1); [L62] const SORT_8 var_18 = 0; [L63] const SORT_1 var_22 = 0; [L64] const SORT_1 var_25 = 2; [L65] const SORT_1 var_47 = 1; [L66] const SORT_8 var_52 = 1; [L67] const SORT_13 var_56 = 2; [L68] const SORT_13 var_61 = 9; [L69] const SORT_13 var_69 = 15; [L70] const SORT_13 var_74 = 1; [L71] const SORT_13 var_76 = 3; [L72] const SORT_13 var_79 = 5; [L73] const SORT_13 var_82 = 7; [L74] const SORT_13 var_85 = 11; [L75] const SORT_97 var_98 = 0; [L76] const SORT_13 var_111 = 8; [L77] const SORT_13 var_115 = 10; [L78] const SORT_13 var_119 = 13; [L79] const SORT_13 var_130 = 4; [L80] const SORT_13 var_132 = 12; [L81] const SORT_13 var_135 = 14; [L82] const SORT_13 var_141 = 6; [L83] const SORT_13 var_168 = 0; [L84] const SORT_97 var_216 = 1; [L85] const SORT_97 var_218 = 5; [L86] const SORT_1 var_245 = 4095; [L87] const SORT_321 var_592 = 0; [L89] SORT_1 input_2; [L90] SORT_1 input_3; [L91] SORT_1 input_4; [L92] SORT_1 input_5; [L93] SORT_1 input_6; [L94] SORT_1 input_7; [L95] SORT_8 input_9; [L96] SORT_8 input_10; [L97] SORT_8 input_11; [L98] SORT_1 input_12; [L99] SORT_13 input_14; [L100] SORT_8 input_15; [L101] SORT_8 input_16; [L102] SORT_8 input_17; [L103] SORT_1 input_210; [L104] SORT_97 input_212; [L105] SORT_1 input_232; [L106] SORT_97 input_235; [L108] EXPR __VERIFIER_nondet_uchar() & mask_SORT_8 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L108] SORT_8 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_8; [L109] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L109] SORT_1 state_23 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L110] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L110] SORT_1 state_28 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L111] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L111] SORT_1 state_30 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L112] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L112] SORT_1 state_33 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L113] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L113] SORT_1 state_35 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L114] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L114] SORT_1 state_39 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L115] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L115] SORT_1 state_41 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L116] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L116] SORT_1 state_58 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L117] EXPR __VERIFIER_nondet_uchar() & mask_SORT_97 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L117] SORT_97 state_99 = __VERIFIER_nondet_uchar() & mask_SORT_97; [L118] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L118] SORT_1 state_128 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L120] SORT_8 init_20_arg_1 = var_18; [L121] state_19 = init_20_arg_1 [L122] SORT_1 init_24_arg_1 = var_22; [L123] state_23 = init_24_arg_1 [L124] SORT_1 init_29_arg_1 = var_22; [L125] state_28 = init_29_arg_1 [L126] SORT_1 init_31_arg_1 = var_22; [L127] state_30 = init_31_arg_1 [L128] SORT_1 init_34_arg_1 = var_22; [L129] state_33 = init_34_arg_1 [L130] SORT_1 init_36_arg_1 = var_22; [L131] state_35 = init_36_arg_1 [L132] SORT_1 init_40_arg_1 = var_22; [L133] state_39 = init_40_arg_1 [L134] SORT_1 init_42_arg_1 = var_22; [L135] state_41 = init_42_arg_1 [L136] SORT_1 init_59_arg_1 = var_22; [L137] state_58 = init_59_arg_1 [L138] SORT_97 init_100_arg_1 = var_98; [L139] state_99 = init_100_arg_1 [L140] SORT_1 init_129_arg_1 = var_22; [L141] state_128 = init_129_arg_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_19=0, state_23=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L144] input_2 = __VERIFIER_nondet_ushort() [L145] input_3 = __VERIFIER_nondet_ushort() [L146] input_4 = __VERIFIER_nondet_ushort() [L147] input_5 = __VERIFIER_nondet_ushort() [L148] input_6 = __VERIFIER_nondet_ushort() [L149] input_7 = __VERIFIER_nondet_ushort() [L150] input_9 = __VERIFIER_nondet_uchar() [L151] input_10 = __VERIFIER_nondet_uchar() [L152] input_11 = __VERIFIER_nondet_uchar() [L153] EXPR input_11 & mask_SORT_8 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_19=0, state_23=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L153] input_11 = input_11 & mask_SORT_8 [L154] input_12 = __VERIFIER_nondet_ushort() [L155] input_14 = __VERIFIER_nondet_uchar() [L156] EXPR input_14 & mask_SORT_13 VAL [input_11=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_19=0, state_23=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L156] input_14 = input_14 & mask_SORT_13 [L157] input_15 = __VERIFIER_nondet_uchar() [L158] input_16 = __VERIFIER_nondet_uchar() [L159] input_17 = __VERIFIER_nondet_uchar() [L160] input_210 = __VERIFIER_nondet_ushort() [L161] input_212 = __VERIFIER_nondet_uchar() [L162] input_232 = __VERIFIER_nondet_ushort() [L163] input_235 = __VERIFIER_nondet_uchar() [L166] SORT_8 var_21_arg_0 = state_19; [L167] SORT_8 var_21_arg_1 = var_18; [L168] SORT_8 var_21 = var_21_arg_0 == var_21_arg_1; [L169] SORT_1 var_26_arg_0 = state_23; [L170] SORT_1 var_26_arg_1 = var_25; [L171] SORT_8 var_26 = var_26_arg_0 != var_26_arg_1; [L172] SORT_8 var_27_arg_0 = var_21; [L173] SORT_8 var_27_arg_1 = var_26; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_27_arg_0=1, var_27_arg_1=1, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L174] EXPR var_27_arg_0 | var_27_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L174] SORT_8 var_27 = var_27_arg_0 | var_27_arg_1; [L175] SORT_8 var_44_arg_0 = var_18; [L176] SORT_1 var_44_arg_1 = input_7; [L177] SORT_1 var_44_arg_2 = input_6; [L178] SORT_1 var_44 = var_44_arg_0 ? var_44_arg_1 : var_44_arg_2; [L179] SORT_8 var_43_arg_0 = var_18; [L180] SORT_1 var_43_arg_1 = state_41; [L181] SORT_1 var_43_arg_2 = state_39; [L182] SORT_1 var_43 = var_43_arg_0 ? var_43_arg_1 : var_43_arg_2; [L183] SORT_8 var_45_arg_0 = var_18; [L184] SORT_1 var_45_arg_1 = var_44; [L185] SORT_1 var_45_arg_2 = var_43; [L186] SORT_1 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L187] SORT_8 var_37_arg_0 = var_18; [L188] SORT_1 var_37_arg_1 = state_35; [L189] SORT_1 var_37_arg_2 = state_33; [L190] SORT_1 var_37 = var_37_arg_0 ? var_37_arg_1 : var_37_arg_2; [L191] SORT_8 var_32_arg_0 = var_18; [L192] SORT_1 var_32_arg_1 = state_30; [L193] SORT_1 var_32_arg_2 = state_28; [L194] SORT_1 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L195] SORT_8 var_38_arg_0 = var_18; [L196] SORT_1 var_38_arg_1 = var_37; [L197] SORT_1 var_38_arg_2 = var_32; [L198] SORT_1 var_38 = var_38_arg_0 ? var_38_arg_1 : var_38_arg_2; [L199] SORT_8 var_46_arg_0 = var_18; [L200] SORT_1 var_46_arg_1 = var_45; [L201] SORT_1 var_46_arg_2 = var_38; [L202] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_27=1, var_46=0, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L203] EXPR var_46 & mask_SORT_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_27=1, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L203] var_46 = var_46 & mask_SORT_1 [L204] SORT_1 var_48_arg_0 = var_46; [L205] SORT_1 var_48_arg_1 = var_47; [L206] SORT_8 var_48 = var_48_arg_0 == var_48_arg_1; [L207] SORT_8 var_49_arg_0 = var_27; [L208] SORT_8 var_49_arg_1 = var_48; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_49_arg_0=1, var_49_arg_1=0, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L209] EXPR var_49_arg_0 | var_49_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L209] SORT_8 var_49 = var_49_arg_0 | var_49_arg_1; [L210] SORT_8 var_53_arg_0 = var_49; [L211] SORT_8 var_53 = ~var_53_arg_0; [L212] SORT_8 var_54_arg_0 = var_52; [L213] SORT_8 var_54_arg_1 = var_53; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_54_arg_0=1, var_54_arg_1=-2, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L214] EXPR var_54_arg_0 & var_54_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L214] SORT_8 var_54 = var_54_arg_0 & var_54_arg_1; [L215] EXPR var_54 & mask_SORT_8 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L215] var_54 = var_54 & mask_SORT_8 [L216] SORT_8 bad_55_arg_0 = var_54; [L217] CALL __VERIFIER_assert(!(bad_55_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1522 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6848 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6848 mSDsluCounter, 54319 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43034 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11663 IncrementalHoareTripleChecker+Invalid, 11666 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 11285 mSDtfsCounter, 11663 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1552occurred in iteration=5, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 1192 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 18:30:28,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 03c3c0226be86be0ec03a0662affe26020abe8242f0c910b49f1d4231c5f2564 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:30:29,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:30:29,936 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 18:30:29,940 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:30:29,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:30:29,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:30:29,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:30:29,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:30:29,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:30:29,958 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:30:29,958 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:30:29,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:30:29,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:30:29,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:30:29,959 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:30:29,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:30:29,959 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:30:29,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:30:29,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:30:29,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:30:29,960 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:30:29,960 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:30:29,960 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:30:29,960 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:30:29,960 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:30:29,960 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:30:29,960 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:30:29,960 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:30:29,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:30:29,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:30:29,961 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:30:29,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:30:29,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:30:29,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:30:29,961 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:30:29,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:30:29,961 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:30:29,962 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:30:29,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:30:29,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:30:29,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:30:29,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:30:29,962 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03c3c0226be86be0ec03a0662affe26020abe8242f0c910b49f1d4231c5f2564 [2025-03-03 18:30:30,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:30:30,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:30:30,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:30:30,207 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:30:30,207 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:30:30,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c [2025-03-03 18:30:31,357 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83eb094d6/92ee9a7e99034bd1a5e9d7d1316703d4/FLAG6ceae2d9e [2025-03-03 18:30:31,646 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:30:31,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c [2025-03-03 18:30:31,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83eb094d6/92ee9a7e99034bd1a5e9d7d1316703d4/FLAG6ceae2d9e [2025-03-03 18:30:31,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83eb094d6/92ee9a7e99034bd1a5e9d7d1316703d4 [2025-03-03 18:30:31,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:30:31,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:30:31,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:30:31,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:30:31,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:30:31,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:30:31" (1/1) ... [2025-03-03 18:30:31,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@275aee97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:31, skipping insertion in model container [2025-03-03 18:30:31,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:30:31" (1/1) ... [2025-03-03 18:30:31,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:30:31,871 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c[1260,1273] [2025-03-03 18:30:32,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:30:32,120 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:30:32,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c[1260,1273] [2025-03-03 18:30:32,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:30:32,290 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:30:32,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:32 WrapperNode [2025-03-03 18:30:32,291 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:30:32,292 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:30:32,292 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:30:32,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:30:32,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:32" (1/1) ... [2025-03-03 18:30:32,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:32" (1/1) ... [2025-03-03 18:30:32,410 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1835 [2025-03-03 18:30:32,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:30:32,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:30:32,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:30:32,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:30:32,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:32" (1/1) ... [2025-03-03 18:30:32,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:32" (1/1) ... [2025-03-03 18:30:32,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:32" (1/1) ... [2025-03-03 18:30:32,465 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:30:32,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:32" (1/1) ... [2025-03-03 18:30:32,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:32" (1/1) ... [2025-03-03 18:30:32,501 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:32" (1/1) ... [2025-03-03 18:30:32,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:32" (1/1) ... [2025-03-03 18:30:32,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:32" (1/1) ... [2025-03-03 18:30:32,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:32" (1/1) ... [2025-03-03 18:30:32,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:30:32,527 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:30:32,527 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:30:32,527 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:30:32,528 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:32" (1/1) ... [2025-03-03 18:30:32,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:30:32,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:30:32,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:30:32,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:30:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:30:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:30:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:30:32,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:30:32,801 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:30:32,803 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:30:34,144 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2025-03-03 18:30:34,145 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:30:34,152 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:30:34,152 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:30:34,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:30:34 BoogieIcfgContainer [2025-03-03 18:30:34,152 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:30:34,154 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:30:34,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:30:34,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:30:34,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:30:31" (1/3) ... [2025-03-03 18:30:34,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acfc476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:30:34, skipping insertion in model container [2025-03-03 18:30:34,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:32" (2/3) ... [2025-03-03 18:30:34,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acfc476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:30:34, skipping insertion in model container [2025-03-03 18:30:34,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:30:34" (3/3) ... [2025-03-03 18:30:34,160 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p3.c [2025-03-03 18:30:34,169 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:30:34,171 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_am2910_p3.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:30:34,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:30:34,212 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;@45bdbf3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:30:34,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:30:34,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 18:30:34,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:34,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 18:30:34,218 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:34,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:34,222 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 18:30:34,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:30:34,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [939615591] [2025-03-03 18:30:34,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:34,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:30:34,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:30:34,231 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:30:34,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 18:30:34,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 18:30:34,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 18:30:34,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:34,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:34,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 18:30:34,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:30:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:34,662 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:30:34,662 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:30:34,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939615591] [2025-03-03 18:30:34,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939615591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:34,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:34,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:30:34,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557850351] [2025-03-03 18:30:34,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:34,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:30:34,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:30:34,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:30:34,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:30:34,684 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:34,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:34,793 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-03-03 18:30:34,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:30:34,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-03 18:30:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:34,799 INFO L225 Difference]: With dead ends: 17 [2025-03-03 18:30:34,799 INFO L226 Difference]: Without dead ends: 9 [2025-03-03 18:30:34,801 INFO L434 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 [2025-03-03 18:30:34,803 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:34,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:30:34,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-03 18:30:34,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-03 18:30:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 18:30:34,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 18:30:34,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:34,826 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 18:30:34,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:34,827 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 18:30:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 18:30:34,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:34,827 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:34,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 18:30:35,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:30:35,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:35,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:35,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 18:30:35,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:30:35,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1676815357] [2025-03-03 18:30:35,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:35,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:30:35,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:30:35,036 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:30:35,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 18:30:35,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 18:30:35,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 18:30:35,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:35,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:35,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 18:30:35,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:30:35,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:35,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:30:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:36,074 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:30:36,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676815357] [2025-03-03 18:30:36,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676815357] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:30:36,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:30:36,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-03 18:30:36,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284052423] [2025-03-03 18:30:36,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 18:30:36,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:30:36,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:30:36,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:30:36,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:30:36,076 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:36,342 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-03 18:30:36,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:30:36,343 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 18:30:36,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:36,343 INFO L225 Difference]: With dead ends: 14 [2025-03-03 18:30:36,343 INFO L226 Difference]: Without dead ends: 12 [2025-03-03 18:30:36,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:30:36,344 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:36,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:30:36,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-03 18:30:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-03 18:30:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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) [2025-03-03 18:30:36,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-03 18:30:36,347 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-03-03 18:30:36,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:36,347 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-03 18:30:36,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:36,347 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-03 18:30:36,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 18:30:36,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:36,348 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-03 18:30:36,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 18:30:36,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:30:36,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:36,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:36,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-03-03 18:30:36,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:30:36,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [570847422] [2025-03-03 18:30:36,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 18:30:36,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:30:36,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:30:36,562 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:30:36,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 18:30:36,952 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-03 18:30:37,079 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 18:30:37,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 18:30:37,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:37,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 18:30:37,103 INFO L279 TraceCheckSpWp]: Computing forward predicates...