./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p4.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_p4.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 71117c9c67f985d05d0c9859b116d512376f478c1182a53aad610245b01d40e1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:30:11,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:30:11,536 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,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:30:11,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:30:11,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:30:11,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:30:11,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:30:11,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:30:11,557 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:30:11,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:30:11,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:30:11,558 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:30:11,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:30:11,558 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:30:11,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:30:11,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:30:11,559 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:30:11,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:30:11,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:30:11,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:30:11,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:30:11,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:30:11,559 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:30:11,559 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:30:11,559 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:30:11,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:30:11,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:30:11,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:30:11,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:30:11,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:30:11,560 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:30:11,560 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:30:11,560 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:30:11,560 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:30:11,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:30:11,560 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:30:11,560 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:30:11,560 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:30:11,560 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:30:11,560 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 -> 71117c9c67f985d05d0c9859b116d512376f478c1182a53aad610245b01d40e1 [2025-03-03 18:30:11,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:30:11,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:30:11,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:30:11,783 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:30:11,784 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:30:11,785 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_p4.c [2025-03-03 18:30:12,932 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83300682f/6cd10cca3a66488b8cdb5e68ff765f2a/FLAG97e3d26b1 [2025-03-03 18:30:13,260 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:30:13,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p4.c [2025-03-03 18:30:13,280 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83300682f/6cd10cca3a66488b8cdb5e68ff765f2a/FLAG97e3d26b1 [2025-03-03 18:30:13,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83300682f/6cd10cca3a66488b8cdb5e68ff765f2a [2025-03-03 18:30:13,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:30:13,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:30:13,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:30:13,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:30:13,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:30:13,306 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,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc97dec 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,307 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,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:30:13,475 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_p4.c[1260,1273] [2025-03-03 18:30:13,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:30:13,732 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:30:13,738 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_p4.c[1260,1273] [2025-03-03 18:30:13,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:30:13,902 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:30:13,903 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,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:30:13,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:30:13,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:30:13,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:30:13,909 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,953 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,338 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4899 [2025-03-03 18:30:14,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:30:14,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:30:14,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:30:14,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:30:14,346 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,346 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,395 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,529 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,530 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,530 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,602 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,616 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,634 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,655 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,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:30:14,699 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:30:14,699 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:30:14,699 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:30:14,700 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,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:30:14,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:30:14,725 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,727 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,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:30:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:30:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:30:14,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:30:15,031 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:30:15,033 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:30:18,813 INFO L? ?]: Removed 2880 outVars from TransFormulas that were not future-live. [2025-03-03 18:30:18,814 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:30:18,978 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:30:18,978 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:30:18,979 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,979 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:30:18,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:30:18,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:30:18,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:30:18,987 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,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2025c97 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,988 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,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2025c97 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,989 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,990 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p4.c [2025-03-03 18:30:19,003 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:30:19,005 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_am2910_p4.c that has 1 procedures, 1534 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:30:19,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:30:19,097 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;@8fc4804, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:30:19,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:30:19,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 1534 states, 1532 states have (on average 1.4993472584856398) internal successors, (2297), 1533 states have internal predecessors, (2297), 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,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 18:30:19,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:19,111 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, 1, 1] [2025-03-03 18:30:19,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:19,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:19,115 INFO L85 PathProgramCache]: Analyzing trace with hash 848616097, now seen corresponding path program 1 times [2025-03-03 18:30:19,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:19,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912975378] [2025-03-03 18:30:19,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:19,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:19,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 18:30:19,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 18:30:19,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:19,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:19,743 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,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:19,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912975378] [2025-03-03 18:30:19,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912975378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:19,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:19,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:30:19,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771964080] [2025-03-03 18:30:19,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:19,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:30:19,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:19,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:30:19,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:30:19,768 INFO L87 Difference]: Start difference. First operand has 1534 states, 1532 states have (on average 1.4993472584856398) internal successors, (2297), 1533 states have internal predecessors, (2297), 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 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:20,445 INFO L93 Difference]: Finished difference Result 3017 states and 4521 transitions. [2025-03-03 18:30:20,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:30:20,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2025-03-03 18:30:20,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:20,458 INFO L225 Difference]: With dead ends: 3017 [2025-03-03 18:30:20,458 INFO L226 Difference]: Without dead ends: 1533 [2025-03-03 18:30:20,462 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,464 INFO L435 NwaCegarLoop]: 1910 mSDtfsCounter, 0 mSDsluCounter, 3815 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5725 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:20,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5725 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:30:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2025-03-03 18:30:20,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1533. [2025-03-03 18:30:20,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1532 states have (on average 1.498041775456919) internal successors, (2295), 1532 states have internal predecessors, (2295), 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,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2295 transitions. [2025-03-03 18:30:20,542 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2295 transitions. Word has length 47 [2025-03-03 18:30:20,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:20,542 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 2295 transitions. [2025-03-03 18:30:20,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2295 transitions. [2025-03-03 18:30:20,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 18:30:20,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:20,543 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, 1, 1, 1] [2025-03-03 18:30:20,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 18:30:20,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:20,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:20,544 INFO L85 PathProgramCache]: Analyzing trace with hash 541976896, now seen corresponding path program 1 times [2025-03-03 18:30:20,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:20,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215320584] [2025-03-03 18:30:20,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:20,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:20,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 18:30:20,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 18:30:20,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:20,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:20,748 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,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:20,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215320584] [2025-03-03 18:30:20,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215320584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:20,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:20,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:30:20,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386291001] [2025-03-03 18:30:20,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:20,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:30:20,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:20,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:30:20,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:30:20,750 INFO L87 Difference]: Start difference. First operand 1533 states and 2295 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:21,321 INFO L93 Difference]: Finished difference Result 3018 states and 4519 transitions. [2025-03-03 18:30:21,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:30:21,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 48 [2025-03-03 18:30:21,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:21,326 INFO L225 Difference]: With dead ends: 3018 [2025-03-03 18:30:21,326 INFO L226 Difference]: Without dead ends: 1535 [2025-03-03 18:30:21,328 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,328 INFO L435 NwaCegarLoop]: 1910 mSDtfsCounter, 0 mSDsluCounter, 3812 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5722 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:21,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5722 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:30:21,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2025-03-03 18:30:21,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1535. [2025-03-03 18:30:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1534 states have (on average 1.4973924380704042) internal successors, (2297), 1534 states have internal predecessors, (2297), 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,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2297 transitions. [2025-03-03 18:30:21,349 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2297 transitions. Word has length 48 [2025-03-03 18:30:21,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:21,350 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 2297 transitions. [2025-03-03 18:30:21,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2297 transitions. [2025-03-03 18:30:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 18:30:21,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:21,351 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, 1, 1, 1, 1] [2025-03-03 18:30:21,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:30:21,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:21,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:21,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1552926332, now seen corresponding path program 1 times [2025-03-03 18:30:21,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:21,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399890541] [2025-03-03 18:30:21,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:21,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:21,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 18:30:21,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 18:30:21,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:21,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:21,990 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:21,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:21,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399890541] [2025-03-03 18:30:21,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399890541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:21,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:21,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:30:21,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281153272] [2025-03-03 18:30:21,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:21,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:30:21,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:21,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:30:21,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:30:21,992 INFO L87 Difference]: Start difference. First operand 1535 states and 2297 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:23,232 INFO L93 Difference]: Finished difference Result 3048 states and 4562 transitions. [2025-03-03 18:30:23,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:30:23,235 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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 49 [2025-03-03 18:30:23,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:23,240 INFO L225 Difference]: With dead ends: 3048 [2025-03-03 18:30:23,240 INFO L226 Difference]: Without dead ends: 1563 [2025-03-03 18:30:23,242 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,244 INFO L435 NwaCegarLoop]: 1900 mSDtfsCounter, 2330 mSDsluCounter, 9494 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2330 SdHoareTripleChecker+Valid, 11394 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:23,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2330 Valid, 11394 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 18:30:23,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2025-03-03 18:30:23,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1559. [2025-03-03 18:30:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1558 states have (on average 1.4961489088575097) internal successors, (2331), 1558 states have internal predecessors, (2331), 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,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2331 transitions. [2025-03-03 18:30:23,271 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2331 transitions. Word has length 49 [2025-03-03 18:30:23,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:23,272 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2331 transitions. [2025-03-03 18:30:23,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2331 transitions. [2025-03-03 18:30:23,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 18:30:23,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:23,274 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, 1, 1, 1, 1, 1] [2025-03-03 18:30:23,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:30:23,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:23,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:23,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1510526235, now seen corresponding path program 1 times [2025-03-03 18:30:23,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:23,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142642846] [2025-03-03 18:30:23,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:23,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:23,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 18:30:23,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 18:30:23,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:23,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:23,751 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,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:23,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142642846] [2025-03-03 18:30:23,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142642846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:23,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:23,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:30:23,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303623034] [2025-03-03 18:30:23,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:23,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:30:23,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:23,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:30:23,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:30:23,753 INFO L87 Difference]: Start difference. First operand 1559 states and 2331 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:25,469 INFO L93 Difference]: Finished difference Result 3055 states and 4570 transitions. [2025-03-03 18:30:25,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:30:25,469 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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 50 [2025-03-03 18:30:25,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:25,474 INFO L225 Difference]: With dead ends: 3055 [2025-03-03 18:30:25,474 INFO L226 Difference]: Without dead ends: 1570 [2025-03-03 18:30:25,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:30:25,478 INFO L435 NwaCegarLoop]: 1892 mSDtfsCounter, 2337 mSDsluCounter, 13234 mSDsCounter, 0 mSdLazyCounter, 3218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2337 SdHoareTripleChecker+Valid, 15126 SdHoareTripleChecker+Invalid, 3220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:25,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2337 Valid, 15126 Invalid, 3220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3218 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 18:30:25,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2025-03-03 18:30:25,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1567. [2025-03-03 18:30:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1566 states have (on average 1.4955300127713922) internal successors, (2342), 1566 states have internal predecessors, (2342), 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,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2342 transitions. [2025-03-03 18:30:25,501 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2342 transitions. Word has length 50 [2025-03-03 18:30:25,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:25,501 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2342 transitions. [2025-03-03 18:30:25,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2342 transitions. [2025-03-03 18:30:25,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 18:30:25,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:25,503 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, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:25,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:30:25,504 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:25,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:25,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1991106051, now seen corresponding path program 1 times [2025-03-03 18:30:25,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:25,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448380021] [2025-03-03 18:30:25,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:25,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:25,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 18:30:25,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 18:30:25,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:25,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:25,808 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,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:25,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448380021] [2025-03-03 18:30:25,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448380021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:25,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:25,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:30:25,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571793332] [2025-03-03 18:30:25,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:25,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:30:25,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:25,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:30:25,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:30:25,809 INFO L87 Difference]: Start difference. First operand 1567 states and 2342 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:26,746 INFO L93 Difference]: Finished difference Result 3070 states and 4589 transitions. [2025-03-03 18:30:26,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:30:26,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 51 [2025-03-03 18:30:26,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:26,751 INFO L225 Difference]: With dead ends: 3070 [2025-03-03 18:30:26,751 INFO L226 Difference]: Without dead ends: 1568 [2025-03-03 18:30:26,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:30:26,753 INFO L435 NwaCegarLoop]: 1900 mSDtfsCounter, 2305 mSDsluCounter, 7591 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2305 SdHoareTripleChecker+Valid, 9491 SdHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:26,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2305 Valid, 9491 Invalid, 1975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:30:26,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2025-03-03 18:30:26,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1568. [2025-03-03 18:30:26,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1567 states have (on average 1.4945756222080409) internal successors, (2342), 1567 states have internal predecessors, (2342), 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,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2342 transitions. [2025-03-03 18:30:26,775 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2342 transitions. Word has length 51 [2025-03-03 18:30:26,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:26,776 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2342 transitions. [2025-03-03 18:30:26,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2342 transitions. [2025-03-03 18:30:26,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 18:30:26,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:26,776 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, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:26,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 18:30:26,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:26,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:26,777 INFO L85 PathProgramCache]: Analyzing trace with hash -510525519, now seen corresponding path program 1 times [2025-03-03 18:30:26,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:26,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431980008] [2025-03-03 18:30:26,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:26,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:26,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 18:30:26,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 18:30:26,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:26,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:27,293 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,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:27,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431980008] [2025-03-03 18:30:27,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431980008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:27,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:27,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:30:27,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580455985] [2025-03-03 18:30:27,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:27,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:30:27,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:27,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:30:27,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:30:27,295 INFO L87 Difference]: Start difference. First operand 1568 states and 2342 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:27,935 INFO L93 Difference]: Finished difference Result 3074 states and 4592 transitions. [2025-03-03 18:30:27,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:30:27,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 51 [2025-03-03 18:30:27,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:27,940 INFO L225 Difference]: With dead ends: 3074 [2025-03-03 18:30:27,940 INFO L226 Difference]: Without dead ends: 1568 [2025-03-03 18:30:27,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:30:27,943 INFO L435 NwaCegarLoop]: 1900 mSDtfsCounter, 2295 mSDsluCounter, 3795 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2295 SdHoareTripleChecker+Valid, 5695 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:27,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2295 Valid, 5695 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:30:27,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2025-03-03 18:30:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1568. [2025-03-03 18:30:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1567 states have (on average 1.4939374601148692) internal successors, (2341), 1567 states have internal predecessors, (2341), 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,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2341 transitions. [2025-03-03 18:30:27,969 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2341 transitions. Word has length 51 [2025-03-03 18:30:27,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:27,969 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2341 transitions. [2025-03-03 18:30:27,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2341 transitions. [2025-03-03 18:30:27,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 18:30:27,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:27,970 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:27,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 18:30:27,971 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:27,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:27,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1123986194, now seen corresponding path program 1 times [2025-03-03 18:30:27,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:27,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553534282] [2025-03-03 18:30:27,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:27,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:27,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 18:30:28,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 18:30:28,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:28,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:28,385 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:28,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:28,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553534282] [2025-03-03 18:30:28,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553534282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:28,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:28,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:30:28,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832504158] [2025-03-03 18:30:28,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:28,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:30:28,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:28,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:30:28,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:30:28,387 INFO L87 Difference]: Start difference. First operand 1568 states and 2341 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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:29,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:29,092 INFO L93 Difference]: Finished difference Result 3071 states and 4587 transitions. [2025-03-03 18:30:29,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:30:29,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 52 [2025-03-03 18:30:29,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:29,096 INFO L225 Difference]: With dead ends: 3071 [2025-03-03 18:30:29,096 INFO L226 Difference]: Without dead ends: 1571 [2025-03-03 18:30:29,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:30:29,098 INFO L435 NwaCegarLoop]: 1901 mSDtfsCounter, 2302 mSDsluCounter, 3820 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2302 SdHoareTripleChecker+Valid, 5721 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:29,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2302 Valid, 5721 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:30:29,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2025-03-03 18:30:29,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1570. [2025-03-03 18:30:29,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1569 states have (on average 1.4933078393881454) internal successors, (2343), 1569 states have internal predecessors, (2343), 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:29,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2343 transitions. [2025-03-03 18:30:29,119 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2343 transitions. Word has length 52 [2025-03-03 18:30:29,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:29,119 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2343 transitions. [2025-03-03 18:30:29,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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:29,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2343 transitions. [2025-03-03 18:30:29,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 18:30:29,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:29,120 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:29,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 18:30:29,120 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:29,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:29,121 INFO L85 PathProgramCache]: Analyzing trace with hash -538717768, now seen corresponding path program 1 times [2025-03-03 18:30:29,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:29,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400143178] [2025-03-03 18:30:29,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:29,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:29,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 18:30:29,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 18:30:29,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:29,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:29,496 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:29,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:29,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400143178] [2025-03-03 18:30:29,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400143178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:29,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:29,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:30:29,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120650223] [2025-03-03 18:30:29,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:29,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:30:29,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:29,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:30:29,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:30:29,500 INFO L87 Difference]: Start difference. First operand 1570 states and 2343 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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:30,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:30,453 INFO L93 Difference]: Finished difference Result 3062 states and 4577 transitions. [2025-03-03 18:30:30,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:30:30,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 53 [2025-03-03 18:30:30,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:30,457 INFO L225 Difference]: With dead ends: 3062 [2025-03-03 18:30:30,457 INFO L226 Difference]: Without dead ends: 1577 [2025-03-03 18:30:30,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:30:30,459 INFO L435 NwaCegarLoop]: 1902 mSDtfsCounter, 2256 mSDsluCounter, 7593 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2256 SdHoareTripleChecker+Valid, 9495 SdHoareTripleChecker+Invalid, 1992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:30,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2256 Valid, 9495 Invalid, 1992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1990 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 18:30:30,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2025-03-03 18:30:30,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1573. [2025-03-03 18:30:30,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1572 states have (on average 1.493002544529262) internal successors, (2347), 1572 states have internal predecessors, (2347), 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:30,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2347 transitions. [2025-03-03 18:30:30,480 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2347 transitions. Word has length 53 [2025-03-03 18:30:30,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:30,480 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 2347 transitions. [2025-03-03 18:30:30,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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:30,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2347 transitions. [2025-03-03 18:30:30,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 18:30:30,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:30,481 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:30,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 18:30:30,481 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:30,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:30,481 INFO L85 PathProgramCache]: Analyzing trace with hash 941862764, now seen corresponding path program 1 times [2025-03-03 18:30:30,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:30,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102681858] [2025-03-03 18:30:30,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:30,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:30,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 18:30:30,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 18:30:30,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:30,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:30:30,537 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:30:30,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 18:30:30,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 18:30:30,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:30,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:30:30,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:30:30,649 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:30:30,650 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:30:30,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 18:30:30,653 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:30,682 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 18:30:30,698 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:30:30,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:30:30 BoogieIcfgContainer [2025-03-03 18:30:30,704 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:30:30,704 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:30:30,704 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:30:30,705 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:30:30,706 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:30,708 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:30:30,708 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:30:30,710 INFO L158 Benchmark]: Toolchain (without parser) took 17408.65ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 103.5MB in the beginning and 372.7MB in the end (delta: -269.2MB). Peak memory consumption was 227.3MB. Max. memory is 16.1GB. [2025-03-03 18:30:30,710 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:30:30,710 INFO L158 Benchmark]: CACSL2BoogieTranslator took 601.94ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 78.1MB in the end (delta: 24.7MB). Peak memory consumption was 97.7MB. Max. memory is 16.1GB. [2025-03-03 18:30:30,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 435.03ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 78.1MB in the beginning and 230.9MB in the end (delta: -152.8MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. [2025-03-03 18:30:30,711 INFO L158 Benchmark]: Boogie Preprocessor took 358.65ms. Allocated memory is still 369.1MB. Free memory was 230.9MB in the beginning and 193.6MB in the end (delta: 37.3MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2025-03-03 18:30:30,711 INFO L158 Benchmark]: IcfgBuilder took 4282.18ms. Allocated memory was 369.1MB in the beginning and 763.4MB in the end (delta: 394.3MB). Free memory was 193.6MB in the beginning and 262.6MB in the end (delta: -69.0MB). Peak memory consumption was 353.3MB. Max. memory is 16.1GB. [2025-03-03 18:30:30,711 INFO L158 Benchmark]: TraceAbstraction took 11720.97ms. Allocated memory was 763.4MB in the beginning and 637.5MB in the end (delta: -125.8MB). Free memory was 262.6MB in the beginning and 372.7MB in the end (delta: -110.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:30:30,711 INFO L158 Benchmark]: Witness Printer took 4.05ms. Allocated memory is still 637.5MB. Free memory was 372.7MB in the beginning and 372.7MB in the end (delta: 34.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:30:30,713 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.23ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 601.94ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 78.1MB in the end (delta: 24.7MB). Peak memory consumption was 97.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 435.03ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 78.1MB in the beginning and 230.9MB in the end (delta: -152.8MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 358.65ms. Allocated memory is still 369.1MB. Free memory was 230.9MB in the beginning and 193.6MB in the end (delta: 37.3MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. * IcfgBuilder took 4282.18ms. Allocated memory was 369.1MB in the beginning and 763.4MB in the end (delta: 394.3MB). Free memory was 193.6MB in the beginning and 262.6MB in the end (delta: -69.0MB). Peak memory consumption was 353.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11720.97ms. Allocated memory was 763.4MB in the beginning and 637.5MB in the end (delta: -125.8MB). Free memory was 262.6MB in the beginning and 372.7MB in the end (delta: -110.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.05ms. Allocated memory is still 637.5MB. Free memory was 372.7MB in the beginning and 372.7MB in the end (delta: 34.7kB). 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 228. 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_22 mask_SORT_22 = (SORT_22)-1 >> (sizeof(SORT_22) * 8 - 3); [L36] const SORT_22 msb_SORT_22 = (SORT_22)1 << (3 - 1); [L38] const SORT_310 mask_SORT_310 = (SORT_310)-1 >> (sizeof(SORT_310) * 8 - 2); [L39] const SORT_310 msb_SORT_310 = (SORT_310)1 << (2 - 1); [L41] const SORT_314 mask_SORT_314 = (SORT_314)-1 >> (sizeof(SORT_314) * 8 - 5); [L42] const SORT_314 msb_SORT_314 = (SORT_314)1 << (5 - 1); [L44] const SORT_316 mask_SORT_316 = (SORT_316)-1 >> (sizeof(SORT_316) * 8 - 6); [L45] const SORT_316 msb_SORT_316 = (SORT_316)1 << (6 - 1); [L47] const SORT_318 mask_SORT_318 = (SORT_318)-1 >> (sizeof(SORT_318) * 8 - 7); [L48] const SORT_318 msb_SORT_318 = (SORT_318)1 << (7 - 1); [L50] const SORT_320 mask_SORT_320 = (SORT_320)-1 >> (sizeof(SORT_320) * 8 - 8); [L51] const SORT_320 msb_SORT_320 = (SORT_320)1 << (8 - 1); [L53] const SORT_322 mask_SORT_322 = (SORT_322)-1 >> (sizeof(SORT_322) * 8 - 9); [L54] const SORT_322 msb_SORT_322 = (SORT_322)1 << (9 - 1); [L56] const SORT_324 mask_SORT_324 = (SORT_324)-1 >> (sizeof(SORT_324) * 8 - 10); [L57] const SORT_324 msb_SORT_324 = (SORT_324)1 << (10 - 1); [L59] const SORT_326 mask_SORT_326 = (SORT_326)-1 >> (sizeof(SORT_326) * 8 - 11); [L60] const SORT_326 msb_SORT_326 = (SORT_326)1 << (11 - 1); [L62] const SORT_8 var_18 = 0; [L63] const SORT_22 var_23 = 0; [L64] const SORT_22 var_26 = 4; [L65] const SORT_22 var_29 = 5; [L66] const SORT_1 var_32 = 0; [L67] const SORT_1 var_35 = 2730; [L68] const SORT_8 var_42 = 1; [L69] const SORT_13 var_65 = 2; [L70] const SORT_13 var_70 = 9; [L71] const SORT_13 var_78 = 15; [L72] const SORT_13 var_83 = 1; [L73] const SORT_13 var_85 = 3; [L74] const SORT_13 var_88 = 5; [L75] const SORT_13 var_91 = 7; [L76] const SORT_13 var_94 = 11; [L77] const SORT_13 var_118 = 8; [L78] const SORT_13 var_122 = 10; [L79] const SORT_13 var_126 = 13; [L80] const SORT_13 var_137 = 4; [L81] const SORT_13 var_139 = 12; [L82] const SORT_13 var_142 = 14; [L83] const SORT_13 var_148 = 6; [L84] const SORT_13 var_175 = 0; [L85] const SORT_22 var_221 = 1; [L86] const SORT_1 var_250 = 4095; [L87] const SORT_1 var_580 = 1; [L88] const SORT_326 var_598 = 0; [L90] SORT_1 input_2; [L91] SORT_1 input_3; [L92] SORT_1 input_4; [L93] SORT_1 input_5; [L94] SORT_1 input_6; [L95] SORT_1 input_7; [L96] SORT_8 input_9; [L97] SORT_8 input_10; [L98] SORT_8 input_11; [L99] SORT_1 input_12; [L100] SORT_13 input_14; [L101] SORT_8 input_15; [L102] SORT_8 input_16; [L103] SORT_8 input_17; [L104] SORT_1 input_217; [L105] SORT_1 input_237; [L106] SORT_22 input_240; [L108] EXPR __VERIFIER_nondet_uchar() & mask_SORT_8 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L108] SORT_8 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_8; [L109] EXPR __VERIFIER_nondet_uchar() & mask_SORT_22 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L109] SORT_22 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_22; [L110] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L110] SORT_1 state_33 = __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_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L111] SORT_1 state_38 = __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_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L112] SORT_1 state_40 = __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_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L113] SORT_1 state_44 = __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_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L114] SORT_1 state_46 = __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_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L115] SORT_1 state_50 = __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_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L116] SORT_1 state_52 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L117] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L117] SORT_1 state_67 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L118] EXPR __VERIFIER_nondet_uchar() & mask_SORT_22 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L118] SORT_22 state_106 = __VERIFIER_nondet_uchar() & mask_SORT_22; [L119] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L119] SORT_1 state_135 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L121] SORT_8 init_20_arg_1 = var_18; [L122] state_19 = init_20_arg_1 [L123] SORT_22 init_25_arg_1 = var_23; [L124] state_24 = init_25_arg_1 [L125] SORT_1 init_34_arg_1 = var_32; [L126] state_33 = init_34_arg_1 [L127] SORT_1 init_39_arg_1 = var_32; [L128] state_38 = init_39_arg_1 [L129] SORT_1 init_41_arg_1 = var_32; [L130] state_40 = init_41_arg_1 [L131] SORT_1 init_45_arg_1 = var_32; [L132] state_44 = init_45_arg_1 [L133] SORT_1 init_47_arg_1 = var_32; [L134] state_46 = init_47_arg_1 [L135] SORT_1 init_51_arg_1 = var_32; [L136] state_50 = init_51_arg_1 [L137] SORT_1 init_53_arg_1 = var_32; [L138] state_52 = init_53_arg_1 [L139] SORT_1 init_68_arg_1 = var_32; [L140] state_67 = init_68_arg_1 [L141] SORT_22 init_107_arg_1 = var_23; [L142] state_106 = init_107_arg_1 [L143] SORT_1 init_136_arg_1 = var_32; [L144] state_135 = init_136_arg_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_19=0, state_24=0, state_33=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L147] input_2 = __VERIFIER_nondet_ushort() [L148] input_3 = __VERIFIER_nondet_ushort() [L149] input_4 = __VERIFIER_nondet_ushort() [L150] input_5 = __VERIFIER_nondet_ushort() [L151] input_6 = __VERIFIER_nondet_ushort() [L152] input_7 = __VERIFIER_nondet_ushort() [L153] input_9 = __VERIFIER_nondet_uchar() [L154] input_10 = __VERIFIER_nondet_uchar() [L155] input_11 = __VERIFIER_nondet_uchar() [L156] EXPR input_11 & mask_SORT_8 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_19=0, state_24=0, state_33=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L156] input_11 = input_11 & mask_SORT_8 [L157] input_12 = __VERIFIER_nondet_ushort() [L158] input_14 = __VERIFIER_nondet_uchar() [L159] EXPR input_14 & mask_SORT_13 VAL [input_11=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_19=0, state_24=0, state_33=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L159] input_14 = input_14 & mask_SORT_13 [L160] input_15 = __VERIFIER_nondet_uchar() [L161] input_16 = __VERIFIER_nondet_uchar() [L162] input_17 = __VERIFIER_nondet_uchar() [L163] input_217 = __VERIFIER_nondet_ushort() [L164] input_237 = __VERIFIER_nondet_ushort() [L165] input_240 = __VERIFIER_nondet_uchar() [L168] SORT_8 var_21_arg_0 = state_19; [L169] SORT_8 var_21_arg_1 = var_18; [L170] SORT_8 var_21 = var_21_arg_0 == var_21_arg_1; [L171] SORT_22 var_27_arg_0 = state_24; [L172] SORT_22 var_27_arg_1 = var_26; [L173] SORT_8 var_27 = var_27_arg_0 == var_27_arg_1; [L174] SORT_8 var_28_arg_0 = var_21; [L175] SORT_8 var_28_arg_1 = var_27; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_24=0, state_33=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_28_arg_0=1, var_28_arg_1=0, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L176] EXPR var_28_arg_0 | var_28_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_24=0, state_33=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L176] SORT_8 var_28 = var_28_arg_0 | var_28_arg_1; [L177] SORT_22 var_30_arg_0 = state_24; [L178] SORT_22 var_30_arg_1 = var_29; [L179] SORT_8 var_30 = var_30_arg_0 == var_30_arg_1; [L180] SORT_8 var_31_arg_0 = var_28; [L181] SORT_8 var_31_arg_1 = var_30; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_33=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_31_arg_0=1, var_31_arg_1=0, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L182] EXPR var_31_arg_0 | var_31_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_33=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L182] SORT_8 var_31 = var_31_arg_0 | var_31_arg_1; [L183] SORT_1 var_36_arg_0 = state_33; [L184] SORT_1 var_36_arg_1 = var_35; [L185] SORT_8 var_36 = var_36_arg_0 != var_36_arg_1; [L186] SORT_8 var_37_arg_0 = var_31; [L187] SORT_8 var_37_arg_1 = var_36; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_37_arg_0=1, var_37_arg_1=1, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L188] EXPR var_37_arg_0 | var_37_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L188] SORT_8 var_37 = var_37_arg_0 | var_37_arg_1; [L189] SORT_8 var_55_arg_0 = var_42; [L190] SORT_1 var_55_arg_1 = input_7; [L191] SORT_1 var_55_arg_2 = input_6; [L192] SORT_1 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L193] SORT_8 var_54_arg_0 = var_42; [L194] SORT_1 var_54_arg_1 = state_52; [L195] SORT_1 var_54_arg_2 = state_50; [L196] SORT_1 var_54 = var_54_arg_0 ? var_54_arg_1 : var_54_arg_2; [L197] SORT_8 var_56_arg_0 = var_18; [L198] SORT_1 var_56_arg_1 = var_55; [L199] SORT_1 var_56_arg_2 = var_54; [L200] SORT_1 var_56 = var_56_arg_0 ? var_56_arg_1 : var_56_arg_2; [L201] SORT_8 var_48_arg_0 = var_42; [L202] SORT_1 var_48_arg_1 = state_46; [L203] SORT_1 var_48_arg_2 = state_44; [L204] SORT_1 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L205] SORT_8 var_43_arg_0 = var_42; [L206] SORT_1 var_43_arg_1 = state_40; [L207] SORT_1 var_43_arg_2 = state_38; [L208] SORT_1 var_43 = var_43_arg_0 ? var_43_arg_1 : var_43_arg_2; [L209] SORT_8 var_49_arg_0 = var_18; [L210] SORT_1 var_49_arg_1 = var_48; [L211] SORT_1 var_49_arg_2 = var_43; [L212] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L213] SORT_8 var_57_arg_0 = var_42; [L214] SORT_1 var_57_arg_1 = var_56; [L215] SORT_1 var_57_arg_2 = var_49; [L216] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_37=1, var_42=1, var_57=0, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L217] EXPR var_57 & mask_SORT_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_37=1, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L217] var_57 = var_57 & mask_SORT_1 [L218] SORT_1 var_58_arg_0 = var_57; [L219] SORT_1 var_58_arg_1 = var_35; [L220] SORT_8 var_58 = var_58_arg_0 == var_58_arg_1; [L221] SORT_8 var_59_arg_0 = var_37; [L222] SORT_8 var_59_arg_1 = var_58; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_59_arg_0=1, var_59_arg_1=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L223] EXPR var_59_arg_0 | var_59_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L223] SORT_8 var_59 = var_59_arg_0 | var_59_arg_1; [L224] SORT_8 var_62_arg_0 = var_59; [L225] SORT_8 var_62 = ~var_62_arg_0; [L226] SORT_8 var_63_arg_0 = var_42; [L227] SORT_8 var_63_arg_1 = var_62; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_63_arg_0=1, var_63_arg_1=-2, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L228] EXPR var_63_arg_0 & var_63_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L228] SORT_8 var_63 = var_63_arg_0 & var_63_arg_1; [L229] EXPR var_63 & mask_SORT_8 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L229] var_63 = var_63 & mask_SORT_8 [L230] SORT_8 bad_64_arg_0 = var_63; [L231] CALL __VERIFIER_assert(!(bad_64_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1534 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13825 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13825 mSDsluCounter, 68369 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53154 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14235 IncrementalHoareTripleChecker+Invalid, 14242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 15215 mSDtfsCounter, 14235 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1573occurred in iteration=8, InterpolantAutomatonStates: 54, 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, 8 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 454 NumberOfCodeBlocks, 454 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 393 ConstructedInterpolants, 0 QuantifiedInterpolants, 2080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:30,733 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_p4.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 71117c9c67f985d05d0c9859b116d512376f478c1182a53aad610245b01d40e1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:30:32,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:30:32,673 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:32,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:30:32,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:30:32,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:30:32,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:30:32,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:30:32,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:30:32,705 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:30:32,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:30:32,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:30:32,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:30:32,705 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:30:32,706 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:30:32,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:30:32,706 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:30:32,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:30:32,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:30:32,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:30:32,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:30:32,707 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:30:32,707 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:30:32,707 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:30:32,707 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:30:32,707 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:30:32,707 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:30:32,708 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:30:32,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:30:32,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:30:32,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:30:32,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:30:32,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:30:32,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:30:32,708 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:30:32,709 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:30:32,709 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:30:32,709 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:30:32,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:30:32,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:30:32,710 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:30:32,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:30:32,710 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 -> 71117c9c67f985d05d0c9859b116d512376f478c1182a53aad610245b01d40e1 [2025-03-03 18:30:32,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:30:32,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:30:32,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:30:32,952 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:30:32,952 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:30:32,953 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_p4.c [2025-03-03 18:30:34,119 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e23f137a/196576813cef4592bfa7f95206ad1b7f/FLAG72c0c8389 [2025-03-03 18:30:34,348 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:30:34,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p4.c [2025-03-03 18:30:34,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e23f137a/196576813cef4592bfa7f95206ad1b7f/FLAG72c0c8389 [2025-03-03 18:30:34,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e23f137a/196576813cef4592bfa7f95206ad1b7f [2025-03-03 18:30:34,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:30:34,683 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:30:34,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:30:34,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:30:34,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:30:34,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:30:34" (1/1) ... [2025-03-03 18:30:34,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44070e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:34, skipping insertion in model container [2025-03-03 18:30:34,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:30:34" (1/1) ... [2025-03-03 18:30:34,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:30:34,872 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_p4.c[1260,1273] [2025-03-03 18:30:35,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:30:35,103 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:30:35,110 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_p4.c[1260,1273] [2025-03-03 18:30:35,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:30:35,240 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:30:35,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:35 WrapperNode [2025-03-03 18:30:35,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:30:35,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:30:35,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:30:35,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:30:35,248 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:35" (1/1) ... [2025-03-03 18:30:35,276 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:35" (1/1) ... [2025-03-03 18:30:35,367 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1851 [2025-03-03 18:30:35,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:30:35,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:30:35,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:30:35,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:30:35,374 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:35" (1/1) ... [2025-03-03 18:30:35,375 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:35" (1/1) ... [2025-03-03 18:30:35,393 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:35" (1/1) ... [2025-03-03 18:30:35,435 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:35,435 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:35" (1/1) ... [2025-03-03 18:30:35,436 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:35" (1/1) ... [2025-03-03 18:30:35,469 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:35" (1/1) ... [2025-03-03 18:30:35,473 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:35" (1/1) ... [2025-03-03 18:30:35,477 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:35" (1/1) ... [2025-03-03 18:30:35,486 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:35" (1/1) ... [2025-03-03 18:30:35,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:30:35,504 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:30:35,504 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:30:35,504 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:30:35,505 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:35" (1/1) ... [2025-03-03 18:30:35,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:30:35,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:30:35,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:35,536 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:35,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:30:35,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:30:35,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:30:35,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:30:35,889 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:30:35,891 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:30:37,263 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-03-03 18:30:37,263 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:30:37,270 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:30:37,270 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:30:37,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:30:37 BoogieIcfgContainer [2025-03-03 18:30:37,270 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:30:37,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:30:37,272 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:30:37,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:30:37,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:30:34" (1/3) ... [2025-03-03 18:30:37,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46438140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:30:37, skipping insertion in model container [2025-03-03 18:30:37,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:35" (2/3) ... [2025-03-03 18:30:37,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46438140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:30:37, skipping insertion in model container [2025-03-03 18:30:37,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:30:37" (3/3) ... [2025-03-03 18:30:37,278 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p4.c [2025-03-03 18:30:37,287 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:30:37,289 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_am2910_p4.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:30:37,322 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:30:37,329 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;@1080223c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:30:37,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:30:37,331 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:37,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 18:30:37,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:37,336 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 18:30:37,336 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:37,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:37,340 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 18:30:37,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:30:37,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1990030608] [2025-03-03 18:30:37,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:37,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:30:37,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:30:37,350 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:37,351 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:37,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 18:30:37,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 18:30:37,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:37,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:37,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 18:30:37,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:30:37,831 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:37,832 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:30:37,832 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:30:37,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990030608] [2025-03-03 18:30:37,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990030608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:37,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:37,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:30:37,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508218773] [2025-03-03 18:30:37,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:37,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:30:37,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:30:37,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:30:37,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:30:37,854 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:37,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:37,971 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-03-03 18:30:37,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:30:37,974 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:37,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:37,978 INFO L225 Difference]: With dead ends: 17 [2025-03-03 18:30:37,978 INFO L226 Difference]: Without dead ends: 9 [2025-03-03 18:30:37,980 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:37,983 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:37,984 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:37,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-03 18:30:37,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-03 18:30:38,000 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:38,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 18:30:38,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 18:30:38,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:38,005 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 18:30:38,006 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:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 18:30:38,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 18:30:38,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:38,006 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:38,014 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:38,206 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:38,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:38,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:38,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 18:30:38,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:30:38,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1283991065] [2025-03-03 18:30:38,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:38,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:30:38,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:30:38,211 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:38,213 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:38,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 18:30:38,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 18:30:38,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:38,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:38,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 18:30:38,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:30:38,848 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:38,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:30:39,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:39,614 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:30:39,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283991065] [2025-03-03 18:30:39,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283991065] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:30:39,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:30:39,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-03 18:30:39,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113648843] [2025-03-03 18:30:39,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 18:30:39,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:30:39,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:30:39,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:30:39,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:30:39,616 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:39,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:39,844 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-03 18:30:39,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:30:39,845 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:39,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:39,845 INFO L225 Difference]: With dead ends: 14 [2025-03-03 18:30:39,845 INFO L226 Difference]: Without dead ends: 12 [2025-03-03 18:30:39,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:30:39,846 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:39,846 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:39,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-03 18:30:39,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-03 18:30:39,847 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:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-03 18:30:39,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-03-03 18:30:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:39,848 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-03 18:30:39,848 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:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-03 18:30:39,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 18:30:39,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:39,848 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-03 18:30:39,856 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:40,048 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:40,049 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:40,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:40,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-03-03 18:30:40,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:30:40,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2147016351] [2025-03-03 18:30:40,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 18:30:40,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:30:40,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:30:40,054 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:40,056 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:40,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-03 18:30:40,608 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:40,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 18:30:40,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:40,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-03 18:30:40,642 INFO L279 TraceCheckSpWp]: Computing forward predicates...