./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul9.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.mul9.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 a5a3a60dd79607bf0bca68238db6212890020658ef1f1435f68d731a8509f7ab --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:53:03,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:53:03,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:53:03,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:53:03,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:53:03,402 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:53:03,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:53:03,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:53:03,403 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:53:03,404 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:53:03,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:53:03,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:53:03,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:53:03,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:53:03,404 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:53:03,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:53:03,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:53:03,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:53:03,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:53:03,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:53:03,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:53:03,405 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:53:03,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:53:03,405 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:53:03,405 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:53:03,405 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:53:03,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:53:03,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:53:03,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:53:03,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:53:03,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:53:03,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:53:03,406 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:53:03,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:53:03,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:53:03,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:53:03,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:53:03,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:53:03,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:53:03,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:53:03,406 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 -> a5a3a60dd79607bf0bca68238db6212890020658ef1f1435f68d731a8509f7ab [2025-03-03 17:53:03,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:53:03,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:53:03,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:53:03,644 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:53:03,644 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:53:03,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul9.c [2025-03-03 17:53:04,769 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708cf9f01/61c910e5fc3c4607b5b6cfdbb7f30bd6/FLAG42bcb12c7 [2025-03-03 17:53:05,020 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:53:05,021 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul9.c [2025-03-03 17:53:05,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708cf9f01/61c910e5fc3c4607b5b6cfdbb7f30bd6/FLAG42bcb12c7 [2025-03-03 17:53:05,049 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708cf9f01/61c910e5fc3c4607b5b6cfdbb7f30bd6 [2025-03-03 17:53:05,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:53:05,052 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:53:05,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:53:05,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:53:05,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:53:05,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:53:05" (1/1) ... [2025-03-03 17:53:05,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e1eea5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:05, skipping insertion in model container [2025-03-03 17:53:05,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:53:05" (1/1) ... [2025-03-03 17:53:05,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:53:05,187 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.mul9.c[1244,1257] [2025-03-03 17:53:05,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:53:05,310 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:53:05,317 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.mul9.c[1244,1257] [2025-03-03 17:53:05,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:53:05,405 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:53:05,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:05 WrapperNode [2025-03-03 17:53:05,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:53:05,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:53:05,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:53:05,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:53:05,411 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:53:05" (1/1) ... [2025-03-03 17:53:05,431 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:53:05" (1/1) ... [2025-03-03 17:53:05,550 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1761 [2025-03-03 17:53:05,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:53:05,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:53:05,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:53:05,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:53:05,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:05" (1/1) ... [2025-03-03 17:53:05,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:05" (1/1) ... [2025-03-03 17:53:05,586 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:05" (1/1) ... [2025-03-03 17:53:05,673 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-03 17:53:05,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:05" (1/1) ... [2025-03-03 17:53:05,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:05" (1/1) ... [2025-03-03 17:53:05,703 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:05" (1/1) ... [2025-03-03 17:53:05,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:05" (1/1) ... [2025-03-03 17:53:05,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:05" (1/1) ... [2025-03-03 17:53:05,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:05" (1/1) ... [2025-03-03 17:53:05,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:53:05,766 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:53:05,766 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:53:05,766 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:53:05,767 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:05" (1/1) ... [2025-03-03 17:53:05,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:53:05,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:53:05,793 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:53:05,795 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:53:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:53:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:53:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 17:53:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:53:05,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:53:05,976 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:53:05,978 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:53:07,372 INFO L? ?]: Removed 896 outVars from TransFormulas that were not future-live. [2025-03-03 17:53:07,373 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:53:07,459 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:53:07,459 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:53:07,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:53:07 BoogieIcfgContainer [2025-03-03 17:53:07,460 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:53:07,462 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:53:07,462 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:53:07,465 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:53:07,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:53:05" (1/3) ... [2025-03-03 17:53:07,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df7b44f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:53:07, skipping insertion in model container [2025-03-03 17:53:07,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:05" (2/3) ... [2025-03-03 17:53:07,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df7b44f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:53:07, skipping insertion in model container [2025-03-03 17:53:07,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:53:07" (3/3) ... [2025-03-03 17:53:07,467 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul9.c [2025-03-03 17:53:07,476 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:53:07,478 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul9.c that has 1 procedures, 523 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:53:07,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:53:07,539 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;@55f734e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:53:07,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:53:07,543 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:53:07,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 17:53:07,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:53:07,552 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:53:07,553 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:53:07,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:53:07,556 INFO L85 PathProgramCache]: Analyzing trace with hash 680184206, now seen corresponding path program 1 times [2025-03-03 17:53:07,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:53:07,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745748719] [2025-03-03 17:53:07,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:53:07,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:53:07,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 17:53:07,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 17:53:07,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:53:07,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:53:08,281 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:53:08,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:53:08,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745748719] [2025-03-03 17:53:08,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745748719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:53:08,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:53:08,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:53:08,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339499577] [2025-03-03 17:53:08,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:53:08,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:53:08,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:53:08,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:53:08,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:53:08,304 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:53:08,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:53:08,601 INFO L93 Difference]: Finished difference Result 927 states and 1399 transitions. [2025-03-03 17:53:08,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:53:08,604 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:53:08,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:53:08,617 INFO L225 Difference]: With dead ends: 927 [2025-03-03 17:53:08,617 INFO L226 Difference]: Without dead ends: 522 [2025-03-03 17:53:08,620 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:53:08,623 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:53:08,624 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:53:08,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-03 17:53:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-03-03 17:53:08,669 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:53:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 785 transitions. [2025-03-03 17:53:08,675 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 785 transitions. Word has length 95 [2025-03-03 17:53:08,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:53:08,676 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 785 transitions. [2025-03-03 17:53:08,677 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:53:08,677 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 785 transitions. [2025-03-03 17:53:08,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 17:53:08,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:53:08,678 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:53:08,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:53:08,679 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:53:08,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:53:08,679 INFO L85 PathProgramCache]: Analyzing trace with hash -384446363, now seen corresponding path program 1 times [2025-03-03 17:53:08,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:53:08,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739307786] [2025-03-03 17:53:08,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:53:08,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:53:08,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 17:53:08,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 17:53:08,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:53:08,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:53:08,913 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:53:08,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:53:08,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739307786] [2025-03-03 17:53:08,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739307786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:53:08,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:53:08,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:53:08,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562977306] [2025-03-03 17:53:08,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:53:08,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:53:08,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:53:08,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:53:08,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:53:08,915 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:53:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:53:09,166 INFO L93 Difference]: Finished difference Result 928 states and 1397 transitions. [2025-03-03 17:53:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:53:09,166 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:53:09,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:53:09,169 INFO L225 Difference]: With dead ends: 928 [2025-03-03 17:53:09,169 INFO L226 Difference]: Without dead ends: 524 [2025-03-03 17:53:09,170 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:53:09,170 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:53:09,170 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:53:09,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-03 17:53:09,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-03-03 17:53:09,186 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:53:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 787 transitions. [2025-03-03 17:53:09,190 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 787 transitions. Word has length 96 [2025-03-03 17:53:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:53:09,190 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 787 transitions. [2025-03-03 17:53:09,190 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:53:09,190 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 787 transitions. [2025-03-03 17:53:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 17:53:09,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:53:09,192 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:53:09,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:53:09,193 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:53:09,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:53:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1396392855, now seen corresponding path program 1 times [2025-03-03 17:53:09,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:53:09,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734154036] [2025-03-03 17:53:09,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:53:09,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:53:09,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 17:53:09,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 17:53:09,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:53:09,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:53:09,533 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:53:09,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:53:09,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734154036] [2025-03-03 17:53:09,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734154036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:53:09,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:53:09,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:53:09,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515841553] [2025-03-03 17:53:09,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:53:09,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:53:09,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:53:09,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:53:09,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:53:09,535 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:53:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:53:09,796 INFO L93 Difference]: Finished difference Result 934 states and 1404 transitions. [2025-03-03 17:53:09,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:53:09,796 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:53:09,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:53:09,798 INFO L225 Difference]: With dead ends: 934 [2025-03-03 17:53:09,798 INFO L226 Difference]: Without dead ends: 528 [2025-03-03 17:53:09,799 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:53:09,799 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 700 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:53:09,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1940 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:53:09,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-03 17:53:09,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 527. [2025-03-03 17:53:09,833 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:53:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 790 transitions. [2025-03-03 17:53:09,835 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 790 transitions. Word has length 97 [2025-03-03 17:53:09,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:53:09,835 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 790 transitions. [2025-03-03 17:53:09,835 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:53:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 790 transitions. [2025-03-03 17:53:09,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 17:53:09,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:53:09,840 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:53:09,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:53:09,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:53:09,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:53:09,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1413585100, now seen corresponding path program 1 times [2025-03-03 17:53:09,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:53:09,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778169722] [2025-03-03 17:53:09,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:53:09,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:53:09,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 17:53:09,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 17:53:09,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:53:09,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:53:10,786 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:53:10,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:53:10,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778169722] [2025-03-03 17:53:10,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778169722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:53:10,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:53:10,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 17:53:10,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42123199] [2025-03-03 17:53:10,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:53:10,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:53:10,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:53:10,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:53:10,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:53:10,790 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:53:11,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:53:11,155 INFO L93 Difference]: Finished difference Result 959 states and 1437 transitions. [2025-03-03 17:53:11,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:53:11,155 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:53:11,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:53:11,158 INFO L225 Difference]: With dead ends: 959 [2025-03-03 17:53:11,158 INFO L226 Difference]: Without dead ends: 550 [2025-03-03 17:53:11,158 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:53:11,159 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:53:11,161 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:53:11,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-03 17:53:11,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 535. [2025-03-03 17:53:11,173 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:53:11,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 801 transitions. [2025-03-03 17:53:11,174 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 801 transitions. Word has length 98 [2025-03-03 17:53:11,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:53:11,175 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 801 transitions. [2025-03-03 17:53:11,175 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:53:11,175 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 801 transitions. [2025-03-03 17:53:11,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 17:53:11,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:53:11,176 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:53:11,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:53:11,177 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:53:11,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:53:11,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1012503699, now seen corresponding path program 1 times [2025-03-03 17:53:11,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:53:11,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22710706] [2025-03-03 17:53:11,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:53:11,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:53:11,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 17:53:11,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 17:53:11,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:53:11,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:53:11,529 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:53:11,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:53:11,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22710706] [2025-03-03 17:53:11,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22710706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:53:11,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:53:11,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:53:11,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605522868] [2025-03-03 17:53:11,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:53:11,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:53:11,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:53:11,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:53:11,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:53:11,531 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:53:11,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:53:11,825 INFO L93 Difference]: Finished difference Result 1203 states and 1802 transitions. [2025-03-03 17:53:11,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:53:11,826 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:53:11,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:53:11,828 INFO L225 Difference]: With dead ends: 1203 [2025-03-03 17:53:11,829 INFO L226 Difference]: Without dead ends: 786 [2025-03-03 17:53:11,829 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:53:11,830 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.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:53:11,830 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.3s Time] [2025-03-03 17:53:11,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-03-03 17:53:11,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 567. [2025-03-03 17:53:11,838 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:53:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 847 transitions. [2025-03-03 17:53:11,840 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 847 transitions. Word has length 99 [2025-03-03 17:53:11,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:53:11,840 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 847 transitions. [2025-03-03 17:53:11,840 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:53:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 847 transitions. [2025-03-03 17:53:11,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 17:53:11,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:53:11,841 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:53:11,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:53:11,841 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:53:11,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:53:11,841 INFO L85 PathProgramCache]: Analyzing trace with hash -175594313, now seen corresponding path program 1 times [2025-03-03 17:53:11,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:53:11,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659881722] [2025-03-03 17:53:11,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:53:11,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:53:11,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 17:53:11,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 17:53:11,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:53:11,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:53:12,155 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:53:12,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:53:12,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659881722] [2025-03-03 17:53:12,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659881722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:53:12,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:53:12,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:53:12,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21645080] [2025-03-03 17:53:12,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:53:12,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:53:12,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:53:12,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:53:12,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:53:12,157 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:53:12,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:53:12,453 INFO L93 Difference]: Finished difference Result 1213 states and 1815 transitions. [2025-03-03 17:53:12,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:53:12,453 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:53:12,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:53:12,456 INFO L225 Difference]: With dead ends: 1213 [2025-03-03 17:53:12,456 INFO L226 Difference]: Without dead ends: 796 [2025-03-03 17:53:12,457 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:53:12,457 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:53:12,457 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:53:12,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-03-03 17:53:12,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 577. [2025-03-03 17:53:12,466 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:53:12,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 860 transitions. [2025-03-03 17:53:12,468 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 860 transitions. Word has length 99 [2025-03-03 17:53:12,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:53:12,468 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 860 transitions. [2025-03-03 17:53:12,468 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:53:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 860 transitions. [2025-03-03 17:53:12,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 17:53:12,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:53:12,469 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:53:12,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:53:12,469 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:53:12,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:53:12,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1612885308, now seen corresponding path program 1 times [2025-03-03 17:53:12,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:53:12,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609777921] [2025-03-03 17:53:12,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:53:12,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:53:12,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 17:53:12,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 17:53:12,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:53:12,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:53:13,117 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:53:13,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:53:13,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609777921] [2025-03-03 17:53:13,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609777921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:53:13,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:53:13,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:53:13,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555958768] [2025-03-03 17:53:13,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:53:13,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:53:13,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:53:13,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:53:13,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:53:13,119 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:53:13,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:53:13,594 INFO L93 Difference]: Finished difference Result 1012 states and 1511 transitions. [2025-03-03 17:53:13,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:53:13,594 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:53:13,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:53:13,596 INFO L225 Difference]: With dead ends: 1012 [2025-03-03 17:53:13,597 INFO L226 Difference]: Without dead ends: 595 [2025-03-03 17:53:13,597 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:53:13,598 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:53:13,598 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:53:13,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-03 17:53:13,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 583. [2025-03-03 17:53:13,606 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:53:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 868 transitions. [2025-03-03 17:53:13,608 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 868 transitions. Word has length 99 [2025-03-03 17:53:13,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:53:13,608 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 868 transitions. [2025-03-03 17:53:13,608 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:53:13,609 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 868 transitions. [2025-03-03 17:53:13,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 17:53:13,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:53:13,609 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:53:13,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:53:13,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:53:13,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:53:13,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1749157754, now seen corresponding path program 1 times [2025-03-03 17:53:13,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:53:13,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507680228] [2025-03-03 17:53:13,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:53:13,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:53:13,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 17:53:13,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 17:53:13,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:53:13,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:53:14,061 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:53:14,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:53:14,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507680228] [2025-03-03 17:53:14,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507680228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:53:14,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:53:14,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:53:14,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512777942] [2025-03-03 17:53:14,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:53:14,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:53:14,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:53:14,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:53:14,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:53:14,063 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:53:14,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:53:14,594 INFO L93 Difference]: Finished difference Result 1004 states and 1499 transitions. [2025-03-03 17:53:14,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:53:14,595 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:53:14,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:53:14,597 INFO L225 Difference]: With dead ends: 1004 [2025-03-03 17:53:14,597 INFO L226 Difference]: Without dead ends: 581 [2025-03-03 17:53:14,598 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:53:14,598 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 702 mSDsluCounter, 3798 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 4435 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:53:14,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 4435 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:53:14,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-03 17:53:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 578. [2025-03-03 17:53:14,607 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:53:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 861 transitions. [2025-03-03 17:53:14,609 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 861 transitions. Word has length 99 [2025-03-03 17:53:14,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:53:14,609 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 861 transitions. [2025-03-03 17:53:14,609 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:53:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 861 transitions. [2025-03-03 17:53:14,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 17:53:14,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:53:14,610 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:53:14,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 17:53:14,610 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:53:14,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:53:14,611 INFO L85 PathProgramCache]: Analyzing trace with hash -917591694, now seen corresponding path program 1 times [2025-03-03 17:53:14,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:53:14,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703042575] [2025-03-03 17:53:14,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:53:14,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:53:14,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 17:53:14,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 17:53:14,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:53:14,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:53:14,872 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:53:14,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:53:14,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703042575] [2025-03-03 17:53:14,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703042575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:53:14,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:53:14,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:53:14,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327896669] [2025-03-03 17:53:14,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:53:14,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:53:14,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:53:14,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:53:14,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:53:14,873 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:53:15,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:53:15,154 INFO L93 Difference]: Finished difference Result 1170 states and 1746 transitions. [2025-03-03 17:53:15,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:53:15,154 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:53:15,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:53:15,157 INFO L225 Difference]: With dead ends: 1170 [2025-03-03 17:53:15,157 INFO L226 Difference]: Without dead ends: 748 [2025-03-03 17:53:15,158 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:53:15,158 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.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:53:15,158 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.3s Time] [2025-03-03 17:53:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2025-03-03 17:53:15,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 576. [2025-03-03 17:53:15,169 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:53:15,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 856 transitions. [2025-03-03 17:53:15,171 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 856 transitions. Word has length 99 [2025-03-03 17:53:15,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:53:15,171 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 856 transitions. [2025-03-03 17:53:15,171 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:53:15,172 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 856 transitions. [2025-03-03 17:53:15,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 17:53:15,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:53:15,172 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:53:15,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 17:53:15,173 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:53:15,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:53:15,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2028627288, now seen corresponding path program 1 times [2025-03-03 17:53:15,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:53:15,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282694381] [2025-03-03 17:53:15,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:53:15,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:53:15,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 17:53:15,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 17:53:15,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:53:15,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:53:15,439 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:53:15,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:53:15,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282694381] [2025-03-03 17:53:15,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282694381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:53:15,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:53:15,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:53:15,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551329606] [2025-03-03 17:53:15,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:53:15,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:53:15,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:53:15,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:53:15,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:53:15,441 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:53:15,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:53:15,741 INFO L93 Difference]: Finished difference Result 994 states and 1482 transitions. [2025-03-03 17:53:15,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:53:15,742 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:53:15,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:53:15,744 INFO L225 Difference]: With dead ends: 994 [2025-03-03 17:53:15,744 INFO L226 Difference]: Without dead ends: 568 [2025-03-03 17:53:15,744 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:53:15,745 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:53:15,745 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:53:15,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-03 17:53:15,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2025-03-03 17:53:15,752 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:53:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 846 transitions. [2025-03-03 17:53:15,753 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 846 transitions. Word has length 99 [2025-03-03 17:53:15,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:53:15,754 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 846 transitions. [2025-03-03 17:53:15,754 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:53:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 846 transitions. [2025-03-03 17:53:15,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 17:53:15,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:53:15,755 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:53:15,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 17:53:15,755 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:53:15,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:53:15,755 INFO L85 PathProgramCache]: Analyzing trace with hash -796881775, now seen corresponding path program 1 times [2025-03-03 17:53:15,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:53:15,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481753838] [2025-03-03 17:53:15,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:53:15,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:53:15,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 17:53:15,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 17:53:15,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:53:15,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:53:15,984 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:53:15,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:53:15,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481753838] [2025-03-03 17:53:15,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481753838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:53:15,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:53:15,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:53:15,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635899011] [2025-03-03 17:53:15,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:53:15,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:53:15,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:53:15,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:53:15,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:53:15,986 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:53:16,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:53:16,284 INFO L93 Difference]: Finished difference Result 1158 states and 1729 transitions. [2025-03-03 17:53:16,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:53:16,284 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:53:16,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:53:16,287 INFO L225 Difference]: With dead ends: 1158 [2025-03-03 17:53:16,288 INFO L226 Difference]: Without dead ends: 740 [2025-03-03 17:53:16,288 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:53:16,289 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.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:53:16,289 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.3s Time] [2025-03-03 17:53:16,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2025-03-03 17:53:16,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 576. [2025-03-03 17:53:16,300 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:53:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 855 transitions. [2025-03-03 17:53:16,302 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 855 transitions. Word has length 100 [2025-03-03 17:53:16,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:53:16,302 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 855 transitions. [2025-03-03 17:53:16,302 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:53:16,302 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 855 transitions. [2025-03-03 17:53:16,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 17:53:16,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:53:16,306 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:53:16,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 17:53:16,306 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:53:16,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:53:16,307 INFO L85 PathProgramCache]: Analyzing trace with hash 141406171, now seen corresponding path program 1 times [2025-03-03 17:53:16,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:53:16,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065845625] [2025-03-03 17:53:16,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:53:16,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:53:16,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 17:53:16,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 17:53:16,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:53:16,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:53:16,357 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 17:53:16,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 17:53:16,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 17:53:16,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:53:16,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:53:16,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 17:53:16,441 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 17:53:16,441 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:53:16,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 17:53:16,446 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:53:16,498 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:53:16,515 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:53:16,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:53:16 BoogieIcfgContainer [2025-03-03 17:53:16,518 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:53:16,519 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:53:16,519 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:53:16,519 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:53:16,520 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:53:07" (3/4) ... [2025-03-03 17:53:16,521 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 17:53:16,522 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:53:16,523 INFO L158 Benchmark]: Toolchain (without parser) took 11470.00ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 104.9MB in the beginning and 274.4MB in the end (delta: -169.5MB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. [2025-03-03 17:53:16,523 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:53:16,523 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.50ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 74.3MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 17:53:16,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 143.62ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 38.6MB in the end (delta: 35.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 17:53:16,523 INFO L158 Benchmark]: Boogie Preprocessor took 214.38ms. Allocated memory is still 142.6MB. Free memory was 38.6MB in the beginning and 75.2MB in the end (delta: -36.6MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2025-03-03 17:53:16,524 INFO L158 Benchmark]: IcfgBuilder took 1693.45ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 74.5MB in the beginning and 65.4MB in the end (delta: 9.1MB). Peak memory consumption was 130.1MB. Max. memory is 16.1GB. [2025-03-03 17:53:16,524 INFO L158 Benchmark]: TraceAbstraction took 9056.73ms. Allocated memory was 251.7MB in the beginning and 436.2MB in the end (delta: 184.5MB). Free memory was 64.8MB in the beginning and 278.3MB in the end (delta: -213.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:53:16,524 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 436.2MB. Free memory was 274.4MB in the beginning and 274.4MB in the end (delta: 44.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:53:16,526 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.50ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 74.3MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 143.62ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 38.6MB in the end (delta: 35.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 214.38ms. Allocated memory is still 142.6MB. Free memory was 38.6MB in the beginning and 75.2MB in the end (delta: -36.6MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * IcfgBuilder took 1693.45ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 74.5MB in the beginning and 65.4MB in the end (delta: 9.1MB). Peak memory consumption was 130.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9056.73ms. Allocated memory was 251.7MB in the beginning and 436.2MB in the end (delta: 184.5MB). Free memory was 64.8MB in the beginning and 278.3MB in the end (delta: -213.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 436.2MB. Free memory was 274.4MB in the beginning and 274.4MB in the end (delta: 44.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 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.9s, 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.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7312 mSDsluCounter, 27797 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20648 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5858 IncrementalHoareTripleChecker+Invalid, 5869 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 7149 mSDtfsCounter, 5858 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.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 805 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.1s 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:53:16,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul9.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 a5a3a60dd79607bf0bca68238db6212890020658ef1f1435f68d731a8509f7ab --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:53:18,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:53:18,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 17:53:18,513 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:53:18,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:53:18,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:53:18,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:53:18,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:53:18,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:53:18,528 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:53:18,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:53:18,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:53:18,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:53:18,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:53:18,529 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:53:18,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:53:18,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:53:18,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:53:18,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:53:18,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:53:18,529 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:53:18,529 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 17:53:18,529 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 17:53:18,529 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 17:53:18,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:53:18,530 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:53:18,530 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:53:18,530 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:53:18,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:53:18,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:53:18,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:53:18,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:53:18,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:53:18,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:53:18,531 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:53:18,531 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:53:18,531 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 17:53:18,531 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 17:53:18,531 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:53:18,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:53:18,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:53:18,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:53:18,531 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 -> a5a3a60dd79607bf0bca68238db6212890020658ef1f1435f68d731a8509f7ab [2025-03-03 17:53:18,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:53:18,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:53:18,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:53:18,779 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:53:18,779 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:53:18,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul9.c [2025-03-03 17:53:19,979 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f91f74ea/08c86085aef140f1aab3ad09aece294c/FLAG09394b657 [2025-03-03 17:53:20,218 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:53:20,221 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul9.c [2025-03-03 17:53:20,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f91f74ea/08c86085aef140f1aab3ad09aece294c/FLAG09394b657 [2025-03-03 17:53:20,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f91f74ea/08c86085aef140f1aab3ad09aece294c [2025-03-03 17:53:20,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:53:20,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:53:20,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:53:20,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:53:20,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:53:20,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:53:20" (1/1) ... [2025-03-03 17:53:20,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7afce278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:20, skipping insertion in model container [2025-03-03 17:53:20,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:53:20" (1/1) ... [2025-03-03 17:53:20,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:53:20,706 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.mul9.c[1244,1257] [2025-03-03 17:53:20,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:53:20,819 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:53:20,828 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.mul9.c[1244,1257] [2025-03-03 17:53:20,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:53:20,906 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:53:20,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:20 WrapperNode [2025-03-03 17:53:20,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:53:20,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:53:20,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:53:20,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:53:20,914 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:53:20" (1/1) ... [2025-03-03 17:53:20,930 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:53:20" (1/1) ... [2025-03-03 17:53:20,964 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 735 [2025-03-03 17:53:20,965 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:53:20,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:53:20,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:53:20,966 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:53:20,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:20" (1/1) ... [2025-03-03 17:53:20,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:20" (1/1) ... [2025-03-03 17:53:20,982 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:20" (1/1) ... [2025-03-03 17:53:21,001 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-03 17:53:21,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:20" (1/1) ... [2025-03-03 17:53:21,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:20" (1/1) ... [2025-03-03 17:53:21,013 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:20" (1/1) ... [2025-03-03 17:53:21,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:20" (1/1) ... [2025-03-03 17:53:21,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:20" (1/1) ... [2025-03-03 17:53:21,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:20" (1/1) ... [2025-03-03 17:53:21,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:53:21,028 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:53:21,028 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:53:21,028 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:53:21,032 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:20" (1/1) ... [2025-03-03 17:53:21,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:53:21,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:53:21,056 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:53:21,062 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:53:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:53:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 17:53:21,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-03 17:53:21,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:53:21,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:53:21,277 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:53:21,279 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:53:22,114 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-03-03 17:53:22,114 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:53:22,122 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:53:22,123 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:53:22,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:53:22 BoogieIcfgContainer [2025-03-03 17:53:22,124 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:53:22,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:53:22,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:53:22,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:53:22,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:53:20" (1/3) ... [2025-03-03 17:53:22,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331f903a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:53:22, skipping insertion in model container [2025-03-03 17:53:22,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:53:20" (2/3) ... [2025-03-03 17:53:22,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331f903a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:53:22, skipping insertion in model container [2025-03-03 17:53:22,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:53:22" (3/3) ... [2025-03-03 17:53:22,133 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul9.c [2025-03-03 17:53:22,144 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:53:22,145 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul9.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:53:22,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:53:22,191 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;@6bac2076, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:53:22,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:53:22,194 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:53:22,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 17:53:22,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:53:22,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 17:53:22,198 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:53:22,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:53:22,204 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 17:53:22,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:53:22,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [290141481] [2025-03-03 17:53:22,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:53:22,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:53:22,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:53:22,215 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:53:22,216 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:53:22,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 17:53:22,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 17:53:22,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:53:22,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:53:22,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-03 17:53:22,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:53:22,820 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:53:22,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:53:22,823 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:53:22,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290141481] [2025-03-03 17:53:22,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290141481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:53:22,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:53:22,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:53:22,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400475230] [2025-03-03 17:53:22,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:53:22,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:53:22,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:53:22,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:53:22,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:53:22,847 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:53:23,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:53:23,036 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-03-03 17:53:23,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:53:23,038 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:53:23,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:53:23,043 INFO L225 Difference]: With dead ends: 17 [2025-03-03 17:53:23,044 INFO L226 Difference]: Without dead ends: 9 [2025-03-03 17:53:23,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:53:23,047 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:53:23,049 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:53:23,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-03 17:53:23,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-03 17:53:23,066 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:53:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 17:53:23,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 17:53:23,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:53:23,072 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 17:53:23,072 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:53:23,072 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 17:53:23,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 17:53:23,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:53:23,073 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 17:53:23,080 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:53:23,274 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:53:23,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:53:23,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:53:23,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 17:53:23,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:53:23,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [794314742] [2025-03-03 17:53:23,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:53:23,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:53:23,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:53:23,282 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:53:23,287 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:53:23,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 17:53:23,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 17:53:23,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:53:23,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:53:23,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-03 17:53:23,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:53:24,909 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:24,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:53:39,962 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse17 (= |c_ULTIMATE.start_main_~state_269~0#1| (_ bv0 8)))) (let ((.cse20 (not .cse17)) (.cse32 (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|)))) (.cse16 (= |c_ULTIMATE.start_main_~state_251~0#1| (_ bv0 8))) (.cse34 (forall ((|v_ULTIMATE.start_main_~var_53_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_0~0#1_10|))))))))) (.cse33 (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 ((.cse31 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_9| (_ BitVec 32))) (not (= (bvand |v_ULTIMATE.start_main_~state_42~0#1_9| |c_ULTIMATE.start_main_~mask_SORT_3~0#1|) (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_5~0#1|))))) (.cse11 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_8~0#1|)) (.cse18 (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|))))) (.cse36 (or .cse34 .cse33)) (.cse12 (not .cse16)) (.cse35 (or .cse17 .cse32 .cse34)) (.cse30 (forall ((|v_ULTIMATE.start_main_~var_53_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_0~0#1_10|))))))))) (.cse15 (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|)))) .cse20))) (let ((.cse37 (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |c_ULTIMATE.start_main_~state_30~0#1|)) (.cse5 (and (or .cse16 (and (or .cse17 (and .cse30 .cse34)) (or .cse20 (and (or .cse18 .cse30) .cse36)))) (or .cse12 (and .cse35 (or .cse30 .cse15))))) (.cse23 (not .cse11)) (.cse26 (or .cse31 .cse34)) (.cse27 (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_9| (_ BitVec 32))) (= (bvand |v_ULTIMATE.start_main_~state_42~0#1_9| |c_ULTIMATE.start_main_~mask_SORT_3~0#1|) (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_5~0#1|))) .cse34))) (let ((.cse14 (and .cse26 .cse27)) (.cse6 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_9~0#1|)) (.cse25 (or .cse5 .cse23)) (.cse22 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_4~0#1|) .cse37)))) (.cse21 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 32))) (= (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_4~0#1|) .cse37)))) (let ((.cse8 (and .cse25 (or (and (or .cse5 .cse22) (or .cse21 (and (or (and (or .cse34 .cse15) .cse35) .cse12) (or .cse16 (and (or .cse20 (and (or .cse18 .cse34) .cse36)) (or .cse17 .cse34)))))) .cse11))) (.cse4 (not .cse6)) (.cse19 (or .cse14 .cse33)) (.cse13 (or .cse17 .cse14 .cse32))) (let ((.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_9~0#1|)) (.cse7 (let ((.cse28 (or .cse30 .cse31))) (let ((.cse29 (and .cse27 .cse28))) (and (or .cse16 (and (or .cse17 (and .cse26 .cse27 .cse28)) (or .cse20 (and (or .cse18 .cse29) .cse19)))) (or .cse12 (and (or .cse29 .cse15) .cse13)))))) (.cse9 (or .cse8 .cse4)) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_8~0#1|))) (and (or (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (let ((.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|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse1 .cse2)))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse3 .cse1))) .cse0))))))) (and (or .cse4 .cse5) (or .cse6 .cse7))) (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 .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ 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|)))) .cse2)))))))) (and (or .cse8 .cse6) .cse9)) (or (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (let ((.cse10 ((_ 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 .cse3 .cse10))) .cse0)))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse10 .cse2)))))))))) (and (or .cse6 (and (or .cse11 (and (or (and (or .cse12 (and .cse13 (or .cse14 .cse15))) (or .cse16 (and (or .cse17 .cse14) (or (and (or .cse18 .cse14) .cse19) .cse20)))) .cse21) (or .cse7 .cse22))) (or .cse7 .cse23))) .cse9)) (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 .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ 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|)))) .cse2))))))) (let ((.cse24 (and .cse25 (or .cse11 .cse5)))) (and (or .cse4 .cse24) (or .cse6 .cse24)))))))))))) is different from false [2025-03-03 17:54:18,487 WARN L286 SmtUtils]: Spent 18.50s on a formula simplification that was a NOOP. DAG size: 180 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)