./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul10.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.mul10.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 37bf2f4a0d13654afdfd5cdecda47a5234857be125596f55f94b7f56efc2af18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:52:14,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:52:14,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:52:14,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:52:14,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:52:14,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:52:14,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:52:14,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:52:14,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:52:14,633 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:52:14,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:52:14,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:52:14,633 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:52:14,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:52:14,633 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:52:14,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:52:14,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:52:14,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:52:14,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:52:14,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:52:14,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:52:14,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:52:14,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:52:14,634 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:52:14,634 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:52:14,634 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:52:14,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:52:14,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:52:14,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:52:14,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:52:14,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:52:14,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:52:14,634 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:52:14,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:52:14,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:52:14,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:52:14,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:52:14,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:52:14,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:52:14,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:52:14,634 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 -> 37bf2f4a0d13654afdfd5cdecda47a5234857be125596f55f94b7f56efc2af18 [2025-03-03 17:52:14,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:52:14,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:52:14,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:52:14,845 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:52:14,846 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:52:14,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul10.c [2025-03-03 17:52:15,944 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6186d3be5/bde824f5bae04ed09ed96027120c4c58/FLAGb09c6d4c0 [2025-03-03 17:52:16,243 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:52:16,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul10.c [2025-03-03 17:52:16,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6186d3be5/bde824f5bae04ed09ed96027120c4c58/FLAGb09c6d4c0 [2025-03-03 17:52:16,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6186d3be5/bde824f5bae04ed09ed96027120c4c58 [2025-03-03 17:52:16,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:52:16,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:52:16,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:52:16,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:52:16,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:52:16,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:52:16" (1/1) ... [2025-03-03 17:52:16,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368dfe1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:16, skipping insertion in model container [2025-03-03 17:52:16,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:52:16" (1/1) ... [2025-03-03 17:52:16,549 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:52:16,646 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.mul10.c[1245,1258] [2025-03-03 17:52:16,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:52:16,767 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:52:16,773 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.mul10.c[1245,1258] [2025-03-03 17:52:16,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:52:16,870 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:52:16,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:16 WrapperNode [2025-03-03 17:52:16,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:52:16,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:52:16,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:52:16,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:52:16,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:16" (1/1) ... [2025-03-03 17:52:16,900 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:16" (1/1) ... [2025-03-03 17:52:17,008 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1762 [2025-03-03 17:52:17,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:52:17,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:52:17,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:52:17,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:52:17,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:16" (1/1) ... [2025-03-03 17:52:17,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:16" (1/1) ... [2025-03-03 17:52:17,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:16" (1/1) ... [2025-03-03 17:52:17,095 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-03 17:52:17,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:16" (1/1) ... [2025-03-03 17:52:17,096 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:16" (1/1) ... [2025-03-03 17:52:17,133 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:16" (1/1) ... [2025-03-03 17:52:17,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:16" (1/1) ... [2025-03-03 17:52:17,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:16" (1/1) ... [2025-03-03 17:52:17,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:16" (1/1) ... [2025-03-03 17:52:17,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:52:17,189 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:52:17,190 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:52:17,190 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:52:17,191 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:16" (1/1) ... [2025-03-03 17:52:17,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:52:17,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:52:17,217 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 17:52:17,250 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 17:52:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:52:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:52:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 17:52:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:52:17,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:52:17,438 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:52:17,439 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:52:18,839 INFO L? ?]: Removed 896 outVars from TransFormulas that were not future-live. [2025-03-03 17:52:18,839 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:52:18,911 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:52:18,912 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:52:18,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:52:18 BoogieIcfgContainer [2025-03-03 17:52:18,912 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:52:18,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:52:18,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:52:18,921 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:52:18,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:52:16" (1/3) ... [2025-03-03 17:52:18,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44399f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:52:18, skipping insertion in model container [2025-03-03 17:52:18,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:16" (2/3) ... [2025-03-03 17:52:18,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44399f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:52:18, skipping insertion in model container [2025-03-03 17:52:18,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:52:18" (3/3) ... [2025-03-03 17:52:18,923 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul10.c [2025-03-03 17:52:18,932 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:52:18,934 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul10.c that has 1 procedures, 523 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:52:18,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:52:18,995 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;@14f90bff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:52:18,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:52:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 523 states, 521 states have (on average 1.510556621880998) internal successors, (787), 522 states have internal predecessors, (787), 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 17:52:19,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 17:52:19,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:19,006 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:52:19,006 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:19,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:19,010 INFO L85 PathProgramCache]: Analyzing trace with hash 680184206, now seen corresponding path program 1 times [2025-03-03 17:52:19,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:19,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878642346] [2025-03-03 17:52:19,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:19,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:19,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 17:52:19,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 17:52:19,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:19,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:19,775 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 17:52:19,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:52:19,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878642346] [2025-03-03 17:52:19,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878642346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:19,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:19,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:52:19,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71184008] [2025-03-03 17:52:19,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:19,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:52:19,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:52:19,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:52:19,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:52:19,801 INFO L87 Difference]: Start difference. First operand has 523 states, 521 states have (on average 1.510556621880998) internal successors, (787), 522 states have internal predecessors, (787), 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 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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 17:52:20,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:20,136 INFO L93 Difference]: Finished difference Result 927 states and 1399 transitions. [2025-03-03 17:52:20,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:52:20,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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 95 [2025-03-03 17:52:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:20,144 INFO L225 Difference]: With dead ends: 927 [2025-03-03 17:52:20,144 INFO L226 Difference]: Without dead ends: 522 [2025-03-03 17:52:20,147 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 17:52:20,148 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 0 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:20,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1963 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:52:20,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-03 17:52:20,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-03-03 17:52:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 1.506717850287908) internal successors, (785), 521 states have internal predecessors, (785), 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 17:52:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 785 transitions. [2025-03-03 17:52:20,190 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 785 transitions. Word has length 95 [2025-03-03 17:52:20,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:20,191 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 785 transitions. [2025-03-03 17:52:20,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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 17:52:20,192 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 785 transitions. [2025-03-03 17:52:20,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 17:52:20,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:20,194 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:52:20,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:52:20,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:20,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:20,195 INFO L85 PathProgramCache]: Analyzing trace with hash -384446363, now seen corresponding path program 1 times [2025-03-03 17:52:20,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:20,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112748832] [2025-03-03 17:52:20,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:20,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:20,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 17:52:20,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 17:52:20,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:20,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:20,448 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 17:52:20,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:52:20,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112748832] [2025-03-03 17:52:20,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112748832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:20,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:20,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:52:20,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010491602] [2025-03-03 17:52:20,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:20,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:52:20,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:52:20,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:52:20,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:52:20,451 INFO L87 Difference]: Start difference. First operand 522 states and 785 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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 17:52:20,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:20,685 INFO L93 Difference]: Finished difference Result 928 states and 1397 transitions. [2025-03-03 17:52:20,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:52:20,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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 96 [2025-03-03 17:52:20,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:20,688 INFO L225 Difference]: With dead ends: 928 [2025-03-03 17:52:20,688 INFO L226 Difference]: Without dead ends: 524 [2025-03-03 17:52:20,689 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 17:52:20,690 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 0 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:20,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1960 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:52:20,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-03 17:52:20,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-03-03 17:52:20,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 1.5047801147227533) internal successors, (787), 523 states have internal predecessors, (787), 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 17:52:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 787 transitions. [2025-03-03 17:52:20,705 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 787 transitions. Word has length 96 [2025-03-03 17:52:20,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:20,705 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 787 transitions. [2025-03-03 17:52:20,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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 17:52:20,705 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 787 transitions. [2025-03-03 17:52:20,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 17:52:20,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:20,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:52:20,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:52:20,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:20,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:20,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1396392855, now seen corresponding path program 1 times [2025-03-03 17:52:20,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:20,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284842801] [2025-03-03 17:52:20,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:20,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:20,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 17:52:20,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 17:52:20,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:20,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:21,050 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 17:52:21,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:52:21,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284842801] [2025-03-03 17:52:21,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284842801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:21,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:21,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:52:21,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888996232] [2025-03-03 17:52:21,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:21,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:52:21,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:52:21,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:52:21,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:52:21,051 INFO L87 Difference]: Start difference. First operand 524 states and 787 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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 17:52:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:21,331 INFO L93 Difference]: Finished difference Result 934 states and 1404 transitions. [2025-03-03 17:52:21,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:52:21,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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 97 [2025-03-03 17:52:21,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:21,334 INFO L225 Difference]: With dead ends: 934 [2025-03-03 17:52:21,334 INFO L226 Difference]: Without dead ends: 528 [2025-03-03 17:52:21,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:52:21,335 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 700 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:21,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1931 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:52:21,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-03 17:52:21,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 527. [2025-03-03 17:52:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.5019011406844107) internal successors, (790), 526 states have internal predecessors, (790), 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 17:52:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 790 transitions. [2025-03-03 17:52:21,354 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 790 transitions. Word has length 97 [2025-03-03 17:52:21,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:21,354 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 790 transitions. [2025-03-03 17:52:21,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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 17:52:21,355 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 790 transitions. [2025-03-03 17:52:21,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 17:52:21,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:21,360 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:52:21,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:52:21,360 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:21,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:21,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1413585100, now seen corresponding path program 1 times [2025-03-03 17:52:21,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:21,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076403509] [2025-03-03 17:52:21,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:21,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:21,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 17:52:21,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 17:52:21,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:21,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:22,327 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 17:52:22,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:52:22,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076403509] [2025-03-03 17:52:22,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076403509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:22,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:22,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 17:52:22,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441191944] [2025-03-03 17:52:22,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:22,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:52:22,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:52:22,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:52:22,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:52:22,331 INFO L87 Difference]: Start difference. First operand 527 states and 790 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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 17:52:22,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:22,685 INFO L93 Difference]: Finished difference Result 959 states and 1437 transitions. [2025-03-03 17:52:22,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:52:22,686 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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 98 [2025-03-03 17:52:22,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:22,688 INFO L225 Difference]: With dead ends: 959 [2025-03-03 17:52:22,688 INFO L226 Difference]: Without dead ends: 550 [2025-03-03 17:52:22,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:52:22,690 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 24 mSDsluCounter, 2604 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3255 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:22,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3255 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:52:22,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-03 17:52:22,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 535. [2025-03-03 17:52:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.5) internal successors, (801), 534 states have internal predecessors, (801), 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 17:52:22,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 801 transitions. [2025-03-03 17:52:22,699 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 801 transitions. Word has length 98 [2025-03-03 17:52:22,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:22,699 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 801 transitions. [2025-03-03 17:52:22,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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 17:52:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 801 transitions. [2025-03-03 17:52:22,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 17:52:22,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:22,700 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:52:22,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:52:22,701 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:22,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:22,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1012503699, now seen corresponding path program 1 times [2025-03-03 17:52:22,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:22,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889686524] [2025-03-03 17:52:22,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:22,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:22,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 17:52:22,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 17:52:22,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:22,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:23,071 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 17:52:23,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:52:23,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889686524] [2025-03-03 17:52:23,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889686524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:23,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:23,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:52:23,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172230910] [2025-03-03 17:52:23,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:23,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:52:23,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:52:23,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:52:23,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:52:23,074 INFO L87 Difference]: Start difference. First operand 535 states and 801 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 17:52:23,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:23,353 INFO L93 Difference]: Finished difference Result 1203 states and 1802 transitions. [2025-03-03 17:52:23,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:52:23,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 99 [2025-03-03 17:52:23,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:23,357 INFO L225 Difference]: With dead ends: 1203 [2025-03-03 17:52:23,357 INFO L226 Difference]: Without dead ends: 786 [2025-03-03 17:52:23,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:52:23,360 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 1408 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1408 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:23,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1408 Valid, 1950 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:52:23,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-03-03 17:52:23,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 567. [2025-03-03 17:52:23,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 566 states have (on average 1.4964664310954063) internal successors, (847), 566 states have internal predecessors, (847), 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 17:52:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 847 transitions. [2025-03-03 17:52:23,370 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 847 transitions. Word has length 99 [2025-03-03 17:52:23,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:23,370 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 847 transitions. [2025-03-03 17:52:23,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 17:52:23,370 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 847 transitions. [2025-03-03 17:52:23,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 17:52:23,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:23,371 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:52:23,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:52:23,371 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:23,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:23,371 INFO L85 PathProgramCache]: Analyzing trace with hash -175594313, now seen corresponding path program 1 times [2025-03-03 17:52:23,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:23,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352241400] [2025-03-03 17:52:23,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:23,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:23,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 17:52:23,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 17:52:23,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:23,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:23,686 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 17:52:23,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:52:23,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352241400] [2025-03-03 17:52:23,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352241400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:23,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:23,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:52:23,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073064049] [2025-03-03 17:52:23,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:23,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:52:23,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:52:23,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:52:23,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:52:23,690 INFO L87 Difference]: Start difference. First operand 567 states and 847 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 17:52:24,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:24,006 INFO L93 Difference]: Finished difference Result 1213 states and 1815 transitions. [2025-03-03 17:52:24,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:52:24,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 99 [2025-03-03 17:52:24,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:24,010 INFO L225 Difference]: With dead ends: 1213 [2025-03-03 17:52:24,011 INFO L226 Difference]: Without dead ends: 796 [2025-03-03 17:52:24,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:52:24,013 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 1428 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:24,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1428 Valid, 1944 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:52:24,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-03-03 17:52:24,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 577. [2025-03-03 17:52:24,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 1.4930555555555556) internal successors, (860), 576 states have internal predecessors, (860), 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 17:52:24,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 860 transitions. [2025-03-03 17:52:24,030 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 860 transitions. Word has length 99 [2025-03-03 17:52:24,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:24,030 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 860 transitions. [2025-03-03 17:52:24,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 17:52:24,030 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 860 transitions. [2025-03-03 17:52:24,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 17:52:24,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:24,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:52:24,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:52:24,031 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:24,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:24,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1612885308, now seen corresponding path program 1 times [2025-03-03 17:52:24,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:24,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665817906] [2025-03-03 17:52:24,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:24,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:24,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 17:52:24,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 17:52:24,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:24,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:24,559 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 17:52:24,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:52:24,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665817906] [2025-03-03 17:52:24,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665817906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:24,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:24,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:52:24,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987558614] [2025-03-03 17:52:24,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:24,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:52:24,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:52:24,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:52:24,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:52:24,561 INFO L87 Difference]: Start difference. First operand 577 states and 860 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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 17:52:24,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:24,979 INFO L93 Difference]: Finished difference Result 1012 states and 1511 transitions. [2025-03-03 17:52:24,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:52:24,979 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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 99 [2025-03-03 17:52:24,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:24,981 INFO L225 Difference]: With dead ends: 1012 [2025-03-03 17:52:24,981 INFO L226 Difference]: Without dead ends: 595 [2025-03-03 17:52:24,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:52:24,982 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 17 mSDsluCounter, 3245 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3895 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:24,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3895 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:52:24,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-03 17:52:24,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 583. [2025-03-03 17:52:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 582 states have (on average 1.4914089347079038) internal successors, (868), 582 states have internal predecessors, (868), 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 17:52:24,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 868 transitions. [2025-03-03 17:52:24,992 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 868 transitions. Word has length 99 [2025-03-03 17:52:24,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:24,992 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 868 transitions. [2025-03-03 17:52:24,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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 17:52:24,993 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 868 transitions. [2025-03-03 17:52:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 17:52:24,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:24,993 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:52:24,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:52:24,994 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:24,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:24,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1749157754, now seen corresponding path program 1 times [2025-03-03 17:52:24,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:24,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208547024] [2025-03-03 17:52:24,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:24,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:25,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 17:52:25,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 17:52:25,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:25,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:25,436 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 17:52:25,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:52:25,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208547024] [2025-03-03 17:52:25,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208547024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:25,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:25,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:52:25,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603073443] [2025-03-03 17:52:25,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:25,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:52:25,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:52:25,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:52:25,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:52:25,437 INFO L87 Difference]: Start difference. First operand 583 states and 868 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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 17:52:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:25,972 INFO L93 Difference]: Finished difference Result 1004 states and 1499 transitions. [2025-03-03 17:52:25,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:52:25,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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 99 [2025-03-03 17:52:25,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:25,974 INFO L225 Difference]: With dead ends: 1004 [2025-03-03 17:52:25,975 INFO L226 Difference]: Without dead ends: 581 [2025-03-03 17:52:25,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:52:25,976 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 702 mSDsluCounter, 3780 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 4414 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:25,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 4414 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:52:25,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-03 17:52:25,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 578. [2025-03-03 17:52:25,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 577 states have (on average 1.4922010398613519) internal successors, (861), 577 states have internal predecessors, (861), 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 17:52:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 861 transitions. [2025-03-03 17:52:25,985 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 861 transitions. Word has length 99 [2025-03-03 17:52:25,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:25,985 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 861 transitions. [2025-03-03 17:52:25,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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 17:52:25,985 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 861 transitions. [2025-03-03 17:52:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 17:52:25,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:25,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:52:25,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 17:52:25,986 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:25,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:25,986 INFO L85 PathProgramCache]: Analyzing trace with hash -917591694, now seen corresponding path program 1 times [2025-03-03 17:52:25,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:25,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886020965] [2025-03-03 17:52:25,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:25,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:26,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 17:52:26,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 17:52:26,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:26,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:26,223 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 17:52:26,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:52:26,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886020965] [2025-03-03 17:52:26,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886020965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:26,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:26,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:52:26,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634388201] [2025-03-03 17:52:26,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:26,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:52:26,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:52:26,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:52:26,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:52:26,225 INFO L87 Difference]: Start difference. First operand 578 states and 861 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 17:52:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:26,486 INFO L93 Difference]: Finished difference Result 1170 states and 1746 transitions. [2025-03-03 17:52:26,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:52:26,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 99 [2025-03-03 17:52:26,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:26,488 INFO L225 Difference]: With dead ends: 1170 [2025-03-03 17:52:26,489 INFO L226 Difference]: Without dead ends: 748 [2025-03-03 17:52:26,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:52:26,489 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 1274 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:26,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 1940 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:52:26,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2025-03-03 17:52:26,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 576. [2025-03-03 17:52:26,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 575 states have (on average 1.488695652173913) internal successors, (856), 575 states have internal predecessors, (856), 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 17:52:26,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 856 transitions. [2025-03-03 17:52:26,502 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 856 transitions. Word has length 99 [2025-03-03 17:52:26,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:26,502 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 856 transitions. [2025-03-03 17:52:26,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 17:52:26,503 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 856 transitions. [2025-03-03 17:52:26,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 17:52:26,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:52:26,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 17:52:26,503 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:26,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:26,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2028627288, now seen corresponding path program 1 times [2025-03-03 17:52:26,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:26,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410843476] [2025-03-03 17:52:26,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:26,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:26,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 17:52:26,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 17:52:26,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:26,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:26,757 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 17:52:26,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:52:26,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410843476] [2025-03-03 17:52:26,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410843476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:26,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:26,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:52:26,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811727707] [2025-03-03 17:52:26,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:26,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:52:26,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:52:26,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:52:26,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:52:26,759 INFO L87 Difference]: Start difference. First operand 576 states and 856 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 17:52:27,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:27,074 INFO L93 Difference]: Finished difference Result 994 states and 1482 transitions. [2025-03-03 17:52:27,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:52:27,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 99 [2025-03-03 17:52:27,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:27,077 INFO L225 Difference]: With dead ends: 994 [2025-03-03 17:52:27,077 INFO L226 Difference]: Without dead ends: 568 [2025-03-03 17:52:27,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:52:27,078 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 771 mSDsluCounter, 1924 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 2574 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:27,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 2574 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:52:27,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-03 17:52:27,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2025-03-03 17:52:27,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 567 states have (on average 1.492063492063492) internal successors, (846), 567 states have internal predecessors, (846), 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 17:52:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 846 transitions. [2025-03-03 17:52:27,087 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 846 transitions. Word has length 99 [2025-03-03 17:52:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:27,087 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 846 transitions. [2025-03-03 17:52:27,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 17:52:27,087 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 846 transitions. [2025-03-03 17:52:27,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 17:52:27,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:27,088 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:52:27,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 17:52:27,088 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:27,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:27,088 INFO L85 PathProgramCache]: Analyzing trace with hash -796881775, now seen corresponding path program 1 times [2025-03-03 17:52:27,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:27,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80605684] [2025-03-03 17:52:27,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:27,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:27,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 17:52:27,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 17:52:27,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:27,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:27,286 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 17:52:27,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:52:27,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80605684] [2025-03-03 17:52:27,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80605684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:27,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:27,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:52:27,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184051578] [2025-03-03 17:52:27,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:27,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:52:27,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:52:27,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:52:27,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:52:27,287 INFO L87 Difference]: Start difference. First operand 568 states and 846 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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 17:52:27,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:27,541 INFO L93 Difference]: Finished difference Result 1158 states and 1729 transitions. [2025-03-03 17:52:27,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:52:27,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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 100 [2025-03-03 17:52:27,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:27,544 INFO L225 Difference]: With dead ends: 1158 [2025-03-03 17:52:27,544 INFO L226 Difference]: Without dead ends: 740 [2025-03-03 17:52:27,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:52:27,545 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 988 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:27,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 1941 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:52:27,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2025-03-03 17:52:27,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 576. [2025-03-03 17:52:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 575 states have (on average 1.4869565217391305) internal successors, (855), 575 states have internal predecessors, (855), 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 17:52:27,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 855 transitions. [2025-03-03 17:52:27,555 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 855 transitions. Word has length 100 [2025-03-03 17:52:27,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:27,555 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 855 transitions. [2025-03-03 17:52:27,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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 17:52:27,555 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 855 transitions. [2025-03-03 17:52:27,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 17:52:27,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:27,556 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:52:27,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 17:52:27,556 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:27,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:27,556 INFO L85 PathProgramCache]: Analyzing trace with hash 141406171, now seen corresponding path program 1 times [2025-03-03 17:52:27,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:27,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968946815] [2025-03-03 17:52:27,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:27,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:27,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 17:52:27,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 17:52:27,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:27,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:52:27,597 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 17:52:27,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 17:52:27,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 17:52:27,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:27,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:52:27,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 17:52:27,677 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 17:52:27,678 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:52:27,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 17:52:27,683 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:52:27,739 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:52:27,757 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:52:27,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:52:27 BoogieIcfgContainer [2025-03-03 17:52:27,759 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:52:27,760 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:52:27,760 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:52:27,760 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:52:27,773 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:52:18" (3/4) ... [2025-03-03 17:52:27,775 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 17:52:27,776 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:52:27,786 INFO L158 Benchmark]: Toolchain (without parser) took 11263.05ms. Allocated memory was 167.8MB in the beginning and 494.9MB in the end (delta: 327.2MB). Free memory was 132.4MB in the beginning and 434.6MB in the end (delta: -302.2MB). Peak memory consumption was 307.2MB. Max. memory is 16.1GB. [2025-03-03 17:52:27,786 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:52:27,786 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.59ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 101.3MB in the end (delta: 31.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 17:52:27,786 INFO L158 Benchmark]: Boogie Procedure Inliner took 136.46ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 65.9MB in the end (delta: 35.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 17:52:27,786 INFO L158 Benchmark]: Boogie Preprocessor took 179.63ms. Allocated memory is still 167.8MB. Free memory was 65.9MB in the beginning and 49.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 17:52:27,787 INFO L158 Benchmark]: IcfgBuilder took 1722.76ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 49.1MB in the beginning and 230.1MB in the end (delta: -181.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 17:52:27,788 INFO L158 Benchmark]: TraceAbstraction took 8845.44ms. Allocated memory was 335.5MB in the beginning and 494.9MB in the end (delta: 159.4MB). Free memory was 229.0MB in the beginning and 157.6MB in the end (delta: 71.3MB). Peak memory consumption was 224.6MB. Max. memory is 16.1GB. [2025-03-03 17:52:27,788 INFO L158 Benchmark]: Witness Printer took 15.93ms. Allocated memory is still 494.9MB. Free memory was 157.6MB in the beginning and 434.6MB in the end (delta: -276.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:52:27,791 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.59ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 101.3MB in the end (delta: 31.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 136.46ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 65.9MB in the end (delta: 35.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 179.63ms. Allocated memory is still 167.8MB. Free memory was 65.9MB in the beginning and 49.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1722.76ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 49.1MB in the beginning and 230.1MB in the end (delta: -181.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8845.44ms. Allocated memory was 335.5MB in the beginning and 494.9MB in the end (delta: 159.4MB). Free memory was 229.0MB in the beginning and 157.6MB in the end (delta: 71.3MB). Peak memory consumption was 224.6MB. Max. memory is 16.1GB. * Witness Printer took 15.93ms. Allocated memory is still 494.9MB. Free memory was 157.6MB in the beginning and 434.6MB in the end (delta: -276.9MB). Peak memory consumption was 8.4MB. 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 212. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 32); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (32 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 64); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (64 - 1); [L35] const SORT_215 mask_SORT_215 = (SORT_215)-1 >> (sizeof(SORT_215) * 8 - 4); [L36] const SORT_215 msb_SORT_215 = (SORT_215)1 << (4 - 1); [L38] const SORT_217 mask_SORT_217 = (SORT_217)-1 >> (sizeof(SORT_217) * 8 - 60); [L39] const SORT_217 msb_SORT_217 = (SORT_217)1 << (60 - 1); [L41] const SORT_10 var_11 = 0; [L42] const SORT_1 var_14 = 0; [L43] const SORT_3 var_24 = 0; [L44] const SORT_1 var_51 = 1; [L45] const SORT_3 var_204 = 1; [L46] const SORT_3 var_208 = 3735928559; [L47] const SORT_3 var_211 = 12245771; [L48] const SORT_215 var_216 = 0; [L50] SORT_1 input_2; [L51] SORT_3 input_4; [L52] SORT_3 input_5; [L53] SORT_1 input_6; [L54] SORT_1 input_7; [L55] SORT_1 input_8; [L56] SORT_1 input_9; [L58] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L58] SORT_10 state_12 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L59] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L60] SORT_10 state_18 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L61] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L62] SORT_3 state_25 = __VERIFIER_nondet_uint() & mask_SORT_3; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L63] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L64] SORT_3 state_30 = __VERIFIER_nondet_uint() & mask_SORT_3; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L65] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L66] SORT_3 state_37 = __VERIFIER_nondet_uint() & mask_SORT_3; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L67] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L68] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L68] SORT_3 state_42 = __VERIFIER_nondet_uint() & mask_SORT_3; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L69] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L70] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L71] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L72] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L73] SORT_1 state_67 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L74] SORT_1 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L75] SORT_1 state_71 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L76] SORT_1 state_73 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L77] SORT_1 state_75 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L78] SORT_1 state_77 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L79] SORT_1 state_79 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L80] SORT_1 state_81 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L81] SORT_1 state_83 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L82] SORT_1 state_85 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L83] SORT_1 state_220 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L84] SORT_1 state_251 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L85] SORT_1 state_264 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L86] SORT_1 state_269 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] SORT_10 init_13_arg_1 = var_11; [L89] state_12 = init_13_arg_1 [L90] SORT_1 init_16_arg_1 = var_14; [L91] state_15 = init_16_arg_1 [L92] SORT_10 init_19_arg_1 = var_11; [L93] state_18 = init_19_arg_1 [L94] SORT_1 init_21_arg_1 = var_14; [L95] state_20 = init_21_arg_1 [L96] SORT_3 init_26_arg_1 = var_24; [L97] state_25 = init_26_arg_1 [L98] SORT_1 init_28_arg_1 = var_14; [L99] state_27 = init_28_arg_1 [L100] SORT_3 init_31_arg_1 = var_24; [L101] state_30 = init_31_arg_1 [L102] SORT_1 init_33_arg_1 = var_14; [L103] state_32 = init_33_arg_1 [L104] SORT_3 init_38_arg_1 = var_24; [L105] state_37 = init_38_arg_1 [L106] SORT_1 init_40_arg_1 = var_14; [L107] state_39 = init_40_arg_1 [L108] SORT_3 init_43_arg_1 = var_24; [L109] state_42 = init_43_arg_1 [L110] SORT_1 init_45_arg_1 = var_14; [L111] state_44 = init_45_arg_1 [L112] SORT_1 init_62_arg_1 = var_14; [L113] state_61 = init_62_arg_1 [L114] SORT_1 init_64_arg_1 = var_14; [L115] state_63 = init_64_arg_1 [L116] SORT_1 init_66_arg_1 = var_14; [L117] state_65 = init_66_arg_1 [L118] SORT_1 init_68_arg_1 = var_14; [L119] state_67 = init_68_arg_1 [L120] SORT_1 init_70_arg_1 = var_14; [L121] state_69 = init_70_arg_1 [L122] SORT_1 init_72_arg_1 = var_14; [L123] state_71 = init_72_arg_1 [L124] SORT_1 init_74_arg_1 = var_14; [L125] state_73 = init_74_arg_1 [L126] SORT_1 init_76_arg_1 = var_14; [L127] state_75 = init_76_arg_1 [L128] SORT_1 init_78_arg_1 = var_14; [L129] state_77 = init_78_arg_1 [L130] SORT_1 init_80_arg_1 = var_14; [L131] state_79 = init_80_arg_1 [L132] SORT_1 init_82_arg_1 = var_14; [L133] state_81 = init_82_arg_1 [L134] SORT_1 init_84_arg_1 = var_14; [L135] state_83 = init_84_arg_1 [L136] SORT_1 init_86_arg_1 = var_14; [L137] state_85 = init_86_arg_1 [L138] SORT_1 init_221_arg_1 = var_14; [L139] state_220 = init_221_arg_1 [L140] SORT_1 init_252_arg_1 = var_14; [L141] state_251 = init_252_arg_1 [L142] SORT_1 init_265_arg_1 = var_14; [L143] state_264 = init_265_arg_1 [L144] SORT_1 init_270_arg_1 = var_14; [L145] state_269 = init_270_arg_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L148] input_2 = __VERIFIER_nondet_uchar() [L149] input_4 = __VERIFIER_nondet_uint() [L150] EXPR input_4 & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L150] input_4 = input_4 & mask_SORT_3 [L151] input_5 = __VERIFIER_nondet_uint() [L152] EXPR input_5 & mask_SORT_3 VAL [input_4=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L152] input_5 = input_5 & mask_SORT_3 [L153] input_6 = __VERIFIER_nondet_uchar() [L154] EXPR input_6 & mask_SORT_1 VAL [input_4=0, input_5=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L154] input_6 = input_6 & mask_SORT_1 [L155] input_7 = __VERIFIER_nondet_uchar() [L156] EXPR input_7 & mask_SORT_1 VAL [input_4=0, input_5=0, input_6=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L156] input_7 = input_7 & mask_SORT_1 [L157] input_8 = __VERIFIER_nondet_uchar() [L158] EXPR input_8 & mask_SORT_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L158] input_8 = input_8 & mask_SORT_1 [L159] input_9 = __VERIFIER_nondet_uchar() [L160] EXPR input_9 & mask_SORT_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_12=0, state_15=0, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L160] input_9 = input_9 & mask_SORT_1 [L163] SORT_1 var_17_arg_0 = state_15; [L164] SORT_10 var_17_arg_1 = state_12; [L165] SORT_10 var_17_arg_2 = var_11; [L166] SORT_10 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_17=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L167] EXPR var_17 & mask_SORT_10 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_20=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L167] var_17 = var_17 & mask_SORT_10 [L168] SORT_1 var_22_arg_0 = state_20; [L169] SORT_10 var_22_arg_1 = state_18; [L170] SORT_10 var_22_arg_2 = var_11; [L171] SORT_10 var_22 = var_22_arg_0 ? var_22_arg_1 : var_22_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_17=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_22=0, var_24=0, var_51=1] [L172] EXPR var_22 & mask_SORT_10 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_17=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L172] var_22 = var_22 & mask_SORT_10 [L173] SORT_10 var_23_arg_0 = var_17; [L174] SORT_10 var_23_arg_1 = var_22; [L175] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L176] SORT_1 var_29_arg_0 = state_27; [L177] SORT_3 var_29_arg_1 = state_25; [L178] SORT_3 var_29_arg_2 = var_24; [L179] SORT_3 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_23=1, var_24=0, var_29=0, var_51=1] [L180] EXPR var_29 & mask_SORT_3 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_23=1, var_24=0, var_51=1] [L180] var_29 = var_29 & mask_SORT_3 [L181] SORT_1 var_34_arg_0 = state_32; [L182] SORT_3 var_34_arg_1 = state_30; [L183] SORT_3 var_34_arg_2 = var_24; [L184] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_23=1, var_24=0, var_29=0, var_34=0, var_51=1] [L185] EXPR var_34 & mask_SORT_3 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_23=1, var_24=0, var_29=0, var_51=1] [L185] var_34 = var_34 & mask_SORT_3 [L186] SORT_3 var_35_arg_0 = var_29; [L187] SORT_3 var_35_arg_1 = var_34; [L188] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L189] SORT_1 var_36_arg_0 = var_23; [L190] SORT_1 var_36_arg_1 = var_35; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_36_arg_0=1, var_36_arg_1=1, var_51=1] [L191] EXPR var_36_arg_0 & var_36_arg_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L191] SORT_1 var_36 = var_36_arg_0 & var_36_arg_1; [L192] SORT_1 var_41_arg_0 = state_39; [L193] SORT_3 var_41_arg_1 = state_37; [L194] SORT_3 var_41_arg_2 = var_24; [L195] SORT_3 var_41 = var_41_arg_0 ? var_41_arg_1 : var_41_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_36=1, var_41=0, var_51=1] [L196] EXPR var_41 & mask_SORT_3 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_44=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_36=1, var_51=1] [L196] var_41 = var_41 & mask_SORT_3 [L197] SORT_1 var_46_arg_0 = state_44; [L198] SORT_3 var_46_arg_1 = state_42; [L199] SORT_3 var_46_arg_2 = var_24; [L200] SORT_3 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_36=1, var_41=0, var_46=0, var_51=1] [L201] EXPR var_46 & mask_SORT_3 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_36=1, var_41=0, var_51=1] [L201] var_46 = var_46 & mask_SORT_3 [L202] SORT_3 var_47_arg_0 = var_41; [L203] SORT_3 var_47_arg_1 = var_46; [L204] SORT_1 var_47 = var_47_arg_0 == var_47_arg_1; [L205] SORT_1 var_48_arg_0 = var_36; [L206] SORT_1 var_48_arg_1 = var_47; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_48_arg_0=1, var_48_arg_1=1, var_51=1] [L207] EXPR var_48_arg_0 & var_48_arg_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L207] SORT_1 var_48 = var_48_arg_0 & var_48_arg_1; [L208] SORT_1 var_52_arg_0 = var_48; [L209] SORT_1 var_52 = ~var_52_arg_0; [L210] SORT_1 var_53_arg_0 = var_51; [L211] SORT_1 var_53_arg_1 = var_52; VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1, var_53_arg_0=1, var_53_arg_1=-2] [L212] EXPR var_53_arg_0 & var_53_arg_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L212] SORT_1 var_53 = var_53_arg_0 & var_53_arg_1; [L213] EXPR var_53 & mask_SORT_1 VAL [input_4=0, input_5=0, input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_217=1152921504606846975, mask_SORT_3=-1, state_18=0, state_220=0, state_251=0, state_25=0, state_264=0, state_269=0, state_30=0, state_37=0, state_42=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_71=0, state_73=0, state_75=0, state_77=0, state_79=0, state_81=0, state_83=0, state_85=0, var_11=0, var_14=0, var_204=1, var_208=3735928559, var_211=12245771, var_216=0, var_24=0, var_51=1] [L213] var_53 = var_53 & mask_SORT_1 [L214] SORT_1 bad_54_arg_0 = var_53; [L215] CALL __VERIFIER_assert(!(bad_54_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 523 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7312 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7312 mSDsluCounter, 27767 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20624 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5888 IncrementalHoareTripleChecker+Invalid, 5899 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 7143 mSDtfsCounter, 5888 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=583occurred in iteration=7, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 805 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1180 NumberOfCodeBlocks, 1180 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1069 ConstructedInterpolants, 0 QuantifiedInterpolants, 2812 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 17:52:27,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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.mul10.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 37bf2f4a0d13654afdfd5cdecda47a5234857be125596f55f94b7f56efc2af18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:52:29,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:52:29,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 17:52:29,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:52:29,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:52:29,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:52:29,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:52:29,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:52:29,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:52:29,784 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:52:29,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:52:29,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:52:29,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:52:29,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:52:29,785 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:52:29,785 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:52:29,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:52:29,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:52:29,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:52:29,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:52:29,785 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:52:29,785 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 17:52:29,785 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 17:52:29,786 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 17:52:29,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:52:29,786 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:52:29,786 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:52:29,786 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:52:29,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:52:29,786 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:52:29,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:52:29,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:52:29,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:52:29,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:52:29,787 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:52:29,787 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:52:29,787 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 17:52:29,787 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 17:52:29,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:52:29,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:52:29,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:52:29,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:52:29,788 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 -> 37bf2f4a0d13654afdfd5cdecda47a5234857be125596f55f94b7f56efc2af18 [2025-03-03 17:52:30,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:52:30,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:52:30,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:52:30,025 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:52:30,025 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:52:30,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul10.c [2025-03-03 17:52:31,163 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98df15825/d3564c9ca3264c399fa11b8f9489978b/FLAG521341860 [2025-03-03 17:52:31,404 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:52:31,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul10.c [2025-03-03 17:52:31,416 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98df15825/d3564c9ca3264c399fa11b8f9489978b/FLAG521341860 [2025-03-03 17:52:31,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98df15825/d3564c9ca3264c399fa11b8f9489978b [2025-03-03 17:52:31,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:52:31,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:52:31,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:52:31,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:52:31,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:52:31,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:52:31" (1/1) ... [2025-03-03 17:52:31,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27d837dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:31, skipping insertion in model container [2025-03-03 17:52:31,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:52:31" (1/1) ... [2025-03-03 17:52:31,750 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:52:31,849 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.mul10.c[1245,1258] [2025-03-03 17:52:31,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:52:31,964 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:52:31,972 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.mul10.c[1245,1258] [2025-03-03 17:52:32,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:52:32,043 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:52:32,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:32 WrapperNode [2025-03-03 17:52:32,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:52:32,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:52:32,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:52:32,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:52:32,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:32" (1/1) ... [2025-03-03 17:52:32,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:32" (1/1) ... [2025-03-03 17:52:32,097 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 736 [2025-03-03 17:52:32,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:52:32,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:52:32,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:52:32,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:52:32,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:32" (1/1) ... [2025-03-03 17:52:32,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:32" (1/1) ... [2025-03-03 17:52:32,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:32" (1/1) ... [2025-03-03 17:52:32,127 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-03 17:52:32,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:32" (1/1) ... [2025-03-03 17:52:32,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:32" (1/1) ... [2025-03-03 17:52:32,138 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:32" (1/1) ... [2025-03-03 17:52:32,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:32" (1/1) ... [2025-03-03 17:52:32,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:32" (1/1) ... [2025-03-03 17:52:32,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:32" (1/1) ... [2025-03-03 17:52:32,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:52:32,148 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:52:32,148 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:52:32,148 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:52:32,149 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:32" (1/1) ... [2025-03-03 17:52:32,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:52:32,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:52:32,186 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 17:52:32,190 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 17:52:32,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:52:32,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 17:52:32,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-03 17:52:32,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:52:32,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:52:32,360 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:52:32,361 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:52:33,099 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-03-03 17:52:33,099 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:52:33,104 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:52:33,104 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:52:33,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:52:33 BoogieIcfgContainer [2025-03-03 17:52:33,105 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:52:33,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:52:33,106 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:52:33,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:52:33,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:52:31" (1/3) ... [2025-03-03 17:52:33,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52de386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:52:33, skipping insertion in model container [2025-03-03 17:52:33,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:32" (2/3) ... [2025-03-03 17:52:33,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52de386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:52:33, skipping insertion in model container [2025-03-03 17:52:33,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:52:33" (3/3) ... [2025-03-03 17:52:33,111 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul10.c [2025-03-03 17:52:33,120 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:52:33,121 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul10.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:52:33,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:52:33,160 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;@ef6f8dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:52:33,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:52:33,163 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 17:52:33,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 17:52:33,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:33,168 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 17:52:33,169 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:33,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:33,173 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 17:52:33,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:52:33,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [307350633] [2025-03-03 17:52:33,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:33,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:52:33,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:52:33,185 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 17:52:33,187 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 17:52:33,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 17:52:33,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 17:52:33,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:33,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:33,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-03 17:52:33,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:52:33,790 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 17:52:33,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:52:33,792 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:52:33,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307350633] [2025-03-03 17:52:33,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307350633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:33,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:33,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:52:33,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185085049] [2025-03-03 17:52:33,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:33,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:52:33,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:52:33,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:52:33,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:52:33,813 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 17:52:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:34,044 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-03-03 17:52:34,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:52:34,045 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 17:52:34,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:34,050 INFO L225 Difference]: With dead ends: 17 [2025-03-03 17:52:34,050 INFO L226 Difference]: Without dead ends: 9 [2025-03-03 17:52:34,053 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 17:52:34,056 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:34,056 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.2s Time] [2025-03-03 17:52:34,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-03 17:52:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-03 17:52:34,071 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 17:52:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 17:52:34,074 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 17:52:34,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:34,074 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 17:52:34,074 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 17:52:34,074 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 17:52:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 17:52:34,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:34,075 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 17:52:34,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 17:52:34,277 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 17:52:34,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:34,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:34,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 17:52:34,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:52:34,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1711206157] [2025-03-03 17:52:34,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:34,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:52:34,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:52:34,281 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 17:52:34,282 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 17:52:34,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 17:52:34,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 17:52:34,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:34,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:34,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-03 17:52:34,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:52:35,894 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 17:52:35,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:52:51,140 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse16 (= |c_ULTIMATE.start_main_~state_269~0#1| (_ bv0 8))) (.cse38 (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |c_ULTIMATE.start_main_~state_42~0#1|))) (let ((.cse35 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 32))) (not (= .cse38 (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_5~0#1|))))) (.cse13 (not .cse16)) (.cse36 (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| (_ BitVec 64))) (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|)))) (.cse12 (= |c_ULTIMATE.start_main_~state_251~0#1| (_ bv0 8))) (.cse25 (forall ((|v_ULTIMATE.start_main_~var_53_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_0~0#1_10|))))))))) (.cse37 (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 64))) (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|))))) (let ((.cse20 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_8~0#1|)) (.cse14 (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 64))) (not (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|))))) (.cse27 (or .cse25 .cse37)) (.cse8 (not .cse12)) (.cse26 (or .cse16 .cse36 .cse25)) (.cse34 (forall ((|v_ULTIMATE.start_main_~var_53_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_0~0#1_10|))))))))) (.cse11 (and (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| (_ BitVec 64))) (not (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|)))) .cse13)) (.cse32 (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 32))) (= .cse38 (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_5~0#1|))) .cse25)) (.cse33 (or .cse35 .cse25))) (let ((.cse10 (and .cse32 .cse33)) (.cse28 (and (or .cse12 (and (or .cse16 (and .cse34 .cse25)) (or .cse13 (and (or .cse14 .cse34) .cse27)))) (or .cse8 (and .cse26 (or .cse34 .cse11))))) (.cse24 (not .cse20))) (let ((.cse29 (or .cse28 .cse24)) (.cse6 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_9~0#1|)) (.cse15 (or .cse37 .cse10)) (.cse9 (or .cse16 .cse36 .cse10))) (let ((.cse18 (let ((.cse31 (or .cse34 .cse35))) (let ((.cse30 (and .cse31 .cse32))) (and (or .cse12 (and (or .cse13 (and .cse15 (or .cse14 .cse30))) (or .cse16 (and .cse31 .cse32 .cse33)))) (or .cse8 (and .cse9 (or .cse30 .cse11))))))) (.cse5 (not .cse6)) (.cse23 (and .cse29 (or .cse20 .cse28))) (.cse17 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_9| (_ BitVec 32))) (= (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_4~0#1|) (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |v_ULTIMATE.start_main_~state_30~0#1_9|)))) (.cse19 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_9| (_ BitVec 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_4~0#1|) (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |v_ULTIMATE.start_main_~state_30~0#1_9|)))))) (let ((.cse0 (and (or .cse20 (and (or .cse17 (and (or (and (or .cse25 .cse11) .cse26) .cse8) (or .cse12 (and (or .cse13 (and (or .cse14 .cse25) .cse27)) (or .cse16 .cse25))))) (or .cse28 .cse19))) .cse29)) (.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_8~0#1|)) (.cse1 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_9~0#1|)) (.cse22 (or .cse5 .cse23)) (.cse7 (or .cse18 .cse24))) (and (or .cse0 (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse1 .cse2))) .cse3))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse2 .cse4))))))))))) (or (and (or .cse5 .cse0) (or .cse6 (and .cse7 (or (and (or (and (or .cse8 (and .cse9 (or .cse10 .cse11))) (or .cse12 (and (or .cse13 (and (or .cse14 .cse10) .cse15)) (or .cse16 .cse10)))) .cse17) (or .cse18 .cse19)) .cse20)))) (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse1 .cse21))) .cse3)))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse21 .cse4))))))))))) (or (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|))))))) .cse3)))) (and .cse22 (or .cse6 .cse23))) (or (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|))))))) .cse3))))) (and .cse22 (or .cse6 (and .cse7 (or .cse18 .cse20))))))))))))) is different from false [2025-03-03 17:53:08,775 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 179 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 17:53:21,171 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 17:53:21,171 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:53:21,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711206157] [2025-03-03 17:53:21,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711206157] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:53:21,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:53:21,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-03 17:53:21,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100227863] [2025-03-03 17:53:21,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 17:53:21,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 17:53:21,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:53:21,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 17:53:21,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=82, Unknown=1, NotChecked=18, Total=132 [2025-03-03 17:53:21,173 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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 17:53:22,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:53:22,843 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-03 17:53:22,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:53:22,845 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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 17:53:22,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:53:22,846 INFO L225 Difference]: With dead ends: 14 [2025-03-03 17:53:22,846 INFO L226 Difference]: Without dead ends: 12 [2025-03-03 17:53:22,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=46, Invalid=113, Unknown=1, NotChecked=22, Total=182 [2025-03-03 17:53:22,846 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 17:53:22,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 7 Unchecked, 0.7s Time] [2025-03-03 17:53:22,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-03 17:53:22,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-03 17:53:22,849 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 17:53:22,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-03 17:53:22,850 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-03-03 17:53:22,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:53:22,850 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-03 17:53:22,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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 17:53:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-03 17:53:22,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 17:53:22,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:53:22,851 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-03 17:53:22,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 17:53:23,051 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 17:53:23,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:53:23,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:53:23,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-03-03 17:53:23,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:53:23,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305937471] [2025-03-03 17:53:23,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 17:53:23,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:53:23,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:53:23,056 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 17:53:23,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 17:53:23,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes.