./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2018/Problem13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/eca-rers2018/Problem13.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 39257b2f2790dc593eb015569e826a332fcc3e3cd918d00daa305f748c1b3d75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:15:06,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:15:06,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:15:06,086 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:15:06,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:15:06,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:15:06,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:15:06,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:15:06,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:15:06,108 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:15:06,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:15:06,108 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:15:06,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:15:06,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:15:06,109 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:15:06,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:15:06,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:15:06,109 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:15:06,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:15:06,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:15:06,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:15:06,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:15:06,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:15:06,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:15:06,110 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:15:06,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:15:06,110 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:15:06,110 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:15:06,110 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:15:06,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:15:06,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:15:06,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:15:06,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:15:06,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:15:06,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:15:06,111 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:15:06,111 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:15:06,111 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:15:06,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:15:06,111 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:15:06,111 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:15:06,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:15:06,111 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:15:06,111 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 39257b2f2790dc593eb015569e826a332fcc3e3cd918d00daa305f748c1b3d75 [2025-03-03 11:15:06,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:15:06,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:15:06,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:15:06,341 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:15:06,342 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:15:06,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2018/Problem13.c [2025-03-03 11:15:07,496 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db70c5ec/bdf8193f31f84639b1ddaf7205867148/FLAG21693157c [2025-03-03 11:15:08,442 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:15:08,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c [2025-03-03 11:15:08,536 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db70c5ec/bdf8193f31f84639b1ddaf7205867148/FLAG21693157c [2025-03-03 11:15:08,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db70c5ec/bdf8193f31f84639b1ddaf7205867148 [2025-03-03 11:15:08,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:15:08,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:15:08,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:15:08,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:15:08,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:15:08,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:08" (1/1) ... [2025-03-03 11:15:08,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@507f0eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:08, skipping insertion in model container [2025-03-03 11:15:08,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:08" (1/1) ... [2025-03-03 11:15:08,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:15:09,254 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/eca-rers2018/Problem13.c[778,791] [2025-03-03 11:15:09,278 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/eca-rers2018/Problem13.c[817,830] [2025-03-03 11:15:22,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:15:22,865 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:15:22,876 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/eca-rers2018/Problem13.c[778,791] [2025-03-03 11:15:22,876 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/eca-rers2018/Problem13.c[817,830] [2025-03-03 11:15:23,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:15:24,339 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:15:24,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:24 WrapperNode [2025-03-03 11:15:24,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:15:24,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:15:24,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:15:24,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:15:24,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:24" (1/1) ... [2025-03-03 11:15:24,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:24" (1/1) ... [2025-03-03 11:15:25,480 INFO L138 Inliner]: procedures = 710, calls = 701, calls flagged for inlining = 597, calls inlined = 597, statements flattened = 108777 [2025-03-03 11:15:25,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:15:25,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:15:25,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:15:25,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:15:25,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:24" (1/1) ... [2025-03-03 11:15:25,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:24" (1/1) ... [2025-03-03 11:15:25,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:24" (1/1) ... [2025-03-03 11:15:25,879 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 11:15:25,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:24" (1/1) ... [2025-03-03 11:15:25,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:24" (1/1) ... [2025-03-03 11:15:26,221 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:24" (1/1) ... [2025-03-03 11:15:26,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:24" (1/1) ... [2025-03-03 11:15:26,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:24" (1/1) ... [2025-03-03 11:15:26,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:24" (1/1) ... [2025-03-03 11:15:26,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:15:26,517 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:15:26,517 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:15:26,517 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:15:26,518 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:24" (1/1) ... [2025-03-03 11:15:26,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:15:26,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:15:26,543 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 11:15:26,741 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 11:15:26,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:15:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:15:26,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:15:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2025-03-03 11:15:26,754 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2025-03-03 11:15:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2025-03-03 11:15:26,754 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2025-03-03 11:15:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:15:27,027 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:15:27,029 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:15:42,856 INFO L? ?]: Removed 1451 outVars from TransFormulas that were not future-live. [2025-03-03 11:15:42,857 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:15:42,924 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:15:42,924 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:15:42,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:42 BoogieIcfgContainer [2025-03-03 11:15:42,925 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:15:42,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:15:42,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:15:42,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:15:42,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:15:08" (1/3) ... [2025-03-03 11:15:42,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2142b88a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:42, skipping insertion in model container [2025-03-03 11:15:42,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:24" (2/3) ... [2025-03-03 11:15:42,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2142b88a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:42, skipping insertion in model container [2025-03-03 11:15:42,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:42" (3/3) ... [2025-03-03 11:15:42,936 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13.c [2025-03-03 11:15:42,946 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:15:42,949 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13.c that has 3 procedures, 3533 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-03 11:15:43,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:15:43,065 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;@64ddeb86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:15:43,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 11:15:43,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 3533 states, 3428 states have (on average 1.8243873978996499) internal successors, (6254), 3430 states have internal predecessors, (6254), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 11:15:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 11:15:43,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:15:43,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:15:43,092 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:15:43,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:15:43,096 INFO L85 PathProgramCache]: Analyzing trace with hash -969447454, now seen corresponding path program 1 times [2025-03-03 11:15:43,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:15:43,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294548176] [2025-03-03 11:15:43,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:15:43,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:15:43,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 11:15:43,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 11:15:43,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:15:43,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:15:43,607 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 11:15:43,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:15:43,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294548176] [2025-03-03 11:15:43,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294548176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:15:43,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:15:43,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:15:43,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475656655] [2025-03-03 11:15:43,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:15:43,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:15:43,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:15:43,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:15:43,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:15:43,640 INFO L87 Difference]: Start difference. First operand has 3533 states, 3428 states have (on average 1.8243873978996499) internal successors, (6254), 3430 states have internal predecessors, (6254), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:15:53,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:15:53,406 INFO L93 Difference]: Finished difference Result 9556 states and 17569 transitions. [2025-03-03 11:15:53,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:15:53,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-03 11:15:53,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:15:53,434 INFO L225 Difference]: With dead ends: 9556 [2025-03-03 11:15:53,434 INFO L226 Difference]: Without dead ends: 6016 [2025-03-03 11:15:53,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 11:15:53,442 INFO L435 NwaCegarLoop]: 6291 mSDtfsCounter, 3160 mSDsluCounter, 3915 mSDsCounter, 0 mSdLazyCounter, 13255 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3160 SdHoareTripleChecker+Valid, 10206 SdHoareTripleChecker+Invalid, 13868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 13255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:15:53,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3160 Valid, 10206 Invalid, 13868 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [613 Valid, 13255 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2025-03-03 11:15:53,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2025-03-03 11:15:53,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 5245. [2025-03-03 11:15:53,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5245 states, 5143 states have (on average 1.7841726618705036) internal successors, (9176), 5242 states have internal predecessors, (9176), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:15:53,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5245 states to 5245 states and 9276 transitions. [2025-03-03 11:15:53,589 INFO L78 Accepts]: Start accepts. Automaton has 5245 states and 9276 transitions. Word has length 13 [2025-03-03 11:15:53,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:15:53,590 INFO L471 AbstractCegarLoop]: Abstraction has 5245 states and 9276 transitions. [2025-03-03 11:15:53,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:15:53,591 INFO L276 IsEmpty]: Start isEmpty. Operand 5245 states and 9276 transitions. [2025-03-03 11:15:53,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 11:15:53,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:15:53,597 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] [2025-03-03 11:15:53,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:15:53,598 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:15:53,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:15:53,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1751905183, now seen corresponding path program 1 times [2025-03-03 11:15:53,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:15:53,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502477245] [2025-03-03 11:15:53,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:15:53,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:15:53,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 11:15:53,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 11:15:53,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:15:53,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:15:53,836 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 11:15:53,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:15:53,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502477245] [2025-03-03 11:15:53,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502477245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:15:53,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:15:53,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:15:53,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115432161] [2025-03-03 11:15:53,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:15:53,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:15:53,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:15:53,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:15:53,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:15:53,839 INFO L87 Difference]: Start difference. First operand 5245 states and 9276 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:15:58,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:15:58,018 INFO L93 Difference]: Finished difference Result 11853 states and 20876 transitions. [2025-03-03 11:15:58,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:15:58,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-03 11:15:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:15:58,039 INFO L225 Difference]: With dead ends: 11853 [2025-03-03 11:15:58,039 INFO L226 Difference]: Without dead ends: 6610 [2025-03-03 11:15:58,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 11:15:58,049 INFO L435 NwaCegarLoop]: 6520 mSDtfsCounter, 1942 mSDsluCounter, 3296 mSDsCounter, 0 mSdLazyCounter, 4509 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1942 SdHoareTripleChecker+Valid, 9816 SdHoareTripleChecker+Invalid, 4764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 4509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:15:58,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1942 Valid, 9816 Invalid, 4764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 4509 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-03 11:15:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6610 states. [2025-03-03 11:15:58,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6610 to 6115. [2025-03-03 11:15:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6115 states, 6013 states have (on average 1.7490437385664395) internal successors, (10517), 6112 states have internal predecessors, (10517), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:15:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6115 states to 6115 states and 10617 transitions. [2025-03-03 11:15:58,157 INFO L78 Accepts]: Start accepts. Automaton has 6115 states and 10617 transitions. Word has length 22 [2025-03-03 11:15:58,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:15:58,157 INFO L471 AbstractCegarLoop]: Abstraction has 6115 states and 10617 transitions. [2025-03-03 11:15:58,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:15:58,157 INFO L276 IsEmpty]: Start isEmpty. Operand 6115 states and 10617 transitions. [2025-03-03 11:15:58,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 11:15:58,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:15:58,158 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] [2025-03-03 11:15:58,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 11:15:58,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:15:58,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:15:58,161 INFO L85 PathProgramCache]: Analyzing trace with hash 983250629, now seen corresponding path program 1 times [2025-03-03 11:15:58,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:15:58,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976006098] [2025-03-03 11:15:58,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:15:58,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:15:58,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 11:15:58,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 11:15:58,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:15:58,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:15:58,250 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 11:15:58,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:15:58,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976006098] [2025-03-03 11:15:58,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976006098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:15:58,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:15:58,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:15:58,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255624637] [2025-03-03 11:15:58,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:15:58,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:15:58,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:15:58,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:15:58,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:15:58,253 INFO L87 Difference]: Start difference. First operand 6115 states and 10617 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:15:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:15:58,496 INFO L93 Difference]: Finished difference Result 17808 states and 30942 transitions. [2025-03-03 11:15:58,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:15:58,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-03 11:15:58,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:15:58,535 INFO L225 Difference]: With dead ends: 17808 [2025-03-03 11:15:58,535 INFO L226 Difference]: Without dead ends: 11695 [2025-03-03 11:15:58,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:15:58,546 INFO L435 NwaCegarLoop]: 6287 mSDtfsCounter, 6151 mSDsluCounter, 6031 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6151 SdHoareTripleChecker+Valid, 12318 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:15:58,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6151 Valid, 12318 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 11:15:58,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11695 states. [2025-03-03 11:15:58,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11695 to 11596. [2025-03-03 11:15:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11596 states, 11494 states have (on average 1.7502175047851052) internal successors, (20117), 11593 states have internal predecessors, (20117), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:15:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11596 states to 11596 states and 20217 transitions. [2025-03-03 11:15:58,741 INFO L78 Accepts]: Start accepts. Automaton has 11596 states and 20217 transitions. Word has length 32 [2025-03-03 11:15:58,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:15:58,741 INFO L471 AbstractCegarLoop]: Abstraction has 11596 states and 20217 transitions. [2025-03-03 11:15:58,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:15:58,742 INFO L276 IsEmpty]: Start isEmpty. Operand 11596 states and 20217 transitions. [2025-03-03 11:15:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 11:15:58,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:15:58,742 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] [2025-03-03 11:15:58,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 11:15:58,743 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:15:58,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:15:58,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1929038981, now seen corresponding path program 1 times [2025-03-03 11:15:58,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:15:58,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036520451] [2025-03-03 11:15:58,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:15:58,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:15:58,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 11:15:58,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 11:15:58,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:15:58,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:15:58,825 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 11:15:58,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:15:58,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036520451] [2025-03-03 11:15:58,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036520451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:15:58,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:15:58,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:15:58,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108660698] [2025-03-03 11:15:58,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:15:58,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:15:58,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:15:58,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:15:58,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:15:58,826 INFO L87 Difference]: Start difference. First operand 11596 states and 20217 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:15:59,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:15:59,468 INFO L93 Difference]: Finished difference Result 34103 states and 59476 transitions. [2025-03-03 11:15:59,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:15:59,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-03 11:15:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:15:59,507 INFO L225 Difference]: With dead ends: 34103 [2025-03-03 11:15:59,507 INFO L226 Difference]: Without dead ends: 22509 [2025-03-03 11:15:59,525 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 11:15:59,526 INFO L435 NwaCegarLoop]: 6755 mSDtfsCounter, 5698 mSDsluCounter, 5872 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5698 SdHoareTripleChecker+Valid, 12627 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:15:59,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5698 Valid, 12627 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 11:15:59,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22509 states. [2025-03-03 11:15:59,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22509 to 22396. [2025-03-03 11:15:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22396 states, 22294 states have (on average 1.7489459047277294) internal successors, (38991), 22393 states have internal predecessors, (38991), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:15:59,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22396 states to 22396 states and 39091 transitions. [2025-03-03 11:15:59,831 INFO L78 Accepts]: Start accepts. Automaton has 22396 states and 39091 transitions. Word has length 32 [2025-03-03 11:15:59,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:15:59,831 INFO L471 AbstractCegarLoop]: Abstraction has 22396 states and 39091 transitions. [2025-03-03 11:15:59,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:15:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 22396 states and 39091 transitions. [2025-03-03 11:15:59,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 11:15:59,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:15:59,833 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] [2025-03-03 11:15:59,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 11:15:59,833 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:15:59,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:15:59,834 INFO L85 PathProgramCache]: Analyzing trace with hash -335209287, now seen corresponding path program 1 times [2025-03-03 11:15:59,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:15:59,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809420906] [2025-03-03 11:15:59,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:15:59,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:15:59,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 11:15:59,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 11:15:59,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:15:59,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:15:59,927 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 11:15:59,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:15:59,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809420906] [2025-03-03 11:15:59,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809420906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:15:59,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:15:59,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:15:59,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093522748] [2025-03-03 11:15:59,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:15:59,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:15:59,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:15:59,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:15:59,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:15:59,930 INFO L87 Difference]: Start difference. First operand 22396 states and 39091 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:00,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:16:00,199 INFO L93 Difference]: Finished difference Result 66744 states and 116443 transitions. [2025-03-03 11:16:00,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:16:00,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-03 11:16:00,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:16:00,271 INFO L225 Difference]: With dead ends: 66744 [2025-03-03 11:16:00,271 INFO L226 Difference]: Without dead ends: 44350 [2025-03-03 11:16:00,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:16:00,303 INFO L435 NwaCegarLoop]: 6321 mSDtfsCounter, 6132 mSDsluCounter, 6148 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6132 SdHoareTripleChecker+Valid, 12469 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:16:00,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6132 Valid, 12469 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 11:16:00,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44350 states. [2025-03-03 11:16:00,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44350 to 44248. [2025-03-03 11:16:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44248 states, 44146 states have (on average 1.7470665518959816) internal successors, (77126), 44245 states have internal predecessors, (77126), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44248 states to 44248 states and 77226 transitions. [2025-03-03 11:16:00,760 INFO L78 Accepts]: Start accepts. Automaton has 44248 states and 77226 transitions. Word has length 33 [2025-03-03 11:16:00,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:16:00,760 INFO L471 AbstractCegarLoop]: Abstraction has 44248 states and 77226 transitions. [2025-03-03 11:16:00,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:00,760 INFO L276 IsEmpty]: Start isEmpty. Operand 44248 states and 77226 transitions. [2025-03-03 11:16:00,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 11:16:00,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:16:00,761 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] [2025-03-03 11:16:00,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 11:16:00,761 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:16:00,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:16:00,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1807430843, now seen corresponding path program 1 times [2025-03-03 11:16:00,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:16:00,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608970332] [2025-03-03 11:16:00,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:16:00,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:16:00,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 11:16:00,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 11:16:00,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:16:00,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:16:00,877 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 11:16:00,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:16:00,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608970332] [2025-03-03 11:16:00,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608970332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:16:00,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:16:00,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:16:00,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754687605] [2025-03-03 11:16:00,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:16:00,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:16:00,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:16:00,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:16:00,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:16:00,881 INFO L87 Difference]: Start difference. First operand 44248 states and 77226 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:02,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:16:02,175 INFO L93 Difference]: Finished difference Result 127265 states and 222095 transitions. [2025-03-03 11:16:02,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:16:02,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-03 11:16:02,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:16:02,316 INFO L225 Difference]: With dead ends: 127265 [2025-03-03 11:16:02,316 INFO L226 Difference]: Without dead ends: 83019 [2025-03-03 11:16:02,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:16:02,363 INFO L435 NwaCegarLoop]: 7716 mSDtfsCounter, 5015 mSDsluCounter, 5674 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5015 SdHoareTripleChecker+Valid, 13390 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 11:16:02,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5015 Valid, 13390 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 11:16:02,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83019 states. [2025-03-03 11:16:03,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83019 to 82752. [2025-03-03 11:16:03,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82752 states, 82650 states have (on average 1.741222020568663) internal successors, (143912), 82749 states have internal predecessors, (143912), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82752 states to 82752 states and 144012 transitions. [2025-03-03 11:16:03,362 INFO L78 Accepts]: Start accepts. Automaton has 82752 states and 144012 transitions. Word has length 34 [2025-03-03 11:16:03,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:16:03,362 INFO L471 AbstractCegarLoop]: Abstraction has 82752 states and 144012 transitions. [2025-03-03 11:16:03,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:03,363 INFO L276 IsEmpty]: Start isEmpty. Operand 82752 states and 144012 transitions. [2025-03-03 11:16:03,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 11:16:03,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:16:03,364 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] [2025-03-03 11:16:03,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 11:16:03,365 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:16:03,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:16:03,365 INFO L85 PathProgramCache]: Analyzing trace with hash -201660807, now seen corresponding path program 1 times [2025-03-03 11:16:03,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:16:03,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19670687] [2025-03-03 11:16:03,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:16:03,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:16:03,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 11:16:03,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 11:16:03,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:16:03,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:16:03,452 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 11:16:03,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:16:03,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19670687] [2025-03-03 11:16:03,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19670687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:16:03,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:16:03,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:16:03,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129598878] [2025-03-03 11:16:03,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:16:03,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:16:03,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:16:03,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:16:03,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:16:03,454 INFO L87 Difference]: Start difference. First operand 82752 states and 144012 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:04,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:16:04,704 INFO L93 Difference]: Finished difference Result 247827 states and 431239 transitions. [2025-03-03 11:16:04,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:16:04,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-03 11:16:04,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:16:04,927 INFO L225 Difference]: With dead ends: 247827 [2025-03-03 11:16:04,927 INFO L226 Difference]: Without dead ends: 165077 [2025-03-03 11:16:04,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:16:04,975 INFO L435 NwaCegarLoop]: 6270 mSDtfsCounter, 6139 mSDsluCounter, 6188 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6139 SdHoareTripleChecker+Valid, 12458 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:16:04,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6139 Valid, 12458 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 11:16:05,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165077 states. [2025-03-03 11:16:06,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165077 to 164974. [2025-03-03 11:16:06,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164974 states, 164872 states have (on average 1.7405259837934883) internal successors, (286964), 164971 states have internal predecessors, (286964), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:06,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164974 states to 164974 states and 287064 transitions. [2025-03-03 11:16:06,939 INFO L78 Accepts]: Start accepts. Automaton has 164974 states and 287064 transitions. Word has length 35 [2025-03-03 11:16:06,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:16:06,939 INFO L471 AbstractCegarLoop]: Abstraction has 164974 states and 287064 transitions. [2025-03-03 11:16:06,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:06,940 INFO L276 IsEmpty]: Start isEmpty. Operand 164974 states and 287064 transitions. [2025-03-03 11:16:06,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 11:16:06,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:16:06,941 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] [2025-03-03 11:16:06,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 11:16:06,942 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:16:06,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:16:06,942 INFO L85 PathProgramCache]: Analyzing trace with hash 762064566, now seen corresponding path program 1 times [2025-03-03 11:16:06,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:16:06,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040797334] [2025-03-03 11:16:06,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:16:06,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:16:06,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 11:16:06,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 11:16:06,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:16:06,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:16:07,308 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 11:16:07,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:16:07,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040797334] [2025-03-03 11:16:07,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040797334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:16:07,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:16:07,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:16:07,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216401448] [2025-03-03 11:16:07,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:16:07,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:16:07,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:16:07,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:16:07,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:16:07,311 INFO L87 Difference]: Start difference. First operand 164974 states and 287064 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:16,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:16:16,942 INFO L93 Difference]: Finished difference Result 385741 states and 671351 transitions. [2025-03-03 11:16:16,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:16:16,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-03 11:16:16,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:16:17,249 INFO L225 Difference]: With dead ends: 385741 [2025-03-03 11:16:17,249 INFO L226 Difference]: Without dead ends: 220769 [2025-03-03 11:16:17,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 11:16:17,524 INFO L435 NwaCegarLoop]: 7276 mSDtfsCounter, 2900 mSDsluCounter, 4468 mSDsCounter, 0 mSdLazyCounter, 12749 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2900 SdHoareTripleChecker+Valid, 11744 SdHoareTripleChecker+Invalid, 13164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 12749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:16:17,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2900 Valid, 11744 Invalid, 13164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 12749 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2025-03-03 11:16:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220769 states. [2025-03-03 11:16:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220769 to 203362. [2025-03-03 11:16:19,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203362 states, 203260 states have (on average 1.7271770146610252) internal successors, (351066), 203359 states have internal predecessors, (351066), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203362 states to 203362 states and 351166 transitions. [2025-03-03 11:16:19,570 INFO L78 Accepts]: Start accepts. Automaton has 203362 states and 351166 transitions. Word has length 36 [2025-03-03 11:16:19,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:16:19,570 INFO L471 AbstractCegarLoop]: Abstraction has 203362 states and 351166 transitions. [2025-03-03 11:16:19,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:19,570 INFO L276 IsEmpty]: Start isEmpty. Operand 203362 states and 351166 transitions. [2025-03-03 11:16:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 11:16:19,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:16:19,572 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] [2025-03-03 11:16:19,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 11:16:19,572 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:16:19,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:16:19,572 INFO L85 PathProgramCache]: Analyzing trace with hash -710717383, now seen corresponding path program 1 times [2025-03-03 11:16:19,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:16:19,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115339763] [2025-03-03 11:16:19,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:16:19,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:16:19,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 11:16:19,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 11:16:19,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:16:19,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:16:19,642 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 11:16:19,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:16:19,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115339763] [2025-03-03 11:16:19,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115339763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:16:19,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:16:19,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:16:19,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874510641] [2025-03-03 11:16:19,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:16:19,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:16:19,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:16:19,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:16:19,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:16:19,644 INFO L87 Difference]: Start difference. First operand 203362 states and 351166 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:22,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:16:22,170 INFO L93 Difference]: Finished difference Result 598243 states and 1031839 transitions. [2025-03-03 11:16:22,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:16:22,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 11:16:22,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:16:23,128 INFO L225 Difference]: With dead ends: 598243 [2025-03-03 11:16:23,128 INFO L226 Difference]: Without dead ends: 394883 [2025-03-03 11:16:23,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:16:23,196 INFO L435 NwaCegarLoop]: 6484 mSDtfsCounter, 5886 mSDsluCounter, 6102 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5886 SdHoareTripleChecker+Valid, 12586 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:16:23,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5886 Valid, 12586 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 11:16:23,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394883 states. [2025-03-03 11:16:26,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394883 to 394706. [2025-03-03 11:16:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394706 states, 394604 states have (on average 1.7206110429696608) internal successors, (678960), 394703 states have internal predecessors, (678960), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394706 states to 394706 states and 679060 transitions. [2025-03-03 11:16:28,049 INFO L78 Accepts]: Start accepts. Automaton has 394706 states and 679060 transitions. Word has length 37 [2025-03-03 11:16:28,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:16:28,049 INFO L471 AbstractCegarLoop]: Abstraction has 394706 states and 679060 transitions. [2025-03-03 11:16:28,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:28,050 INFO L276 IsEmpty]: Start isEmpty. Operand 394706 states and 679060 transitions. [2025-03-03 11:16:28,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 11:16:28,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:16:28,052 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] [2025-03-03 11:16:28,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 11:16:28,052 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:16:28,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:16:28,053 INFO L85 PathProgramCache]: Analyzing trace with hash -563287867, now seen corresponding path program 1 times [2025-03-03 11:16:28,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:16:28,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225655660] [2025-03-03 11:16:28,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:16:28,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:16:28,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 11:16:28,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 11:16:28,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:16:28,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:16:28,150 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 11:16:28,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:16:28,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225655660] [2025-03-03 11:16:28,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225655660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:16:28,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:16:28,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:16:28,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220339212] [2025-03-03 11:16:28,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:16:28,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:16:28,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:16:28,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:16:28,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:16:28,151 INFO L87 Difference]: Start difference. First operand 394706 states and 679060 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)