./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label01.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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label01.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 cbac78224547ffded4eea2a5da15a43fb2fd2b6c73f073f7e365339f5e128336 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:08:23,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:08:23,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:08:23,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:08:23,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:08:23,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:08:23,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:08:23,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:08:23,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:08:23,671 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:08:23,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:08:23,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:08:23,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:08:23,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:08:23,673 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:08:23,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:08:23,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:08:23,673 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:08:23,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:08:23,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:08:23,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:08:23,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:08:23,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:08:23,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:08:23,674 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:08:23,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:08:23,674 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:08:23,674 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:08:23,674 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:08:23,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:08:23,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:08:23,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:08:23,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:08:23,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:08:23,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:08:23,675 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:08:23,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:08:23,675 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:08:23,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:08:23,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:08:23,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:08:23,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:08:23,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:08:23,675 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 -> cbac78224547ffded4eea2a5da15a43fb2fd2b6c73f073f7e365339f5e128336 [2025-03-03 16:08:23,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:08:23,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:08:23,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:08:23,914 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:08:23,914 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:08:23,916 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label01.c [2025-03-03 16:08:25,015 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041332412/8f234b51401a4eb8b0bbf22a66f25339/FLAG374f5dc4e [2025-03-03 16:08:25,392 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:08:25,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label01.c [2025-03-03 16:08:25,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041332412/8f234b51401a4eb8b0bbf22a66f25339/FLAG374f5dc4e [2025-03-03 16:08:25,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041332412/8f234b51401a4eb8b0bbf22a66f25339 [2025-03-03 16:08:25,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:08:25,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:08:25,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:08:25,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:08:25,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:08:25,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:08:25" (1/1) ... [2025-03-03 16:08:25,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@468fa490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:25, skipping insertion in model container [2025-03-03 16:08:25,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:08:25" (1/1) ... [2025-03-03 16:08:25,701 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:08:26,003 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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label01.c[11640,11653] [2025-03-03 16:08:26,048 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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label01.c[17195,17208] [2025-03-03 16:08:26,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:08:26,491 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:08:26,534 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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label01.c[11640,11653] [2025-03-03 16:08:26,551 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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label01.c[17195,17208] [2025-03-03 16:08:26,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:08:26,811 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:08:26,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:26 WrapperNode [2025-03-03 16:08:26,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:08:26,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:08:26,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:08:26,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:08:26,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:26" (1/1) ... [2025-03-03 16:08:26,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:26" (1/1) ... [2025-03-03 16:08:27,071 INFO L138 Inliner]: procedures = 36, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5093 [2025-03-03 16:08:27,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:08:27,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:08:27,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:08:27,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:08:27,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:26" (1/1) ... [2025-03-03 16:08:27,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:26" (1/1) ... [2025-03-03 16:08:27,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:26" (1/1) ... [2025-03-03 16:08:27,286 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:08:27,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:26" (1/1) ... [2025-03-03 16:08:27,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:26" (1/1) ... [2025-03-03 16:08:27,403 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:26" (1/1) ... [2025-03-03 16:08:27,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:26" (1/1) ... [2025-03-03 16:08:27,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:26" (1/1) ... [2025-03-03 16:08:27,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:26" (1/1) ... [2025-03-03 16:08:27,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:08:27,474 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:08:27,474 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:08:27,474 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:08:27,475 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:26" (1/1) ... [2025-03-03 16:08:27,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:08:27,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:08:27,498 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:08:27,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:08:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:08:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:08:27,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:08:27,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:08:27,595 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:08:27,597 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:08:30,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2127: havoc calculate_output_#t~ret38#1; [2025-03-03 16:08:30,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3606: havoc calculate_output2_#t~ret39#1; [2025-03-03 16:08:30,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5096: havoc calculate_output3_#t~ret40#1; [2025-03-03 16:08:30,870 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2025-03-03 16:08:30,870 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:08:30,893 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:08:30,898 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:08:30,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:08:30 BoogieIcfgContainer [2025-03-03 16:08:30,898 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:08:30,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:08:30,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:08:30,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:08:30,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:08:25" (1/3) ... [2025-03-03 16:08:30,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@550072cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:08:30, skipping insertion in model container [2025-03-03 16:08:30,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:08:26" (2/3) ... [2025-03-03 16:08:30,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@550072cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:08:30, skipping insertion in model container [2025-03-03 16:08:30,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:08:30" (3/3) ... [2025-03-03 16:08:30,906 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label01.c [2025-03-03 16:08:30,916 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:08:30,919 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label01.c that has 1 procedures, 898 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:08:30,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:08:30,990 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;@17ae42a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:08:30,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:08:30,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 898 states, 895 states have (on average 1.9039106145251397) internal successors, (1704), 897 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:31,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 16:08:31,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:31,003 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] [2025-03-03 16:08:31,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:31,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:31,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1170366575, now seen corresponding path program 1 times [2025-03-03 16:08:31,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:31,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130651204] [2025-03-03 16:08:31,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:31,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:31,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 16:08:31,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 16:08:31,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:31,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:31,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:31,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130651204] [2025-03-03 16:08:31,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130651204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:31,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:31,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:08:31,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627839625] [2025-03-03 16:08:31,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:31,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 16:08:31,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:31,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 16:08:31,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:08:31,243 INFO L87 Difference]: Start difference. First operand has 898 states, 895 states have (on average 1.9039106145251397) internal successors, (1704), 897 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:31,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:31,319 INFO L93 Difference]: Finished difference Result 1759 states and 3338 transitions. [2025-03-03 16:08:31,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 16:08:31,320 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 16:08:31,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:31,332 INFO L225 Difference]: With dead ends: 1759 [2025-03-03 16:08:31,334 INFO L226 Difference]: Without dead ends: 833 [2025-03-03 16:08:31,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:08:31,342 INFO L435 NwaCegarLoop]: 1640 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:31,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:08:31,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-03-03 16:08:31,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2025-03-03 16:08:31,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 831 states have (on average 1.8941034897713598) internal successors, (1574), 832 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1574 transitions. [2025-03-03 16:08:31,427 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1574 transitions. Word has length 24 [2025-03-03 16:08:31,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:31,427 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1574 transitions. [2025-03-03 16:08:31,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:31,428 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1574 transitions. [2025-03-03 16:08:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 16:08:31,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:31,429 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] [2025-03-03 16:08:31,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:08:31,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:31,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:31,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2127528368, now seen corresponding path program 1 times [2025-03-03 16:08:31,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:31,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490576507] [2025-03-03 16:08:31,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:31,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:31,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 16:08:31,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 16:08:31,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:31,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:31,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:31,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:31,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490576507] [2025-03-03 16:08:31,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490576507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:31,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:31,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:08:31,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813273857] [2025-03-03 16:08:31,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:31,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:08:31,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:31,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:08:31,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:08:31,655 INFO L87 Difference]: Start difference. First operand 833 states and 1574 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:31,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:31,754 INFO L93 Difference]: Finished difference Result 879 states and 1645 transitions. [2025-03-03 16:08:31,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:08:31,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 16:08:31,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:31,759 INFO L225 Difference]: With dead ends: 879 [2025-03-03 16:08:31,759 INFO L226 Difference]: Without dead ends: 833 [2025-03-03 16:08:31,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:08:31,760 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 0 mSDsluCounter, 4680 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6252 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:31,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6252 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:08:31,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-03-03 16:08:31,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2025-03-03 16:08:31,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 831 states have (on average 1.8567990373044525) internal successors, (1543), 832 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:31,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1543 transitions. [2025-03-03 16:08:31,784 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1543 transitions. Word has length 24 [2025-03-03 16:08:31,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:31,785 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1543 transitions. [2025-03-03 16:08:31,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:31,785 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1543 transitions. [2025-03-03 16:08:31,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 16:08:31,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:31,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:31,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:08:31,788 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:31,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:31,789 INFO L85 PathProgramCache]: Analyzing trace with hash -806655844, now seen corresponding path program 1 times [2025-03-03 16:08:31,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:31,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599085280] [2025-03-03 16:08:31,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:31,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:31,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 16:08:31,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 16:08:31,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:31,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:31,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:31,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599085280] [2025-03-03 16:08:31,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599085280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:31,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:31,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:08:31,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740323092] [2025-03-03 16:08:31,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:31,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:08:31,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:31,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:08:31,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:08:31,975 INFO L87 Difference]: Start difference. First operand 833 states and 1543 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:36,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:36,622 INFO L93 Difference]: Finished difference Result 3088 states and 5852 transitions. [2025-03-03 16:08:36,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:08:36,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-03 16:08:36,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:36,631 INFO L225 Difference]: With dead ends: 3088 [2025-03-03 16:08:36,631 INFO L226 Difference]: Without dead ends: 2335 [2025-03-03 16:08:36,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:08:36,632 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 2425 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2425 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:36,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2425 Valid, 797 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-03 16:08:36,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2025-03-03 16:08:36,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 2335. [2025-03-03 16:08:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2333 states have (on average 1.5675096442348908) internal successors, (3657), 2334 states have internal predecessors, (3657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:36,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3657 transitions. [2025-03-03 16:08:36,671 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3657 transitions. Word has length 48 [2025-03-03 16:08:36,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:36,671 INFO L471 AbstractCegarLoop]: Abstraction has 2335 states and 3657 transitions. [2025-03-03 16:08:36,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:36,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3657 transitions. [2025-03-03 16:08:36,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 16:08:36,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:36,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:36,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:08:36,672 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:36,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:36,673 INFO L85 PathProgramCache]: Analyzing trace with hash -130168238, now seen corresponding path program 1 times [2025-03-03 16:08:36,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:36,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738539950] [2025-03-03 16:08:36,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:36,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:36,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 16:08:36,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 16:08:36,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:36,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:36,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:36,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738539950] [2025-03-03 16:08:36,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738539950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:36,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:36,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:08:36,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648192225] [2025-03-03 16:08:36,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:36,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:08:36,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:36,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:08:36,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:08:36,817 INFO L87 Difference]: Start difference. First operand 2335 states and 3657 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:37,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:37,015 INFO L93 Difference]: Finished difference Result 2755 states and 4327 transitions. [2025-03-03 16:08:37,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 16:08:37,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-03 16:08:37,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:37,025 INFO L225 Difference]: With dead ends: 2755 [2025-03-03 16:08:37,025 INFO L226 Difference]: Without dead ends: 2713 [2025-03-03 16:08:37,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-03 16:08:37,028 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 7898 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7898 SdHoareTripleChecker+Valid, 2999 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:37,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7898 Valid, 2999 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:08:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2025-03-03 16:08:37,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2375. [2025-03-03 16:08:37,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2373 states have (on average 1.5680573114201433) internal successors, (3721), 2374 states have internal predecessors, (3721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:37,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 3721 transitions. [2025-03-03 16:08:37,066 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 3721 transitions. Word has length 54 [2025-03-03 16:08:37,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:37,066 INFO L471 AbstractCegarLoop]: Abstraction has 2375 states and 3721 transitions. [2025-03-03 16:08:37,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:37,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3721 transitions. [2025-03-03 16:08:37,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 16:08:37,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:37,067 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:37,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:08:37,067 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:37,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:37,068 INFO L85 PathProgramCache]: Analyzing trace with hash 582728109, now seen corresponding path program 1 times [2025-03-03 16:08:37,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:37,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185269737] [2025-03-03 16:08:37,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:37,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:37,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 16:08:37,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 16:08:37,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:37,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:37,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:37,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:37,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185269737] [2025-03-03 16:08:37,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185269737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:37,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:37,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:08:37,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171840356] [2025-03-03 16:08:37,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:37,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:08:37,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:37,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:08:37,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:37,141 INFO L87 Difference]: Start difference. First operand 2375 states and 3721 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:37,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:37,164 INFO L93 Difference]: Finished difference Result 2528 states and 3964 transitions. [2025-03-03 16:08:37,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:08:37,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-03 16:08:37,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:37,172 INFO L225 Difference]: With dead ends: 2528 [2025-03-03 16:08:37,172 INFO L226 Difference]: Without dead ends: 2446 [2025-03-03 16:08:37,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:37,173 INFO L435 NwaCegarLoop]: 1541 mSDtfsCounter, 1482 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:37,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1603 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:08:37,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2025-03-03 16:08:37,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2444. [2025-03-03 16:08:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 2442 states have (on average 1.567977067977068) internal successors, (3829), 2443 states have internal predecessors, (3829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 3829 transitions. [2025-03-03 16:08:37,222 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 3829 transitions. Word has length 56 [2025-03-03 16:08:37,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:37,222 INFO L471 AbstractCegarLoop]: Abstraction has 2444 states and 3829 transitions. [2025-03-03 16:08:37,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:37,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 3829 transitions. [2025-03-03 16:08:37,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 16:08:37,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:37,224 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:37,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:08:37,224 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:37,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:37,225 INFO L85 PathProgramCache]: Analyzing trace with hash 615051344, now seen corresponding path program 1 times [2025-03-03 16:08:37,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:37,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281131202] [2025-03-03 16:08:37,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:37,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:37,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 16:08:37,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 16:08:37,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:37,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:37,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:37,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281131202] [2025-03-03 16:08:37,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281131202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:37,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:37,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:08:37,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638702019] [2025-03-03 16:08:37,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:37,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:08:37,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:37,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:08:37,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:08:37,511 INFO L87 Difference]: Start difference. First operand 2444 states and 3829 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:37,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:37,650 INFO L93 Difference]: Finished difference Result 2597 states and 4069 transitions. [2025-03-03 16:08:37,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:08:37,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-03 16:08:37,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:37,659 INFO L225 Difference]: With dead ends: 2597 [2025-03-03 16:08:37,659 INFO L226 Difference]: Without dead ends: 2446 [2025-03-03 16:08:37,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:08:37,661 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 5964 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5964 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:37,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5964 Valid, 1792 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:08:37,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2025-03-03 16:08:37,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2444. [2025-03-03 16:08:37,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 2442 states have (on average 1.5671580671580672) internal successors, (3827), 2443 states have internal predecessors, (3827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 3827 transitions. [2025-03-03 16:08:37,697 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 3827 transitions. Word has length 56 [2025-03-03 16:08:37,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:37,697 INFO L471 AbstractCegarLoop]: Abstraction has 2444 states and 3827 transitions. [2025-03-03 16:08:37,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:37,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 3827 transitions. [2025-03-03 16:08:37,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 16:08:37,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:37,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:37,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:08:37,699 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:37,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:37,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1917260214, now seen corresponding path program 1 times [2025-03-03 16:08:37,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:37,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772162538] [2025-03-03 16:08:37,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:37,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:37,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 16:08:37,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 16:08:37,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:37,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:37,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:37,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:37,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772162538] [2025-03-03 16:08:37,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772162538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:37,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:37,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:08:37,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143888292] [2025-03-03 16:08:37,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:37,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:08:37,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:37,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:08:37,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:08:37,909 INFO L87 Difference]: Start difference. First operand 2444 states and 3827 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:37,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:37,958 INFO L93 Difference]: Finished difference Result 2452 states and 3836 transitions. [2025-03-03 16:08:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:08:37,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-03 16:08:37,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:37,966 INFO L225 Difference]: With dead ends: 2452 [2025-03-03 16:08:37,966 INFO L226 Difference]: Without dead ends: 2450 [2025-03-03 16:08:37,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:08:37,968 INFO L435 NwaCegarLoop]: 1537 mSDtfsCounter, 0 mSDsluCounter, 9209 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10746 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:37,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10746 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:08:37,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2025-03-03 16:08:37,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2450. [2025-03-03 16:08:38,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2448 states have (on average 1.565359477124183) internal successors, (3832), 2449 states have internal predecessors, (3832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3832 transitions. [2025-03-03 16:08:38,006 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 3832 transitions. Word has length 57 [2025-03-03 16:08:38,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:38,007 INFO L471 AbstractCegarLoop]: Abstraction has 2450 states and 3832 transitions. [2025-03-03 16:08:38,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:38,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3832 transitions. [2025-03-03 16:08:38,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:08:38,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:38,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:38,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:08:38,009 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:38,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:38,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1309029714, now seen corresponding path program 1 times [2025-03-03 16:08:38,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:38,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384764959] [2025-03-03 16:08:38,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:38,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:38,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:08:38,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:08:38,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:38,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:38,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:38,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:38,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384764959] [2025-03-03 16:08:38,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384764959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:38,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:38,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:08:38,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823464307] [2025-03-03 16:08:38,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:38,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:08:38,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:38,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:08:38,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:38,062 INFO L87 Difference]: Start difference. First operand 2450 states and 3832 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:38,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:38,085 INFO L93 Difference]: Finished difference Result 2620 states and 4093 transitions. [2025-03-03 16:08:38,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:08:38,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 16:08:38,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:38,093 INFO L225 Difference]: With dead ends: 2620 [2025-03-03 16:08:38,093 INFO L226 Difference]: Without dead ends: 2532 [2025-03-03 16:08:38,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:38,096 INFO L435 NwaCegarLoop]: 1595 mSDtfsCounter, 1496 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:38,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1663 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:08:38,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2025-03-03 16:08:38,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2530. [2025-03-03 16:08:38,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2530 states, 2528 states have (on average 1.5636867088607596) internal successors, (3953), 2529 states have internal predecessors, (3953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:38,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2530 states and 3953 transitions. [2025-03-03 16:08:38,132 INFO L78 Accepts]: Start accepts. Automaton has 2530 states and 3953 transitions. Word has length 58 [2025-03-03 16:08:38,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:38,134 INFO L471 AbstractCegarLoop]: Abstraction has 2530 states and 3953 transitions. [2025-03-03 16:08:38,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:38,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 3953 transitions. [2025-03-03 16:08:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:08:38,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:38,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:38,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:08:38,135 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:38,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:38,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2007007086, now seen corresponding path program 1 times [2025-03-03 16:08:38,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:38,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555539496] [2025-03-03 16:08:38,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:38,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:38,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:08:38,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:08:38,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:38,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:38,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:38,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555539496] [2025-03-03 16:08:38,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555539496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:38,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:38,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:08:38,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384137387] [2025-03-03 16:08:38,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:38,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:08:38,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:38,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:08:38,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:38,183 INFO L87 Difference]: Start difference. First operand 2530 states and 3953 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:38,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:38,204 INFO L93 Difference]: Finished difference Result 2976 states and 4633 transitions. [2025-03-03 16:08:38,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:08:38,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 16:08:38,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:38,211 INFO L225 Difference]: With dead ends: 2976 [2025-03-03 16:08:38,212 INFO L226 Difference]: Without dead ends: 2741 [2025-03-03 16:08:38,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:38,214 INFO L435 NwaCegarLoop]: 1597 mSDtfsCounter, 1494 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:38,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1669 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:08:38,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2025-03-03 16:08:38,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 2739. [2025-03-03 16:08:38,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2739 states, 2737 states have (on average 1.5582754841066861) internal successors, (4265), 2738 states have internal predecessors, (4265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2739 states to 2739 states and 4265 transitions. [2025-03-03 16:08:38,252 INFO L78 Accepts]: Start accepts. Automaton has 2739 states and 4265 transitions. Word has length 58 [2025-03-03 16:08:38,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:38,252 INFO L471 AbstractCegarLoop]: Abstraction has 2739 states and 4265 transitions. [2025-03-03 16:08:38,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:38,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2739 states and 4265 transitions. [2025-03-03 16:08:38,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:08:38,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:38,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:38,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:08:38,254 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:38,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:38,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1559061550, now seen corresponding path program 1 times [2025-03-03 16:08:38,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:38,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470337131] [2025-03-03 16:08:38,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:38,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:38,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:08:38,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:08:38,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:38,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:38,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:38,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:38,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470337131] [2025-03-03 16:08:38,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470337131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:38,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:38,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:08:38,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856072503] [2025-03-03 16:08:38,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:38,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:08:38,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:38,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:08:38,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:38,301 INFO L87 Difference]: Start difference. First operand 2739 states and 4265 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:38,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:38,325 INFO L93 Difference]: Finished difference Result 3579 states and 5527 transitions. [2025-03-03 16:08:38,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:08:38,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 16:08:38,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:38,334 INFO L225 Difference]: With dead ends: 3579 [2025-03-03 16:08:38,334 INFO L226 Difference]: Without dead ends: 3135 [2025-03-03 16:08:38,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:38,336 INFO L435 NwaCegarLoop]: 1595 mSDtfsCounter, 1492 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:38,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1671 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:08:38,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2025-03-03 16:08:38,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 3133. [2025-03-03 16:08:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3133 states, 3131 states have (on average 1.5461513893324816) internal successors, (4841), 3132 states have internal predecessors, (4841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 4841 transitions. [2025-03-03 16:08:38,415 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 4841 transitions. Word has length 58 [2025-03-03 16:08:38,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:38,415 INFO L471 AbstractCegarLoop]: Abstraction has 3133 states and 4841 transitions. [2025-03-03 16:08:38,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:38,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 4841 transitions. [2025-03-03 16:08:38,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:08:38,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:38,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:38,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:08:38,417 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:38,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:38,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1974237422, now seen corresponding path program 1 times [2025-03-03 16:08:38,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:38,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613385008] [2025-03-03 16:08:38,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:38,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:38,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:08:38,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:08:38,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:38,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:38,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:38,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:38,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613385008] [2025-03-03 16:08:38,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613385008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:38,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:38,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:08:38,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737381959] [2025-03-03 16:08:38,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:38,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:08:38,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:38,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:08:38,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:38,459 INFO L87 Difference]: Start difference. First operand 3133 states and 4841 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:38,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:38,492 INFO L93 Difference]: Finished difference Result 4713 states and 7171 transitions. [2025-03-03 16:08:38,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:08:38,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 16:08:38,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:38,505 INFO L225 Difference]: With dead ends: 4713 [2025-03-03 16:08:38,505 INFO L226 Difference]: Without dead ends: 3875 [2025-03-03 16:08:38,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:38,507 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 1490 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:38,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1673 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:08:38,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3875 states. [2025-03-03 16:08:38,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3875 to 3873. [2025-03-03 16:08:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3873 states, 3871 states have (on average 1.5233789718419013) internal successors, (5897), 3872 states have internal predecessors, (5897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3873 states to 3873 states and 5897 transitions. [2025-03-03 16:08:38,571 INFO L78 Accepts]: Start accepts. Automaton has 3873 states and 5897 transitions. Word has length 58 [2025-03-03 16:08:38,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:38,572 INFO L471 AbstractCegarLoop]: Abstraction has 3873 states and 5897 transitions. [2025-03-03 16:08:38,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3873 states and 5897 transitions. [2025-03-03 16:08:38,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:08:38,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:38,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:08:38,573 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:38,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:38,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1487519150, now seen corresponding path program 1 times [2025-03-03 16:08:38,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:38,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386777700] [2025-03-03 16:08:38,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:38,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:38,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:08:38,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:08:38,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:38,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:38,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:38,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386777700] [2025-03-03 16:08:38,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386777700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:38,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:38,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:08:38,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121010975] [2025-03-03 16:08:38,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:38,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:08:38,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:38,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:08:38,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:38,609 INFO L87 Difference]: Start difference. First operand 3873 states and 5897 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:38,655 INFO L93 Difference]: Finished difference Result 6837 states and 10171 transitions. [2025-03-03 16:08:38,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:08:38,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 16:08:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:38,664 INFO L225 Difference]: With dead ends: 6837 [2025-03-03 16:08:38,664 INFO L226 Difference]: Without dead ends: 5259 [2025-03-03 16:08:38,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:38,668 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 1488 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:38,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1675 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:08:38,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2025-03-03 16:08:38,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 5257. [2025-03-03 16:08:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5257 states, 5255 states have (on average 1.487535680304472) internal successors, (7817), 5256 states have internal predecessors, (7817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:38,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 7817 transitions. [2025-03-03 16:08:38,755 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 7817 transitions. Word has length 58 [2025-03-03 16:08:38,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:38,755 INFO L471 AbstractCegarLoop]: Abstraction has 5257 states and 7817 transitions. [2025-03-03 16:08:38,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:38,756 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 7817 transitions. [2025-03-03 16:08:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:08:38,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:38,757 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:38,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:08:38,758 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:38,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:38,758 INFO L85 PathProgramCache]: Analyzing trace with hash -926993275, now seen corresponding path program 1 times [2025-03-03 16:08:38,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:38,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508675788] [2025-03-03 16:08:38,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:38,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:38,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:08:38,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:08:38,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:38,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:08:38,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:38,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508675788] [2025-03-03 16:08:38,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508675788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:38,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:38,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:08:38,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215390715] [2025-03-03 16:08:38,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:38,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:08:38,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:38,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:08:38,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:08:38,869 INFO L87 Difference]: Start difference. First operand 5257 states and 7817 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:39,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:39,104 INFO L93 Difference]: Finished difference Result 19861 states and 28623 transitions. [2025-03-03 16:08:39,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:08:39,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 16:08:39,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:39,134 INFO L225 Difference]: With dead ends: 19861 [2025-03-03 16:08:39,135 INFO L226 Difference]: Without dead ends: 17747 [2025-03-03 16:08:39,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:08:39,144 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 6307 mSDsluCounter, 2087 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6307 SdHoareTripleChecker+Valid, 3694 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:39,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6307 Valid, 3694 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:08:39,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17747 states. [2025-03-03 16:08:39,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17747 to 7801. [2025-03-03 16:08:39,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7801 states, 7799 states have (on average 1.4618540838569047) internal successors, (11401), 7800 states have internal predecessors, (11401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7801 states to 7801 states and 11401 transitions. [2025-03-03 16:08:39,358 INFO L78 Accepts]: Start accepts. Automaton has 7801 states and 11401 transitions. Word has length 77 [2025-03-03 16:08:39,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:39,358 INFO L471 AbstractCegarLoop]: Abstraction has 7801 states and 11401 transitions. [2025-03-03 16:08:39,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:39,358 INFO L276 IsEmpty]: Start isEmpty. Operand 7801 states and 11401 transitions. [2025-03-03 16:08:39,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:08:39,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:39,360 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:39,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:08:39,360 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:39,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:39,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1905923771, now seen corresponding path program 1 times [2025-03-03 16:08:39,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:39,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032759378] [2025-03-03 16:08:39,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:39,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:39,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:08:39,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:08:39,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:39,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:39,467 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:08:39,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:39,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032759378] [2025-03-03 16:08:39,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032759378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:39,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:39,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:08:39,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982836444] [2025-03-03 16:08:39,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:39,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:08:39,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:39,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:08:39,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:08:39,469 INFO L87 Difference]: Start difference. First operand 7801 states and 11401 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:39,753 INFO L93 Difference]: Finished difference Result 22821 states and 32815 transitions. [2025-03-03 16:08:39,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:08:39,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 16:08:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:39,786 INFO L225 Difference]: With dead ends: 22821 [2025-03-03 16:08:39,786 INFO L226 Difference]: Without dead ends: 19859 [2025-03-03 16:08:39,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:08:39,796 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 6309 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6309 SdHoareTripleChecker+Valid, 3665 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:39,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6309 Valid, 3665 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:08:39,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19859 states. [2025-03-03 16:08:40,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19859 to 11817. [2025-03-03 16:08:40,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11817 states, 11815 states have (on average 1.4429961912822682) internal successors, (17049), 11816 states have internal predecessors, (17049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:40,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11817 states to 11817 states and 17049 transitions. [2025-03-03 16:08:40,065 INFO L78 Accepts]: Start accepts. Automaton has 11817 states and 17049 transitions. Word has length 77 [2025-03-03 16:08:40,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:40,065 INFO L471 AbstractCegarLoop]: Abstraction has 11817 states and 17049 transitions. [2025-03-03 16:08:40,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:40,065 INFO L276 IsEmpty]: Start isEmpty. Operand 11817 states and 17049 transitions. [2025-03-03 16:08:40,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:08:40,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:40,067 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:40,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:08:40,067 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:40,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:40,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1941097989, now seen corresponding path program 1 times [2025-03-03 16:08:40,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:40,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358615512] [2025-03-03 16:08:40,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:40,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:40,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:08:40,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:08:40,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:40,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:08:40,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:40,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358615512] [2025-03-03 16:08:40,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358615512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:40,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:40,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:08:40,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529750880] [2025-03-03 16:08:40,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:40,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:08:40,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:40,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:08:40,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:08:40,173 INFO L87 Difference]: Start difference. First operand 11817 states and 17049 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:40,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:40,598 INFO L93 Difference]: Finished difference Result 25781 states and 36991 transitions. [2025-03-03 16:08:40,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:08:40,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 16:08:40,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:40,636 INFO L225 Difference]: With dead ends: 25781 [2025-03-03 16:08:40,636 INFO L226 Difference]: Without dead ends: 22819 [2025-03-03 16:08:40,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:08:40,644 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 6331 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6331 SdHoareTripleChecker+Valid, 3633 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:40,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6331 Valid, 3633 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:08:40,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22819 states. [2025-03-03 16:08:41,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22819 to 14777. [2025-03-03 16:08:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14777 states, 14775 states have (on average 1.4365482233502538) internal successors, (21225), 14776 states have internal predecessors, (21225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14777 states to 14777 states and 21225 transitions. [2025-03-03 16:08:41,077 INFO L78 Accepts]: Start accepts. Automaton has 14777 states and 21225 transitions. Word has length 77 [2025-03-03 16:08:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:41,078 INFO L471 AbstractCegarLoop]: Abstraction has 14777 states and 21225 transitions. [2025-03-03 16:08:41,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 14777 states and 21225 transitions. [2025-03-03 16:08:41,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:08:41,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:41,081 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:41,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:08:41,081 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:41,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:41,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1938693435, now seen corresponding path program 1 times [2025-03-03 16:08:41,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:41,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161852991] [2025-03-03 16:08:41,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:41,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:41,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:08:41,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:08:41,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:41,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:41,206 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 16:08:41,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:41,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161852991] [2025-03-03 16:08:41,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161852991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:41,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:41,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:08:41,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079916474] [2025-03-03 16:08:41,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:41,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:08:41,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:41,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:08:41,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:08:41,208 INFO L87 Difference]: Start difference. First operand 14777 states and 21225 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:41,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:41,648 INFO L93 Difference]: Finished difference Result 28741 states and 41167 transitions. [2025-03-03 16:08:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:08:41,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 16:08:41,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:41,690 INFO L225 Difference]: With dead ends: 28741 [2025-03-03 16:08:41,690 INFO L226 Difference]: Without dead ends: 25779 [2025-03-03 16:08:41,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:08:41,697 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 6367 mSDsluCounter, 2040 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6367 SdHoareTripleChecker+Valid, 3642 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:41,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6367 Valid, 3642 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:08:41,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25779 states. [2025-03-03 16:08:41,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25779 to 17737. [2025-03-03 16:08:42,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17737 states, 17735 states have (on average 1.4322526078376092) internal successors, (25401), 17736 states have internal predecessors, (25401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:42,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17737 states to 17737 states and 25401 transitions. [2025-03-03 16:08:42,027 INFO L78 Accepts]: Start accepts. Automaton has 17737 states and 25401 transitions. Word has length 77 [2025-03-03 16:08:42,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:42,027 INFO L471 AbstractCegarLoop]: Abstraction has 17737 states and 25401 transitions. [2025-03-03 16:08:42,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:42,027 INFO L276 IsEmpty]: Start isEmpty. Operand 17737 states and 25401 transitions. [2025-03-03 16:08:42,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:08:42,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:42,029 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:42,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:08:42,029 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:42,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:42,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1869555589, now seen corresponding path program 1 times [2025-03-03 16:08:42,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:42,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536662239] [2025-03-03 16:08:42,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:42,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:42,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:08:42,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:08:42,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:42,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 16:08:42,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:42,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536662239] [2025-03-03 16:08:42,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536662239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:42,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:42,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:08:42,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618229107] [2025-03-03 16:08:42,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:42,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:08:42,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:42,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:08:42,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:08:42,132 INFO L87 Difference]: Start difference. First operand 17737 states and 25401 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:42,578 INFO L93 Difference]: Finished difference Result 31701 states and 45343 transitions. [2025-03-03 16:08:42,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:08:42,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 16:08:42,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:42,620 INFO L225 Difference]: With dead ends: 31701 [2025-03-03 16:08:42,621 INFO L226 Difference]: Without dead ends: 28739 [2025-03-03 16:08:42,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:08:42,628 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 6327 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6327 SdHoareTripleChecker+Valid, 3675 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:42,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6327 Valid, 3675 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:08:42,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28739 states. [2025-03-03 16:08:42,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28739 to 20697. [2025-03-03 16:08:43,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20697 states, 20695 states have (on average 1.4291857936699686) internal successors, (29577), 20696 states have internal predecessors, (29577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:43,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20697 states to 20697 states and 29577 transitions. [2025-03-03 16:08:43,028 INFO L78 Accepts]: Start accepts. Automaton has 20697 states and 29577 transitions. Word has length 77 [2025-03-03 16:08:43,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:43,029 INFO L471 AbstractCegarLoop]: Abstraction has 20697 states and 29577 transitions. [2025-03-03 16:08:43,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 20697 states and 29577 transitions. [2025-03-03 16:08:43,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 16:08:43,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:43,032 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:43,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:08:43,032 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:43,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:43,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1735618441, now seen corresponding path program 1 times [2025-03-03 16:08:43,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:43,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894844099] [2025-03-03 16:08:43,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:43,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:43,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 16:08:43,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 16:08:43,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:43,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:43,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:43,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894844099] [2025-03-03 16:08:43,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894844099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:43,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:43,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:08:43,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148905696] [2025-03-03 16:08:43,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:43,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:08:43,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:43,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:08:43,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:43,090 INFO L87 Difference]: Start difference. First operand 20697 states and 29577 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:43,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:43,393 INFO L93 Difference]: Finished difference Result 39101 states and 55563 transitions. [2025-03-03 16:08:43,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:08:43,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 16:08:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:43,416 INFO L225 Difference]: With dead ends: 39101 [2025-03-03 16:08:43,416 INFO L226 Difference]: Without dead ends: 20699 [2025-03-03 16:08:43,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:43,433 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 45 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3108 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:43,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3108 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:08:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20699 states. [2025-03-03 16:08:43,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20699 to 20697. [2025-03-03 16:08:43,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20697 states, 20695 states have (on average 1.4148828219376661) internal successors, (29281), 20696 states have internal predecessors, (29281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:43,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20697 states to 20697 states and 29281 transitions. [2025-03-03 16:08:43,798 INFO L78 Accepts]: Start accepts. Automaton has 20697 states and 29281 transitions. Word has length 78 [2025-03-03 16:08:43,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:43,799 INFO L471 AbstractCegarLoop]: Abstraction has 20697 states and 29281 transitions. [2025-03-03 16:08:43,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 20697 states and 29281 transitions. [2025-03-03 16:08:43,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:08:43,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:43,801 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:43,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:08:43,801 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:43,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:43,801 INFO L85 PathProgramCache]: Analyzing trace with hash -783999357, now seen corresponding path program 1 times [2025-03-03 16:08:43,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:43,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822094265] [2025-03-03 16:08:43,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:43,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:43,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:08:43,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:08:43,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:43,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:43,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:43,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822094265] [2025-03-03 16:08:43,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822094265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:43,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:43,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:08:43,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193340312] [2025-03-03 16:08:43,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:43,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:08:43,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:43,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:08:43,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:43,865 INFO L87 Difference]: Start difference. First operand 20697 states and 29281 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:44,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:44,077 INFO L93 Difference]: Finished difference Result 27584 states and 38975 transitions. [2025-03-03 16:08:44,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:08:44,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 16:08:44,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:44,088 INFO L225 Difference]: With dead ends: 27584 [2025-03-03 16:08:44,089 INFO L226 Difference]: Without dead ends: 9182 [2025-03-03 16:08:44,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:44,102 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 39 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3105 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:44,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3105 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:08:44,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9182 states. [2025-03-03 16:08:44,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9182 to 9174. [2025-03-03 16:08:44,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9174 states, 9172 states have (on average 1.4363279546445704) internal successors, (13174), 9173 states have internal predecessors, (13174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9174 states to 9174 states and 13174 transitions. [2025-03-03 16:08:44,325 INFO L78 Accepts]: Start accepts. Automaton has 9174 states and 13174 transitions. Word has length 79 [2025-03-03 16:08:44,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:44,325 INFO L471 AbstractCegarLoop]: Abstraction has 9174 states and 13174 transitions. [2025-03-03 16:08:44,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:44,325 INFO L276 IsEmpty]: Start isEmpty. Operand 9174 states and 13174 transitions. [2025-03-03 16:08:44,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 16:08:44,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:44,326 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:44,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:08:44,327 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:44,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:44,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1691147440, now seen corresponding path program 1 times [2025-03-03 16:08:44,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:44,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924282126] [2025-03-03 16:08:44,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:44,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:44,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 16:08:44,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 16:08:44,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:44,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:44,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:44,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924282126] [2025-03-03 16:08:44,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924282126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:44,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:44,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:08:44,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215851786] [2025-03-03 16:08:44,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:44,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:08:44,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:44,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:08:44,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:44,409 INFO L87 Difference]: Start difference. First operand 9174 states and 13174 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:44,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:44,507 INFO L93 Difference]: Finished difference Result 12610 states and 17960 transitions. [2025-03-03 16:08:44,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:08:44,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-03 16:08:44,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:44,514 INFO L225 Difference]: With dead ends: 12610 [2025-03-03 16:08:44,515 INFO L226 Difference]: Without dead ends: 5744 [2025-03-03 16:08:44,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:44,523 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 41 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3084 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:44,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3084 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:08:44,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5744 states. [2025-03-03 16:08:44,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5744 to 5742. [2025-03-03 16:08:44,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5742 states, 5740 states have (on average 1.4526132404181185) internal successors, (8338), 5741 states have internal predecessors, (8338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5742 states to 5742 states and 8338 transitions. [2025-03-03 16:08:44,653 INFO L78 Accepts]: Start accepts. Automaton has 5742 states and 8338 transitions. Word has length 80 [2025-03-03 16:08:44,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:44,654 INFO L471 AbstractCegarLoop]: Abstraction has 5742 states and 8338 transitions. [2025-03-03 16:08:44,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:44,654 INFO L276 IsEmpty]: Start isEmpty. Operand 5742 states and 8338 transitions. [2025-03-03 16:08:44,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 16:08:44,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:44,655 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:44,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:08:44,656 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:44,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:44,656 INFO L85 PathProgramCache]: Analyzing trace with hash 234523383, now seen corresponding path program 1 times [2025-03-03 16:08:44,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:44,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873601328] [2025-03-03 16:08:44,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:44,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:44,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 16:08:44,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 16:08:44,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:44,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:44,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:44,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873601328] [2025-03-03 16:08:44,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873601328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:44,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:44,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:08:44,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197772533] [2025-03-03 16:08:44,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:44,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:08:44,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:44,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:08:44,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:44,736 INFO L87 Difference]: Start difference. First operand 5742 states and 8338 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:44,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:44,795 INFO L93 Difference]: Finished difference Result 7462 states and 10706 transitions. [2025-03-03 16:08:44,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:08:44,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-03 16:08:44,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:44,800 INFO L225 Difference]: With dead ends: 7462 [2025-03-03 16:08:44,800 INFO L226 Difference]: Without dead ends: 4028 [2025-03-03 16:08:44,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:44,804 INFO L435 NwaCegarLoop]: 1562 mSDtfsCounter, 38 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:44,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3069 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:08:44,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4028 states. [2025-03-03 16:08:44,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4028 to 4026. [2025-03-03 16:08:44,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4026 states, 4024 states have (on average 1.4776341948310139) internal successors, (5946), 4025 states have internal predecessors, (5946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4026 states to 4026 states and 5946 transitions. [2025-03-03 16:08:44,885 INFO L78 Accepts]: Start accepts. Automaton has 4026 states and 5946 transitions. Word has length 82 [2025-03-03 16:08:44,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:44,886 INFO L471 AbstractCegarLoop]: Abstraction has 4026 states and 5946 transitions. [2025-03-03 16:08:44,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:44,887 INFO L276 IsEmpty]: Start isEmpty. Operand 4026 states and 5946 transitions. [2025-03-03 16:08:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 16:08:44,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:44,888 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:44,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:08:44,888 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:44,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:44,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1533089186, now seen corresponding path program 1 times [2025-03-03 16:08:44,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:44,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953293912] [2025-03-03 16:08:44,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:44,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:44,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 16:08:44,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 16:08:44,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:44,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:44,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:44,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953293912] [2025-03-03 16:08:44,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953293912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:08:44,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:08:44,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:08:44,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85583079] [2025-03-03 16:08:44,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:08:44,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:08:44,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:44,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:08:44,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:44,965 INFO L87 Difference]: Start difference. First operand 4026 states and 5946 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:45,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:45,006 INFO L93 Difference]: Finished difference Result 4888 states and 7118 transitions. [2025-03-03 16:08:45,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:08:45,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-03 16:08:45,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:45,012 INFO L225 Difference]: With dead ends: 4888 [2025-03-03 16:08:45,012 INFO L226 Difference]: Without dead ends: 3170 [2025-03-03 16:08:45,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:08:45,015 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 35 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3054 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:45,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3054 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:08:45,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2025-03-03 16:08:45,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 3168. [2025-03-03 16:08:45,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3168 states, 3166 states have (on average 1.5044219835754895) internal successors, (4763), 3167 states have internal predecessors, (4763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:45,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 4763 transitions. [2025-03-03 16:08:45,069 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 4763 transitions. Word has length 84 [2025-03-03 16:08:45,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:45,070 INFO L471 AbstractCegarLoop]: Abstraction has 3168 states and 4763 transitions. [2025-03-03 16:08:45,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:45,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 4763 transitions. [2025-03-03 16:08:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 16:08:45,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:45,071 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:45,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:08:45,071 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:45,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:45,072 INFO L85 PathProgramCache]: Analyzing trace with hash 296643301, now seen corresponding path program 1 times [2025-03-03 16:08:45,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:45,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802854668] [2025-03-03 16:08:45,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:45,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:45,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 16:08:45,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 16:08:45,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:45,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:08:45,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:45,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802854668] [2025-03-03 16:08:45,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802854668] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:08:45,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404696912] [2025-03-03 16:08:45,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:45,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:08:45,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:08:45,186 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:08:45,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:08:45,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 16:08:45,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 16:08:45,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:45,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:45,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:08:45,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:08:45,675 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:45,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:08:46,357 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:46,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404696912] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:08:46,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:08:46,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 20 [2025-03-03 16:08:46,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426339470] [2025-03-03 16:08:46,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:08:46,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 16:08:46,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:46,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 16:08:46,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:08:46,360 INFO L87 Difference]: Start difference. First operand 3168 states and 4763 transitions. Second operand has 20 states, 20 states have (on average 11.45) internal successors, (229), 20 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:46,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:46,981 INFO L93 Difference]: Finished difference Result 5824 states and 8251 transitions. [2025-03-03 16:08:46,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 16:08:46,982 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 11.45) internal successors, (229), 20 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-03 16:08:46,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:46,986 INFO L225 Difference]: With dead ends: 5824 [2025-03-03 16:08:46,986 INFO L226 Difference]: Without dead ends: 4964 [2025-03-03 16:08:46,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=358, Invalid=1124, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 16:08:46,988 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 12618 mSDsluCounter, 4857 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12618 SdHoareTripleChecker+Valid, 6370 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:46,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12618 Valid, 6370 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:08:46,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4964 states. [2025-03-03 16:08:47,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4964 to 4784. [2025-03-03 16:08:47,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4784 states, 4782 states have (on average 1.4196988707653702) internal successors, (6789), 4783 states have internal predecessors, (6789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:47,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4784 states to 4784 states and 6789 transitions. [2025-03-03 16:08:47,052 INFO L78 Accepts]: Start accepts. Automaton has 4784 states and 6789 transitions. Word has length 86 [2025-03-03 16:08:47,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:47,052 INFO L471 AbstractCegarLoop]: Abstraction has 4784 states and 6789 transitions. [2025-03-03 16:08:47,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.45) internal successors, (229), 20 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:47,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4784 states and 6789 transitions. [2025-03-03 16:08:47,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 16:08:47,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:47,053 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:47,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 16:08:47,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-03 16:08:47,257 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:47,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:47,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1562871412, now seen corresponding path program 1 times [2025-03-03 16:08:47,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:47,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522682660] [2025-03-03 16:08:47,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:47,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:47,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 16:08:47,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 16:08:47,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:47,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:47,590 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:47,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:47,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522682660] [2025-03-03 16:08:47,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522682660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:08:47,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640957656] [2025-03-03 16:08:47,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:47,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:08:47,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:08:47,593 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:08:47,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 16:08:47,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 16:08:47,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 16:08:47,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:47,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:47,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:08:47,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:08:48,064 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:48,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:08:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:48,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640957656] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:08:48,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:08:48,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-03 16:08:48,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043798219] [2025-03-03 16:08:48,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:08:48,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 16:08:48,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:48,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 16:08:48,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-03 16:08:48,731 INFO L87 Difference]: Start difference. First operand 4784 states and 6789 transitions. Second operand has 25 states, 25 states have (on average 9.64) internal successors, (241), 24 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:49,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:49,916 INFO L93 Difference]: Finished difference Result 13232 states and 17815 transitions. [2025-03-03 16:08:49,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 16:08:49,916 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.64) internal successors, (241), 24 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-03 16:08:49,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:49,925 INFO L225 Difference]: With dead ends: 13232 [2025-03-03 16:08:49,925 INFO L226 Difference]: Without dead ends: 10885 [2025-03-03 16:08:49,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=494, Invalid=1956, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 16:08:49,929 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 16979 mSDsluCounter, 5230 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16979 SdHoareTripleChecker+Valid, 6740 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:49,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16979 Valid, 6740 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:08:49,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10885 states. [2025-03-03 16:08:50,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10885 to 9081. [2025-03-03 16:08:50,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9081 states, 9079 states have (on average 1.348716819032933) internal successors, (12245), 9080 states have internal predecessors, (12245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:50,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9081 states to 9081 states and 12245 transitions. [2025-03-03 16:08:50,123 INFO L78 Accepts]: Start accepts. Automaton has 9081 states and 12245 transitions. Word has length 87 [2025-03-03 16:08:50,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:50,123 INFO L471 AbstractCegarLoop]: Abstraction has 9081 states and 12245 transitions. [2025-03-03 16:08:50,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.64) internal successors, (241), 24 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 9081 states and 12245 transitions. [2025-03-03 16:08:50,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 16:08:50,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:50,124 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:50,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 16:08:50,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-03 16:08:50,325 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:50,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:50,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1784058686, now seen corresponding path program 1 times [2025-03-03 16:08:50,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:50,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914338605] [2025-03-03 16:08:50,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:50,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:50,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 16:08:50,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 16:08:50,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:50,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:50,571 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:50,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:50,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914338605] [2025-03-03 16:08:50,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914338605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:08:50,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959669328] [2025-03-03 16:08:50,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:50,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:08:50,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:08:50,575 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:08:50,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 16:08:50,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 16:08:50,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 16:08:50,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:50,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:50,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:08:50,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:08:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:50,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:08:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:51,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959669328] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:08:51,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:08:51,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-03 16:08:51,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591958761] [2025-03-03 16:08:51,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:08:51,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 16:08:51,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:08:51,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 16:08:51,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2025-03-03 16:08:51,424 INFO L87 Difference]: Start difference. First operand 9081 states and 12245 transitions. Second operand has 25 states, 25 states have (on average 8.96) internal successors, (224), 24 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:08:53,531 INFO L93 Difference]: Finished difference Result 46877 states and 61261 transitions. [2025-03-03 16:08:53,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-03 16:08:53,532 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.96) internal successors, (224), 24 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-03 16:08:53,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:08:53,566 INFO L225 Difference]: With dead ends: 46877 [2025-03-03 16:08:53,566 INFO L226 Difference]: Without dead ends: 40504 [2025-03-03 16:08:53,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=690, Invalid=2970, Unknown=0, NotChecked=0, Total=3660 [2025-03-03 16:08:53,572 INFO L435 NwaCegarLoop]: 1545 mSDtfsCounter, 20733 mSDsluCounter, 8465 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20733 SdHoareTripleChecker+Valid, 10010 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:08:53,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20733 Valid, 10010 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:08:53,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40504 states. [2025-03-03 16:08:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40504 to 28630. [2025-03-03 16:08:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28630 states, 28628 states have (on average 1.2850705602906245) internal successors, (36789), 28629 states have internal predecessors, (36789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28630 states to 28630 states and 36789 transitions. [2025-03-03 16:08:54,373 INFO L78 Accepts]: Start accepts. Automaton has 28630 states and 36789 transitions. Word has length 88 [2025-03-03 16:08:54,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:08:54,374 INFO L471 AbstractCegarLoop]: Abstraction has 28630 states and 36789 transitions. [2025-03-03 16:08:54,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.96) internal successors, (224), 24 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:08:54,374 INFO L276 IsEmpty]: Start isEmpty. Operand 28630 states and 36789 transitions. [2025-03-03 16:08:54,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:08:54,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:08:54,376 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:08:54,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 16:08:54,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:08:54,576 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:08:54,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:08:54,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1917138110, now seen corresponding path program 1 times [2025-03-03 16:08:54,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:08:54,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133434224] [2025-03-03 16:08:54,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:54,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:08:54,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:08:54,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:08:54,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:54,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:57,137 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:08:57,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:08:57,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133434224] [2025-03-03 16:08:57,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133434224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:08:57,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079325562] [2025-03-03 16:08:57,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:08:57,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:08:57,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:08:57,140 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:08:57,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 16:08:57,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:08:57,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:08:57,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:08:57,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:08:57,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-03-03 16:08:57,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:09:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:03,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:09:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:10,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079325562] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:09:10,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:09:10,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 36, 31] total 96 [2025-03-03 16:09:10,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416151067] [2025-03-03 16:09:10,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:09:10,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-03 16:09:10,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:10,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-03 16:09:10,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1045, Invalid=8075, Unknown=0, NotChecked=0, Total=9120 [2025-03-03 16:09:10,985 INFO L87 Difference]: Start difference. First operand 28630 states and 36789 transitions. Second operand has 96 states, 96 states have (on average 2.6666666666666665) internal successors, (256), 96 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)