./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.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.adding.2.prop1-func-interl.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 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:32:13,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:32:13,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 16:32:13,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:32:13,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:32:13,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:32:13,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:32:13,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:32:13,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:32:13,796 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:32:13,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:32:13,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:32:13,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:32:13,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:32:13,798 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:32:13,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:32:13,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:32:13,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:32:13,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:32:13,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:32:13,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:32:13,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:32:13,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:32:13,799 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:32:13,799 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:32:13,799 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:32:13,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:32:13,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:32:13,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:32:13,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:32:13,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:32:13,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:32:13,800 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:32:13,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:32:13,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:32:13,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:32:13,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:32:13,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:32:13,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:32:13,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:32:13,800 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 -> 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 [2025-03-03 16:32:14,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:32:14,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:32:14,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:32:14,010 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:32:14,010 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:32:14,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-03-03 16:32:15,112 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7655a1e55/2bd8c9cdc80247c68d450b346316f995/FLAGed48f3b45 [2025-03-03 16:32:15,399 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:32:15,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-03-03 16:32:15,409 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7655a1e55/2bd8c9cdc80247c68d450b346316f995/FLAGed48f3b45 [2025-03-03 16:32:15,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7655a1e55/2bd8c9cdc80247c68d450b346316f995 [2025-03-03 16:32:15,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:32:15,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:32:15,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:32:15,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:32:15,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:32:15,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:32:15" (1/1) ... [2025-03-03 16:32:15,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@942d2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:15, skipping insertion in model container [2025-03-03 16:32:15,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:32:15" (1/1) ... [2025-03-03 16:32:15,708 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:32:15,811 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.adding.2.prop1-func-interl.c[1173,1186] [2025-03-03 16:32:15,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:32:15,959 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:32:15,966 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.adding.2.prop1-func-interl.c[1173,1186] [2025-03-03 16:32:16,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:32:16,043 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:32:16,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:16 WrapperNode [2025-03-03 16:32:16,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:32:16,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:32:16,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:32:16,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:32:16,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:16" (1/1) ... [2025-03-03 16:32:16,065 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:16" (1/1) ... [2025-03-03 16:32:16,188 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1644 [2025-03-03 16:32:16,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:32:16,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:32:16,189 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:32:16,189 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:32:16,196 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:16" (1/1) ... [2025-03-03 16:32:16,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:16" (1/1) ... [2025-03-03 16:32:16,235 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:16" (1/1) ... [2025-03-03 16:32:16,319 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:32:16,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:16" (1/1) ... [2025-03-03 16:32:16,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:16" (1/1) ... [2025-03-03 16:32:16,360 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:16" (1/1) ... [2025-03-03 16:32:16,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:16" (1/1) ... [2025-03-03 16:32:16,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:16" (1/1) ... [2025-03-03 16:32:16,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:16" (1/1) ... [2025-03-03 16:32:16,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:32:16,407 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:32:16,407 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:32:16,407 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:32:16,408 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:16" (1/1) ... [2025-03-03 16:32:16,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:32:16,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:32:16,433 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 16:32:16,435 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 16:32:16,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:32:16,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:32:16,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:32:16,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:32:16,583 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:32:16,585 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:32:18,178 INFO L? ?]: Removed 857 outVars from TransFormulas that were not future-live. [2025-03-03 16:32:18,178 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:32:18,260 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:32:18,260 INFO L336 CfgBuilder]: Removed 3 assume(true) statements. [2025-03-03 16:32:18,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:32:18 BoogieIcfgContainer [2025-03-03 16:32:18,260 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:32:18,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:32:18,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:32:18,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:32:18,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:32:15" (1/3) ... [2025-03-03 16:32:18,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223331cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:32:18, skipping insertion in model container [2025-03-03 16:32:18,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:16" (2/3) ... [2025-03-03 16:32:18,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223331cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:32:18, skipping insertion in model container [2025-03-03 16:32:18,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:32:18" (3/3) ... [2025-03-03 16:32:18,267 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-03-03 16:32:18,279 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:32:18,281 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.adding.2.prop1-func-interl.c that has 1 procedures, 597 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 16:32:18,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:32:18,363 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;@63ad7454, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:32:18,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 16:32:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand has 597 states, 595 states have (on average 1.5025210084033613) internal successors, (894), 596 states have internal predecessors, (894), 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 16:32:18,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:32:18,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:18,376 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] [2025-03-03 16:32:18,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:18,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:18,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1240092212, now seen corresponding path program 1 times [2025-03-03 16:32:18,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:18,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454354429] [2025-03-03 16:32:18,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:18,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:18,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:32:18,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:32:18,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:18,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:18,794 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 16:32:18,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:18,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454354429] [2025-03-03 16:32:18,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454354429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:18,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:18,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:32:18,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532860152] [2025-03-03 16:32:18,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:18,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:32:18,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:18,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:32:18,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:32:18,822 INFO L87 Difference]: Start difference. First operand has 597 states, 595 states have (on average 1.5025210084033613) internal successors, (894), 596 states have internal predecessors, (894), 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 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 16:32:19,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:19,144 INFO L93 Difference]: Finished difference Result 1149 states and 1724 transitions. [2025-03-03 16:32:19,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:32:19,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2025-03-03 16:32:19,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:19,158 INFO L225 Difference]: With dead ends: 1149 [2025-03-03 16:32:19,158 INFO L226 Difference]: Without dead ends: 594 [2025-03-03 16:32:19,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:32:19,165 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 858 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:19,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1470 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:32:19,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-03 16:32:19,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2025-03-03 16:32:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 1.4991568296795952) internal successors, (889), 593 states have internal predecessors, (889), 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 16:32:19,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 889 transitions. [2025-03-03 16:32:19,224 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 889 transitions. Word has length 59 [2025-03-03 16:32:19,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:19,225 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 889 transitions. [2025-03-03 16:32:19,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 16:32:19,225 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 889 transitions. [2025-03-03 16:32:19,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 16:32:19,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:19,226 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] [2025-03-03 16:32:19,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:32:19,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:19,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:19,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2124501296, now seen corresponding path program 1 times [2025-03-03 16:32:19,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:19,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962337973] [2025-03-03 16:32:19,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:19,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:19,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:32:19,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:32:19,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:19,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:19,400 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 16:32:19,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:19,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962337973] [2025-03-03 16:32:19,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962337973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:19,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:19,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:32:19,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119509232] [2025-03-03 16:32:19,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:19,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:32:19,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:19,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:32:19,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:32:19,406 INFO L87 Difference]: Start difference. First operand 594 states and 889 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 16:32:19,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:19,630 INFO L93 Difference]: Finished difference Result 1147 states and 1718 transitions. [2025-03-03 16:32:19,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:32:19,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2025-03-03 16:32:19,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:19,633 INFO L225 Difference]: With dead ends: 1147 [2025-03-03 16:32:19,633 INFO L226 Difference]: Without dead ends: 595 [2025-03-03 16:32:19,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:32:19,634 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 0 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:19,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1477 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:32:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-03 16:32:19,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2025-03-03 16:32:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.4983164983164983) internal successors, (890), 594 states have internal predecessors, (890), 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 16:32:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 890 transitions. [2025-03-03 16:32:19,647 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 890 transitions. Word has length 60 [2025-03-03 16:32:19,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:19,647 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 890 transitions. [2025-03-03 16:32:19,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 16:32:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 890 transitions. [2025-03-03 16:32:19,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 16:32:19,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:19,648 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] [2025-03-03 16:32:19,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:32:19,648 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:19,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:19,649 INFO L85 PathProgramCache]: Analyzing trace with hash -521276463, now seen corresponding path program 1 times [2025-03-03 16:32:19,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:19,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903646857] [2025-03-03 16:32:19,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:19,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:19,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:32:19,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:32:19,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:19,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:19,887 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 16:32:19,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:19,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903646857] [2025-03-03 16:32:19,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903646857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:19,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:19,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:32:19,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236063773] [2025-03-03 16:32:19,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:19,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:32:19,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:19,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:32:19,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:32:19,889 INFO L87 Difference]: Start difference. First operand 595 states and 890 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 16:32:20,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:20,134 INFO L93 Difference]: Finished difference Result 599 states and 894 transitions. [2025-03-03 16:32:20,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:32:20,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2025-03-03 16:32:20,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:20,137 INFO L225 Difference]: With dead ends: 599 [2025-03-03 16:32:20,137 INFO L226 Difference]: Without dead ends: 597 [2025-03-03 16:32:20,137 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 16:32:20,138 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 0 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:20,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2215 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:32:20,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-03 16:32:20,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2025-03-03 16:32:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.4966442953020134) internal successors, (892), 596 states have internal predecessors, (892), 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 16:32:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 892 transitions. [2025-03-03 16:32:20,154 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 892 transitions. Word has length 60 [2025-03-03 16:32:20,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:20,155 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 892 transitions. [2025-03-03 16:32:20,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 16:32:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 892 transitions. [2025-03-03 16:32:20,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 16:32:20,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:20,157 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] [2025-03-03 16:32:20,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:32:20,157 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:20,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:20,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1024978802, now seen corresponding path program 1 times [2025-03-03 16:32:20,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:20,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688540996] [2025-03-03 16:32:20,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:20,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:20,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 16:32:20,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 16:32:20,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:20,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:20,311 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 16:32:20,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:20,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688540996] [2025-03-03 16:32:20,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688540996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:20,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:20,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:32:20,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257617265] [2025-03-03 16:32:20,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:20,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:32:20,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:20,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:32:20,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:32:20,313 INFO L87 Difference]: Start difference. First operand 597 states and 892 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 16:32:20,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:20,559 INFO L93 Difference]: Finished difference Result 1154 states and 1725 transitions. [2025-03-03 16:32:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:32:20,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2025-03-03 16:32:20,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:20,562 INFO L225 Difference]: With dead ends: 1154 [2025-03-03 16:32:20,562 INFO L226 Difference]: Without dead ends: 599 [2025-03-03 16:32:20,563 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 16:32:20,563 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 0 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:20,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2212 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:32:20,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-03 16:32:20,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2025-03-03 16:32:20,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 1.4949832775919731) internal successors, (894), 598 states have internal predecessors, (894), 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 16:32:20,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 894 transitions. [2025-03-03 16:32:20,576 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 894 transitions. Word has length 61 [2025-03-03 16:32:20,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:20,577 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 894 transitions. [2025-03-03 16:32:20,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 16:32:20,577 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 894 transitions. [2025-03-03 16:32:20,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 16:32:20,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:20,579 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] [2025-03-03 16:32:20,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:32:20,580 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:20,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:20,580 INFO L85 PathProgramCache]: Analyzing trace with hash -653885460, now seen corresponding path program 1 times [2025-03-03 16:32:20,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:20,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889902300] [2025-03-03 16:32:20,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:20,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:20,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 16:32:20,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 16:32:20,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:20,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:20,707 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 16:32:20,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:20,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889902300] [2025-03-03 16:32:20,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889902300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:20,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:20,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:32:20,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826192057] [2025-03-03 16:32:20,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:20,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:32:20,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:20,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:32:20,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:32:20,709 INFO L87 Difference]: Start difference. First operand 599 states and 894 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 16:32:20,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:20,962 INFO L93 Difference]: Finished difference Result 1158 states and 1729 transitions. [2025-03-03 16:32:20,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:32:20,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2025-03-03 16:32:20,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:20,964 INFO L225 Difference]: With dead ends: 1158 [2025-03-03 16:32:20,964 INFO L226 Difference]: Without dead ends: 601 [2025-03-03 16:32:20,965 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 16:32:20,965 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 0 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:20,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2207 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:32:20,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-03 16:32:20,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-03-03 16:32:20,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 600 states have (on average 1.4933333333333334) internal successors, (896), 600 states have internal predecessors, (896), 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 16:32:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 896 transitions. [2025-03-03 16:32:20,979 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 896 transitions. Word has length 62 [2025-03-03 16:32:20,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:20,979 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 896 transitions. [2025-03-03 16:32:20,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 16:32:20,980 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 896 transitions. [2025-03-03 16:32:20,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 16:32:20,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:20,980 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] [2025-03-03 16:32:20,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:32:20,981 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:20,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:20,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1202216745, now seen corresponding path program 1 times [2025-03-03 16:32:20,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:20,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833305662] [2025-03-03 16:32:20,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:20,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:20,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 16:32:21,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 16:32:21,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:21,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:21,394 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 16:32:21,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:21,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833305662] [2025-03-03 16:32:21,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833305662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:21,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:21,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:32:21,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854033284] [2025-03-03 16:32:21,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:21,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:32:21,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:21,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:32:21,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:32:21,398 INFO L87 Difference]: Start difference. First operand 601 states and 896 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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 16:32:21,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:21,852 INFO L93 Difference]: Finished difference Result 1168 states and 1741 transitions. [2025-03-03 16:32:21,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:32:21,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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 63 [2025-03-03 16:32:21,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:21,855 INFO L225 Difference]: With dead ends: 1168 [2025-03-03 16:32:21,855 INFO L226 Difference]: Without dead ends: 609 [2025-03-03 16:32:21,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:32:21,856 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 849 mSDsluCounter, 2934 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 3673 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:21,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 3673 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:32:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-03-03 16:32:21,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2025-03-03 16:32:21,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 604 states have (on average 1.4933774834437086) internal successors, (902), 604 states have internal predecessors, (902), 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 16:32:21,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 902 transitions. [2025-03-03 16:32:21,870 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 902 transitions. Word has length 63 [2025-03-03 16:32:21,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:21,870 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 902 transitions. [2025-03-03 16:32:21,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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 16:32:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 902 transitions. [2025-03-03 16:32:21,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 16:32:21,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:21,872 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] [2025-03-03 16:32:21,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:32:21,872 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:21,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:21,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2085784839, now seen corresponding path program 1 times [2025-03-03 16:32:21,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:21,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363970763] [2025-03-03 16:32:21,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:21,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:21,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 16:32:21,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 16:32:21,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:21,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:22,056 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 16:32:22,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:22,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363970763] [2025-03-03 16:32:22,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363970763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:22,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:22,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:32:22,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456032911] [2025-03-03 16:32:22,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:22,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:32:22,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:22,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:32:22,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:32:22,059 INFO L87 Difference]: Start difference. First operand 605 states and 902 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 16:32:22,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:22,413 INFO L93 Difference]: Finished difference Result 1172 states and 1748 transitions. [2025-03-03 16:32:22,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:32:22,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 64 [2025-03-03 16:32:22,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:22,416 INFO L225 Difference]: With dead ends: 1172 [2025-03-03 16:32:22,416 INFO L226 Difference]: Without dead ends: 609 [2025-03-03 16:32:22,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:32:22,419 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 4 mSDsluCounter, 2199 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2935 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:22,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2935 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:32:22,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-03-03 16:32:22,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 607. [2025-03-03 16:32:22,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 606 states have (on average 1.4917491749174918) internal successors, (904), 606 states have internal predecessors, (904), 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 16:32:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 904 transitions. [2025-03-03 16:32:22,431 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 904 transitions. Word has length 64 [2025-03-03 16:32:22,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:22,432 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 904 transitions. [2025-03-03 16:32:22,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 16:32:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 904 transitions. [2025-03-03 16:32:22,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:32:22,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:22,433 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] [2025-03-03 16:32:22,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:32:22,433 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:22,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:22,433 INFO L85 PathProgramCache]: Analyzing trace with hash 361619516, now seen corresponding path program 1 times [2025-03-03 16:32:22,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:22,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867712928] [2025-03-03 16:32:22,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:22,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:22,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:32:22,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:32:22,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:22,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:22,638 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 16:32:22,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:22,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867712928] [2025-03-03 16:32:22,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867712928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:22,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:22,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:32:22,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575671519] [2025-03-03 16:32:22,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:22,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:32:22,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:22,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:32:22,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:32:22,640 INFO L87 Difference]: Start difference. First operand 607 states and 904 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 16:32:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:23,264 INFO L93 Difference]: Finished difference Result 1732 states and 2586 transitions. [2025-03-03 16:32:23,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:32:23,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 65 [2025-03-03 16:32:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:23,266 INFO L225 Difference]: With dead ends: 1732 [2025-03-03 16:32:23,266 INFO L226 Difference]: Without dead ends: 619 [2025-03-03 16:32:23,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:32:23,268 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 807 mSDsluCounter, 2959 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 3719 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:23,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 3719 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:32:23,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-03-03 16:32:23,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 614. [2025-03-03 16:32:23,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 613 states have (on average 1.4910277324632952) internal successors, (914), 613 states have internal predecessors, (914), 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 16:32:23,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 914 transitions. [2025-03-03 16:32:23,281 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 914 transitions. Word has length 65 [2025-03-03 16:32:23,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:23,281 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 914 transitions. [2025-03-03 16:32:23,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 16:32:23,281 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 914 transitions. [2025-03-03 16:32:23,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:32:23,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:23,282 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] [2025-03-03 16:32:23,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:32:23,284 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:23,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:23,285 INFO L85 PathProgramCache]: Analyzing trace with hash -301454720, now seen corresponding path program 1 times [2025-03-03 16:32:23,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:23,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486705647] [2025-03-03 16:32:23,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:23,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:23,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:32:23,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:32:23,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:23,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:23,414 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 16:32:23,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:23,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486705647] [2025-03-03 16:32:23,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486705647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:23,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:23,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:32:23,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242147699] [2025-03-03 16:32:23,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:23,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:32:23,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:23,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:32:23,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:32:23,416 INFO L87 Difference]: Start difference. First operand 614 states and 914 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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 16:32:23,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:23,721 INFO L93 Difference]: Finished difference Result 1213 states and 1806 transitions. [2025-03-03 16:32:23,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:32:23,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2025-03-03 16:32:23,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:23,724 INFO L225 Difference]: With dead ends: 1213 [2025-03-03 16:32:23,724 INFO L226 Difference]: Without dead ends: 641 [2025-03-03 16:32:23,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:32:23,725 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 64 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 2899 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:23,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 2899 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:32:23,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2025-03-03 16:32:23,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2025-03-03 16:32:23,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 640 states have (on average 1.4890625) internal successors, (953), 640 states have internal predecessors, (953), 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 16:32:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 953 transitions. [2025-03-03 16:32:23,735 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 953 transitions. Word has length 65 [2025-03-03 16:32:23,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:23,736 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 953 transitions. [2025-03-03 16:32:23,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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 16:32:23,736 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 953 transitions. [2025-03-03 16:32:23,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:32:23,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:23,736 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] [2025-03-03 16:32:23,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:32:23,737 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:23,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:23,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1584669916, now seen corresponding path program 1 times [2025-03-03 16:32:23,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:23,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361949254] [2025-03-03 16:32:23,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:23,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:23,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:32:23,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:32:23,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:23,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:23,923 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 16:32:23,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:23,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361949254] [2025-03-03 16:32:23,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361949254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:23,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:23,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:32:23,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551726068] [2025-03-03 16:32:23,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:23,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:32:23,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:23,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:32:23,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:32:23,925 INFO L87 Difference]: Start difference. First operand 641 states and 953 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 16:32:24,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:24,184 INFO L93 Difference]: Finished difference Result 1215 states and 1808 transitions. [2025-03-03 16:32:24,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:32:24,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2025-03-03 16:32:24,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:24,186 INFO L225 Difference]: With dead ends: 1215 [2025-03-03 16:32:24,186 INFO L226 Difference]: Without dead ends: 641 [2025-03-03 16:32:24,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:32:24,187 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 850 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:24,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1423 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:32:24,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2025-03-03 16:32:24,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2025-03-03 16:32:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 640 states have (on average 1.4875) internal successors, (952), 640 states have internal predecessors, (952), 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 16:32:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 952 transitions. [2025-03-03 16:32:24,197 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 952 transitions. Word has length 66 [2025-03-03 16:32:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:24,197 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 952 transitions. [2025-03-03 16:32:24,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 16:32:24,197 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 952 transitions. [2025-03-03 16:32:24,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:32:24,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:24,198 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] [2025-03-03 16:32:24,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:32:24,198 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:24,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:24,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1455566495, now seen corresponding path program 1 times [2025-03-03 16:32:24,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:24,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406227777] [2025-03-03 16:32:24,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:24,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:24,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:32:24,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:32:24,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:24,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:24,364 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 16:32:24,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:24,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406227777] [2025-03-03 16:32:24,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406227777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:24,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:24,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:32:24,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336445471] [2025-03-03 16:32:24,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:24,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:32:24,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:24,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:32:24,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:32:24,365 INFO L87 Difference]: Start difference. First operand 641 states and 952 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 16:32:24,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:24,624 INFO L93 Difference]: Finished difference Result 1212 states and 1803 transitions. [2025-03-03 16:32:24,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:32:24,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2025-03-03 16:32:24,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:24,627 INFO L225 Difference]: With dead ends: 1212 [2025-03-03 16:32:24,627 INFO L226 Difference]: Without dead ends: 640 [2025-03-03 16:32:24,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:32:24,628 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 849 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:24,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1399 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:32:24,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-03 16:32:24,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 634. [2025-03-03 16:32:24,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 1.481832543443918) internal successors, (938), 633 states have internal predecessors, (938), 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 16:32:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 938 transitions. [2025-03-03 16:32:24,640 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 938 transitions. Word has length 66 [2025-03-03 16:32:24,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:24,641 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 938 transitions. [2025-03-03 16:32:24,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 16:32:24,641 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 938 transitions. [2025-03-03 16:32:24,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:32:24,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:24,642 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] [2025-03-03 16:32:24,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:32:24,642 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:24,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:24,643 INFO L85 PathProgramCache]: Analyzing trace with hash 995726229, now seen corresponding path program 1 times [2025-03-03 16:32:24,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:24,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037741646] [2025-03-03 16:32:24,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:24,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:24,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:32:24,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:32:24,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:24,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:24,745 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 16:32:24,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:24,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037741646] [2025-03-03 16:32:24,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037741646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:24,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:24,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:32:24,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218745607] [2025-03-03 16:32:24,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:24,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:32:24,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:24,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:32:24,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:32:24,746 INFO L87 Difference]: Start difference. First operand 634 states and 938 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 16:32:24,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:24,937 INFO L93 Difference]: Finished difference Result 1198 states and 1774 transitions. [2025-03-03 16:32:24,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:32:24,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2025-03-03 16:32:24,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:24,940 INFO L225 Difference]: With dead ends: 1198 [2025-03-03 16:32:24,940 INFO L226 Difference]: Without dead ends: 633 [2025-03-03 16:32:24,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:32:24,941 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 843 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:24,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1461 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:32:24,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-03 16:32:24,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2025-03-03 16:32:24,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.481012658227848) internal successors, (936), 632 states have internal predecessors, (936), 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 16:32:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 936 transitions. [2025-03-03 16:32:24,951 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 936 transitions. Word has length 66 [2025-03-03 16:32:24,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:24,951 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 936 transitions. [2025-03-03 16:32:24,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 16:32:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 936 transitions. [2025-03-03 16:32:24,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:32:24,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:24,952 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] [2025-03-03 16:32:24,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:32:24,952 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:24,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:24,953 INFO L85 PathProgramCache]: Analyzing trace with hash -392977968, now seen corresponding path program 1 times [2025-03-03 16:32:24,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:24,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427560503] [2025-03-03 16:32:24,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:24,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:24,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:32:24,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:32:24,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:24,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:25,323 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 16:32:25,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:25,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427560503] [2025-03-03 16:32:25,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427560503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:25,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:25,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 16:32:25,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581717623] [2025-03-03 16:32:25,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:25,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 16:32:25,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:25,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 16:32:25,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:32:25,324 INFO L87 Difference]: Start difference. First operand 633 states and 936 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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 16:32:26,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:26,108 INFO L93 Difference]: Finished difference Result 1213 states and 1793 transitions. [2025-03-03 16:32:26,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:32:26,108 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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 67 [2025-03-03 16:32:26,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:26,110 INFO L225 Difference]: With dead ends: 1213 [2025-03-03 16:32:26,110 INFO L226 Difference]: Without dead ends: 649 [2025-03-03 16:32:26,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-03 16:32:26,113 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 867 mSDsluCounter, 4947 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 5670 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:26,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 5670 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:32:26,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-03 16:32:26,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 644. [2025-03-03 16:32:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 1.4758942457231727) internal successors, (949), 643 states have internal predecessors, (949), 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 16:32:26,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 949 transitions. [2025-03-03 16:32:26,124 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 949 transitions. Word has length 67 [2025-03-03 16:32:26,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:26,125 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 949 transitions. [2025-03-03 16:32:26,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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 16:32:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 949 transitions. [2025-03-03 16:32:26,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:32:26,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:26,126 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] [2025-03-03 16:32:26,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:32:26,126 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:26,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:26,127 INFO L85 PathProgramCache]: Analyzing trace with hash -238603690, now seen corresponding path program 1 times [2025-03-03 16:32:26,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:26,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561612948] [2025-03-03 16:32:26,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:26,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:26,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:32:26,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:32:26,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:26,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:26,267 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 16:32:26,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:26,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561612948] [2025-03-03 16:32:26,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561612948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:26,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:26,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:32:26,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550019023] [2025-03-03 16:32:26,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:26,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:32:26,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:26,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:32:26,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:32:26,268 INFO L87 Difference]: Start difference. First operand 644 states and 949 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 16:32:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:26,745 INFO L93 Difference]: Finished difference Result 1223 states and 1803 transitions. [2025-03-03 16:32:26,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:32:26,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 67 [2025-03-03 16:32:26,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:26,749 INFO L225 Difference]: With dead ends: 1223 [2025-03-03 16:32:26,749 INFO L226 Difference]: Without dead ends: 648 [2025-03-03 16:32:26,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:32:26,752 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 9 mSDsluCounter, 2875 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3601 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:26,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3601 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:32:26,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-03-03 16:32:26,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 645. [2025-03-03 16:32:26,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.4751552795031055) internal successors, (950), 644 states have internal predecessors, (950), 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 16:32:26,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 950 transitions. [2025-03-03 16:32:26,768 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 950 transitions. Word has length 67 [2025-03-03 16:32:26,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:26,768 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 950 transitions. [2025-03-03 16:32:26,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 16:32:26,769 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 950 transitions. [2025-03-03 16:32:26,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:32:26,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:26,770 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] [2025-03-03 16:32:26,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:32:26,770 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:26,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:26,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1947501186, now seen corresponding path program 1 times [2025-03-03 16:32:26,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:26,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414726726] [2025-03-03 16:32:26,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:26,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:26,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:32:26,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:32:26,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:26,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:27,124 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 16:32:27,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:27,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414726726] [2025-03-03 16:32:27,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414726726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:27,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:27,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 16:32:27,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633804069] [2025-03-03 16:32:27,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:27,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 16:32:27,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:27,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 16:32:27,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:32:27,125 INFO L87 Difference]: Start difference. First operand 645 states and 950 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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 16:32:27,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:27,860 INFO L93 Difference]: Finished difference Result 1232 states and 1814 transitions. [2025-03-03 16:32:27,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:32:27,860 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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 68 [2025-03-03 16:32:27,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:27,862 INFO L225 Difference]: With dead ends: 1232 [2025-03-03 16:32:27,863 INFO L226 Difference]: Without dead ends: 656 [2025-03-03 16:32:27,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-03 16:32:27,866 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 865 mSDsluCounter, 4950 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 5674 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:27,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 5674 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:32:27,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2025-03-03 16:32:27,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 648. [2025-03-03 16:32:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 647 states have (on average 1.474497681607419) internal successors, (954), 647 states have internal predecessors, (954), 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 16:32:27,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 954 transitions. [2025-03-03 16:32:27,876 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 954 transitions. Word has length 68 [2025-03-03 16:32:27,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:27,877 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 954 transitions. [2025-03-03 16:32:27,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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 16:32:27,877 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 954 transitions. [2025-03-03 16:32:27,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:32:27,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:27,878 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] [2025-03-03 16:32:27,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:32:27,880 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:27,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:27,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1568665234, now seen corresponding path program 1 times [2025-03-03 16:32:27,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:27,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147765808] [2025-03-03 16:32:27,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:27,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:27,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:32:27,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:32:27,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:27,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:28,064 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 16:32:28,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:28,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147765808] [2025-03-03 16:32:28,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147765808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:28,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:28,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:32:28,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681615716] [2025-03-03 16:32:28,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:28,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:32:28,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:28,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:32:28,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:32:28,067 INFO L87 Difference]: Start difference. First operand 648 states and 954 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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 16:32:28,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:28,552 INFO L93 Difference]: Finished difference Result 1236 states and 1818 transitions. [2025-03-03 16:32:28,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:32:28,552 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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 69 [2025-03-03 16:32:28,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:28,554 INFO L225 Difference]: With dead ends: 1236 [2025-03-03 16:32:28,554 INFO L226 Difference]: Without dead ends: 657 [2025-03-03 16:32:28,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:32:28,555 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 6 mSDsluCounter, 4300 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5020 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:28,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5020 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:32:28,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-03-03 16:32:28,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 655. [2025-03-03 16:32:28,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 654 states have (on average 1.470948012232416) internal successors, (962), 654 states have internal predecessors, (962), 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 16:32:28,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 962 transitions. [2025-03-03 16:32:28,566 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 962 transitions. Word has length 69 [2025-03-03 16:32:28,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:28,567 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 962 transitions. [2025-03-03 16:32:28,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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 16:32:28,567 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 962 transitions. [2025-03-03 16:32:28,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:32:28,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:28,569 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] [2025-03-03 16:32:28,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:32:28,569 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:28,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:28,570 INFO L85 PathProgramCache]: Analyzing trace with hash 397558025, now seen corresponding path program 1 times [2025-03-03 16:32:28,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:28,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744138299] [2025-03-03 16:32:28,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:28,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:28,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:32:28,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:32:28,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:28,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:28,688 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 16:32:28,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:28,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744138299] [2025-03-03 16:32:28,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744138299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:28,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:28,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:32:28,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602986812] [2025-03-03 16:32:28,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:28,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:32:28,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:28,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:32:28,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:32:28,690 INFO L87 Difference]: Start difference. First operand 655 states and 962 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 16:32:29,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:29,465 INFO L93 Difference]: Finished difference Result 1772 states and 2604 transitions. [2025-03-03 16:32:29,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:32:29,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 69 [2025-03-03 16:32:29,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:29,468 INFO L225 Difference]: With dead ends: 1772 [2025-03-03 16:32:29,469 INFO L226 Difference]: Without dead ends: 1186 [2025-03-03 16:32:29,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:32:29,470 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 796 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 2179 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:29,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 2179 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:32:29,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2025-03-03 16:32:29,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 708. [2025-03-03 16:32:29,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 707 states have (on average 1.454031117397454) internal successors, (1028), 707 states have internal predecessors, (1028), 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 16:32:29,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1028 transitions. [2025-03-03 16:32:29,483 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1028 transitions. Word has length 69 [2025-03-03 16:32:29,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:29,483 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 1028 transitions. [2025-03-03 16:32:29,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 16:32:29,483 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1028 transitions. [2025-03-03 16:32:29,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 16:32:29,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:29,484 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] [2025-03-03 16:32:29,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:32:29,485 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:29,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:29,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2043094374, now seen corresponding path program 1 times [2025-03-03 16:32:29,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:29,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415712704] [2025-03-03 16:32:29,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:29,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:29,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 16:32:29,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 16:32:29,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:29,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:29,884 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 16:32:29,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:29,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415712704] [2025-03-03 16:32:29,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415712704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:29,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:29,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 16:32:29,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788626258] [2025-03-03 16:32:29,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:29,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:32:29,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:29,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:32:29,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:32:29,886 INFO L87 Difference]: Start difference. First operand 708 states and 1028 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 16:32:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:30,585 INFO L93 Difference]: Finished difference Result 1839 states and 2698 transitions. [2025-03-03 16:32:30,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:32:30,586 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2025-03-03 16:32:30,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:30,589 INFO L225 Difference]: With dead ends: 1839 [2025-03-03 16:32:30,589 INFO L226 Difference]: Without dead ends: 1234 [2025-03-03 16:32:30,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-03 16:32:30,591 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 2320 mSDsluCounter, 2772 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2320 SdHoareTripleChecker+Valid, 3472 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:30,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2320 Valid, 3472 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:32:30,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2025-03-03 16:32:30,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 724. [2025-03-03 16:32:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 723 states have (on average 1.4439834024896265) internal successors, (1044), 723 states have internal predecessors, (1044), 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 16:32:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1044 transitions. [2025-03-03 16:32:30,602 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1044 transitions. Word has length 70 [2025-03-03 16:32:30,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:30,603 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1044 transitions. [2025-03-03 16:32:30,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 16:32:30,603 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1044 transitions. [2025-03-03 16:32:30,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 16:32:30,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:30,603 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] [2025-03-03 16:32:30,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:32:30,604 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:30,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:30,604 INFO L85 PathProgramCache]: Analyzing trace with hash 862526448, now seen corresponding path program 1 times [2025-03-03 16:32:30,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:30,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558111473] [2025-03-03 16:32:30,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:30,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:30,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 16:32:30,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 16:32:30,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:30,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:30,909 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 16:32:30,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:30,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558111473] [2025-03-03 16:32:30,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558111473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:30,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:30,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:32:30,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72507049] [2025-03-03 16:32:30,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:30,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:32:30,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:30,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:32:30,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:32:30,911 INFO L87 Difference]: Start difference. First operand 724 states and 1044 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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 16:32:31,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:31,489 INFO L93 Difference]: Finished difference Result 1329 states and 1927 transitions. [2025-03-03 16:32:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:32:31,490 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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 71 [2025-03-03 16:32:31,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:31,492 INFO L225 Difference]: With dead ends: 1329 [2025-03-03 16:32:31,492 INFO L226 Difference]: Without dead ends: 735 [2025-03-03 16:32:31,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:32:31,493 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 1647 mSDsluCounter, 2803 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1647 SdHoareTripleChecker+Valid, 3513 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:31,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1647 Valid, 3513 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:32:31,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-03-03 16:32:31,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 724. [2025-03-03 16:32:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 723 states have (on average 1.4439834024896265) internal successors, (1044), 723 states have internal predecessors, (1044), 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 16:32:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1044 transitions. [2025-03-03 16:32:31,506 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1044 transitions. Word has length 71 [2025-03-03 16:32:31,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:31,506 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1044 transitions. [2025-03-03 16:32:31,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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 16:32:31,507 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1044 transitions. [2025-03-03 16:32:31,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 16:32:31,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:31,507 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] [2025-03-03 16:32:31,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:32:31,508 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:31,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:31,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1628096754, now seen corresponding path program 1 times [2025-03-03 16:32:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:31,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359376409] [2025-03-03 16:32:31,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:31,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:31,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 16:32:31,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 16:32:31,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:31,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:31,725 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 16:32:31,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:31,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359376409] [2025-03-03 16:32:31,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359376409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:31,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:31,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:32:31,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175288922] [2025-03-03 16:32:31,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:31,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:32:31,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:31,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:32:31,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:32:31,731 INFO L87 Difference]: Start difference. First operand 724 states and 1044 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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 16:32:32,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:32,323 INFO L93 Difference]: Finished difference Result 1357 states and 1961 transitions. [2025-03-03 16:32:32,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:32:32,323 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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 72 [2025-03-03 16:32:32,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:32,325 INFO L225 Difference]: With dead ends: 1357 [2025-03-03 16:32:32,325 INFO L226 Difference]: Without dead ends: 734 [2025-03-03 16:32:32,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:32:32,328 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 869 mSDsluCounter, 3467 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 4163 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:32,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 4163 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:32:32,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-03-03 16:32:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 727. [2025-03-03 16:32:32,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 1.440771349862259) internal successors, (1046), 726 states have internal predecessors, (1046), 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 16:32:32,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1046 transitions. [2025-03-03 16:32:32,342 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1046 transitions. Word has length 72 [2025-03-03 16:32:32,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:32,342 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1046 transitions. [2025-03-03 16:32:32,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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 16:32:32,342 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1046 transitions. [2025-03-03 16:32:32,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 16:32:32,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:32,343 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] [2025-03-03 16:32:32,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:32:32,343 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:32,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:32,344 INFO L85 PathProgramCache]: Analyzing trace with hash -653069153, now seen corresponding path program 1 times [2025-03-03 16:32:32,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:32,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932474151] [2025-03-03 16:32:32,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:32,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:32,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 16:32:32,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 16:32:32,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:32,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:32,498 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 16:32:32,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:32,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932474151] [2025-03-03 16:32:32,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932474151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:32,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:32,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:32:32,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136491391] [2025-03-03 16:32:32,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:32,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:32:32,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:32,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:32:32,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:32:32,499 INFO L87 Difference]: Start difference. First operand 727 states and 1046 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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 16:32:32,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:32,960 INFO L93 Difference]: Finished difference Result 1342 states and 1942 transitions. [2025-03-03 16:32:32,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:32:32,961 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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 72 [2025-03-03 16:32:32,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:32,963 INFO L225 Difference]: With dead ends: 1342 [2025-03-03 16:32:32,963 INFO L226 Difference]: Without dead ends: 734 [2025-03-03 16:32:32,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:32:32,964 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 5 mSDsluCounter, 4330 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5057 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:32,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5057 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:32:32,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-03-03 16:32:32,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 717. [2025-03-03 16:32:32,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 716 states have (on average 1.446927374301676) internal successors, (1036), 716 states have internal predecessors, (1036), 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 16:32:32,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1036 transitions. [2025-03-03 16:32:32,972 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1036 transitions. Word has length 72 [2025-03-03 16:32:32,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:32,972 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 1036 transitions. [2025-03-03 16:32:32,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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 16:32:32,972 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1036 transitions. [2025-03-03 16:32:32,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 16:32:32,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:32,973 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] [2025-03-03 16:32:32,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:32:32,973 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:32,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:32,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1305132766, now seen corresponding path program 1 times [2025-03-03 16:32:32,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:32,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033350991] [2025-03-03 16:32:32,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:32,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:32,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 16:32:32,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 16:32:32,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:32,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:33,083 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 16:32:33,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:32:33,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033350991] [2025-03-03 16:32:33,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033350991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:33,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:33,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:32:33,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399616587] [2025-03-03 16:32:33,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:33,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:32:33,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:33,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:32:33,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:32:33,084 INFO L87 Difference]: Start difference. First operand 717 states and 1036 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 16:32:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:33,300 INFO L93 Difference]: Finished difference Result 1327 states and 1926 transitions. [2025-03-03 16:32:33,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:32:33,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 72 [2025-03-03 16:32:33,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:33,305 INFO L225 Difference]: With dead ends: 1327 [2025-03-03 16:32:33,305 INFO L226 Difference]: Without dead ends: 717 [2025-03-03 16:32:33,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:32:33,308 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 871 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:33,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1407 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:32:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-03-03 16:32:33,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2025-03-03 16:32:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 716 states have (on average 1.4441340782122905) internal successors, (1034), 716 states have internal predecessors, (1034), 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 16:32:33,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1034 transitions. [2025-03-03 16:32:33,316 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1034 transitions. Word has length 72 [2025-03-03 16:32:33,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:33,316 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 1034 transitions. [2025-03-03 16:32:33,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 16:32:33,316 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1034 transitions. [2025-03-03 16:32:33,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 16:32:33,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:33,317 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] [2025-03-03 16:32:33,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:32:33,317 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:33,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:33,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1401889378, now seen corresponding path program 1 times [2025-03-03 16:32:33,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:32:33,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293698964] [2025-03-03 16:32:33,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:33,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:32:33,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 16:32:33,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 16:32:33,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:33,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 16:32:33,343 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 16:32:33,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 16:32:33,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 16:32:33,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:33,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 16:32:33,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 16:32:33,406 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 16:32:33,406 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 16:32:33,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 16:32:33,410 INFO L422 BasicCegarLoop]: Path program histogram: [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 16:32:33,443 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 16:32:33,456 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 16:32:33,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 04:32:33 BoogieIcfgContainer [2025-03-03 16:32:33,459 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 16:32:33,459 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 16:32:33,459 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 16:32:33,459 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 16:32:33,460 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:32:18" (3/4) ... [2025-03-03 16:32:33,462 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 16:32:33,462 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 16:32:33,463 INFO L158 Benchmark]: Toolchain (without parser) took 17781.94ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 110.8MB in the beginning and 122.1MB in the end (delta: -11.3MB). Peak memory consumption was 102.1MB. Max. memory is 16.1GB. [2025-03-03 16:32:33,463 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 16:32:33,463 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.15ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 84.5MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 16:32:33,463 INFO L158 Benchmark]: Boogie Procedure Inliner took 143.42ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 45.3MB in the end (delta: 39.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 16:32:33,463 INFO L158 Benchmark]: Boogie Preprocessor took 217.31ms. Allocated memory is still 142.6MB. Free memory was 45.3MB in the beginning and 78.4MB in the end (delta: -33.1MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2025-03-03 16:32:33,464 INFO L158 Benchmark]: IcfgBuilder took 1853.69ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 78.4MB in the beginning and 54.7MB in the end (delta: 23.7MB). Peak memory consumption was 149.4MB. Max. memory is 16.1GB. [2025-03-03 16:32:33,464 INFO L158 Benchmark]: TraceAbstraction took 15196.84ms. Allocated memory is still 251.7MB. Free memory was 54.1MB in the beginning and 122.1MB in the end (delta: -68.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 16:32:33,464 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 251.7MB. Free memory was 122.1MB in the beginning and 122.1MB in the end (delta: 21.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 16:32:33,465 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.15ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 84.5MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 143.42ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 45.3MB in the end (delta: 39.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 217.31ms. Allocated memory is still 142.6MB. Free memory was 45.3MB in the beginning and 78.4MB in the end (delta: -33.1MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * IcfgBuilder took 1853.69ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 78.4MB in the beginning and 54.7MB in the end (delta: 23.7MB). Peak memory consumption was 149.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15196.84ms. Allocated memory is still 251.7MB. Free memory was 54.1MB in the beginning and 122.1MB in the end (delta: -68.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 251.7MB. Free memory was 122.1MB in the beginning and 122.1MB in the end (delta: 21.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 109, overapproximation of bitwiseAnd at line 107, overapproximation of bitwiseAnd at line 116, overapproximation of bitwiseAnd at line 111, overapproximation of bitwiseAnd at line 110. 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_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 5); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (5 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 16); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_3 var_5 = 0; [L39] const SORT_1 var_12 = 0; [L40] const SORT_4 var_27 = 500; [L41] const SORT_3 var_28 = 1; [L42] const SORT_3 var_30 = 0; [L43] const SORT_4 var_32 = 16; [L44] const SORT_4 var_79 = 200; [L46] SORT_1 input_37; [L47] SORT_1 input_38; [L48] SORT_1 input_43; [L49] SORT_1 input_48; [L50] SORT_1 input_52; [L51] SORT_1 input_57; [L53] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=65535, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L53] SORT_3 state_6 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L54] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=65535, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L54] SORT_3 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L55] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L55] SORT_3 state_10 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L56] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L57] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L58] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L59] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L60] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L61] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L62] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] SORT_3 init_7_arg_1 = var_5; [L65] state_6 = init_7_arg_1 [L66] SORT_3 init_9_arg_1 = var_5; [L67] state_8 = init_9_arg_1 [L68] SORT_3 init_11_arg_1 = var_5; [L69] state_10 = init_11_arg_1 [L70] SORT_1 init_14_arg_1 = var_12; [L71] state_13 = init_14_arg_1 [L72] SORT_1 init_16_arg_1 = var_12; [L73] state_15 = init_16_arg_1 [L74] SORT_1 init_18_arg_1 = var_12; [L75] state_17 = init_18_arg_1 [L76] SORT_1 init_20_arg_1 = var_12; [L77] state_19 = init_20_arg_1 [L78] SORT_1 init_22_arg_1 = var_12; [L79] state_21 = init_22_arg_1 [L80] SORT_1 init_24_arg_1 = var_12; [L81] state_23 = init_24_arg_1 [L82] SORT_1 init_26_arg_1 = var_12; [L83] state_25 = init_26_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L86] input_37 = __VERIFIER_nondet_uchar() [L87] EXPR input_37 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L87] input_37 = input_37 & mask_SORT_1 [L88] input_38 = __VERIFIER_nondet_uchar() [L89] EXPR input_38 & mask_SORT_1 VAL [input_37=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L89] input_38 = input_38 & mask_SORT_1 [L90] input_43 = __VERIFIER_nondet_uchar() [L91] EXPR input_43 & mask_SORT_1 VAL [input_37=0, input_38=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L91] input_43 = input_43 & mask_SORT_1 [L92] input_48 = __VERIFIER_nondet_uchar() [L93] EXPR input_48 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L93] input_48 = input_48 & mask_SORT_1 [L94] input_52 = __VERIFIER_nondet_uchar() [L95] EXPR input_52 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L95] input_52 = input_52 & mask_SORT_1 [L96] input_57 = __VERIFIER_nondet_uchar() [L97] EXPR input_57 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L97] input_57 = input_57 & mask_SORT_1 [L100] SORT_3 var_29_arg_0 = var_28; [L101] SORT_3 var_29_arg_1 = state_6; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_32=16, var_79=200] [L102] EXPR var_29_arg_0 ^ var_29_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L102] SORT_3 var_29 = var_29_arg_0 ^ var_29_arg_1; [L103] SORT_3 var_31_arg_0 = var_29; [L104] SORT_3 var_31_arg_1 = var_30; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_79=200] [L105] EXPR ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_79=200] [L105] SORT_4 var_31 = ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1; [L106] SORT_4 var_33_arg_0 = var_31; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=200] [L107] EXPR var_33_arg_0 & msb_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=200] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=200] [L107] EXPR var_33_arg_0 | ~mask_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_79=200] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_79=200] [L107] var_33_arg_0 = (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) [L108] SORT_4 var_33_arg_1 = var_32; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_33_arg_1=16, var_79=200] [L109] EXPR (int)var_33_arg_0 >> var_33_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_33_arg_1=16, var_79=200] [L109] SORT_4 var_33 = (int)var_33_arg_0 >> var_33_arg_1; [L110] EXPR var_33_arg_0 & msb_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=-4294966796, var_33_arg_1=16, var_79=200] [L110] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_1=16, var_79=200] [L110] var_33 = (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 [L111] EXPR var_33 & mask_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_1=16, var_79=200] [L111] var_33 = var_33 & mask_SORT_4 [L112] SORT_4 var_34_arg_0 = var_27; [L113] SORT_4 var_34_arg_1 = var_33; [L114] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L115] SORT_1 var_35_arg_0 = ~state_25; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_34=1, var_35_arg_0=-1, var_79=200] [L116] EXPR var_35_arg_0 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_34=1, var_79=200] [L116] var_35_arg_0 = var_35_arg_0 & mask_SORT_1 [L117] SORT_1 var_35_arg_1 = var_34; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_35_arg_0=1, var_35_arg_1=1, var_79=200] [L118] EXPR var_35_arg_0 & var_35_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_79=200] [L118] SORT_1 var_35 = var_35_arg_0 & var_35_arg_1; [L119] EXPR var_35 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_79=200] [L119] var_35 = var_35 & mask_SORT_1 [L120] SORT_1 bad_36_arg_0 = var_35; [L121] CALL __VERIFIER_assert(!(bad_36_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 597 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13379 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13379 mSDsluCounter, 66846 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51029 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16426 IncrementalHoareTripleChecker+Invalid, 16462 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 15817 mSDtfsCounter, 16426 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=727occurred in iteration=20, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 1058 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1527 NumberOfCodeBlocks, 1527 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1432 ConstructedInterpolants, 0 QuantifiedInterpolants, 5273 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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 16:32:33,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.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 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:32:35,321 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:32:35,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 16:32:35,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:32:35,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:32:35,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:32:35,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:32:35,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:32:35,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:32:35,421 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:32:35,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:32:35,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:32:35,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:32:35,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:32:35,422 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:32:35,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:32:35,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:32:35,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:32:35,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:32:35,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:32:35,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:32:35,423 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 16:32:35,423 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 16:32:35,423 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 16:32:35,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:32:35,423 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:32:35,423 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:32:35,423 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:32:35,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:32:35,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:32:35,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:32:35,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:32:35,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:32:35,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:32:35,424 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:32:35,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:32:35,424 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 16:32:35,424 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 16:32:35,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:32:35,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:32:35,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:32:35,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:32:35,424 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 -> 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 [2025-03-03 16:32:35,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:32:35,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:32:35,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:32:35,678 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:32:35,678 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:32:35,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-03-03 16:32:36,839 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c48c78695/6d823250164c4665b58e112928783d9d/FLAG721c208bc [2025-03-03 16:32:37,052 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:32:37,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-03-03 16:32:37,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c48c78695/6d823250164c4665b58e112928783d9d/FLAG721c208bc [2025-03-03 16:32:37,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c48c78695/6d823250164c4665b58e112928783d9d [2025-03-03 16:32:37,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:32:37,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:32:37,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:32:37,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:32:37,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:32:37,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:32:37" (1/1) ... [2025-03-03 16:32:37,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@109ffd45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:37, skipping insertion in model container [2025-03-03 16:32:37,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:32:37" (1/1) ... [2025-03-03 16:32:37,441 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:32:37,570 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.adding.2.prop1-func-interl.c[1173,1186] [2025-03-03 16:32:37,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:32:37,682 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:32:37,689 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.adding.2.prop1-func-interl.c[1173,1186] [2025-03-03 16:32:37,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:32:37,756 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:32:37,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:37 WrapperNode [2025-03-03 16:32:37,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:32:37,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:32:37,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:32:37,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:32:37,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:37" (1/1) ... [2025-03-03 16:32:37,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:37" (1/1) ... [2025-03-03 16:32:37,801 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 452 [2025-03-03 16:32:37,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:32:37,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:32:37,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:32:37,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:32:37,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:37" (1/1) ... [2025-03-03 16:32:37,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:37" (1/1) ... [2025-03-03 16:32:37,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:37" (1/1) ... [2025-03-03 16:32:37,829 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:32:37,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:37" (1/1) ... [2025-03-03 16:32:37,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:37" (1/1) ... [2025-03-03 16:32:37,838 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:37" (1/1) ... [2025-03-03 16:32:37,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:37" (1/1) ... [2025-03-03 16:32:37,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:37" (1/1) ... [2025-03-03 16:32:37,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:37" (1/1) ... [2025-03-03 16:32:37,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:32:37,859 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:32:37,859 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:32:37,859 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:32:37,859 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:37" (1/1) ... [2025-03-03 16:32:37,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:32:37,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:32:37,887 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 16:32:37,894 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 16:32:37,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:32:37,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 16:32:37,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:32:37,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:32:38,045 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:32:38,047 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:32:38,463 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-03-03 16:32:38,463 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:32:38,470 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:32:38,470 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:32:38,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:32:38 BoogieIcfgContainer [2025-03-03 16:32:38,471 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:32:38,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:32:38,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:32:38,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:32:38,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:32:37" (1/3) ... [2025-03-03 16:32:38,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a856a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:32:38, skipping insertion in model container [2025-03-03 16:32:38,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:32:37" (2/3) ... [2025-03-03 16:32:38,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a856a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:32:38, skipping insertion in model container [2025-03-03 16:32:38,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:32:38" (3/3) ... [2025-03-03 16:32:38,478 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-03-03 16:32:38,488 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:32:38,489 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.adding.2.prop1-func-interl.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 16:32:38,520 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:32:38,526 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;@231360ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:32:38,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 16:32:38,529 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 16:32:38,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 16:32:38,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:38,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 16:32:38,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:38,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:38,537 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 16:32:38,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 16:32:38,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [306269851] [2025-03-03 16:32:38,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:38,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:38,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:32:38,548 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 16:32:38,549 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 16:32:38,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 16:32:38,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 16:32:38,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:38,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:38,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 16:32:38,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:32:39,006 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 16:32:39,006 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:32:39,007 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 16:32:39,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306269851] [2025-03-03 16:32:39,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306269851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:32:39,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:32:39,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:32:39,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954387311] [2025-03-03 16:32:39,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:32:39,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:32:39,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 16:32:39,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:32:39,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:32:39,030 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 16:32:39,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:32:39,075 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-03-03 16:32:39,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:32:39,079 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 16:32:39,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:32:39,083 INFO L225 Difference]: With dead ends: 17 [2025-03-03 16:32:39,083 INFO L226 Difference]: Without dead ends: 9 [2025-03-03 16:32:39,084 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 16:32:39,087 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:32:39,089 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.0s Time] [2025-03-03 16:32:39,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-03 16:32:39,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-03 16:32:39,105 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 16:32:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 16:32:39,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 16:32:39,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:32:39,109 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 16:32:39,109 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 16:32:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 16:32:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 16:32:39,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:32:39,109 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 16:32:39,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 16:32:39,310 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 16:32:39,310 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:32:39,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:32:39,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 16:32:39,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 16:32:39,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459955479] [2025-03-03 16:32:39,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:32:39,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:32:39,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:32:39,313 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 16:32:39,315 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 16:32:39,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 16:32:39,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 16:32:39,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:32:39,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:32:39,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-03 16:32:39,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:32:41,898 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 16:32:41,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:33:37,270 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 16:33:37,271 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 16:33:37,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459955479] [2025-03-03 16:33:37,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459955479] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:33:37,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:33:37,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-03 16:33:37,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493394607] [2025-03-03 16:33:37,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 16:33:37,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 16:33:37,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 16:33:37,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 16:33:37,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=96, Unknown=5, NotChecked=0, Total=132 [2025-03-03 16:33:37,273 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)