./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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.4.ufo.UNBOUNDED.pals+Problem12_label06.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 f5d324be5cda3ace002cd56bcc40157f7761355257d743a63929a31342660554 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:24:58,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:24:58,574 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:24:58,580 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:24:58,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:24:58,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:24:58,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:24:58,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:24:58,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:24:58,606 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:24:58,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:24:58,607 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:24:58,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:24:58,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:24:58,608 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:24:58,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:24:58,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:24:58,608 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:24:58,608 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:24:58,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:24:58,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:24:58,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:24:58,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:24:58,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:24:58,609 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:24:58,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:24:58,609 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:24:58,609 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:24:58,609 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:24:58,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:24:58,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:24:58,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:24:58,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:24:58,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:24:58,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:24:58,610 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:24:58,610 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:24:58,610 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:24:58,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:24:58,610 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:24:58,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:24:58,610 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:24:58,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:24:58,610 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 -> f5d324be5cda3ace002cd56bcc40157f7761355257d743a63929a31342660554 [2025-03-16 20:24:58,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:24:58,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:24:58,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:24:58,836 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:24:58,836 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:24:58,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label06.c [2025-03-16 20:24:59,925 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12f5d6efa/bb3a0dc8a43c43fdaf7eedc107eb6593/FLAG3d40f5f2f [2025-03-16 20:25:00,416 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:25:00,417 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label06.c [2025-03-16 20:25:00,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12f5d6efa/bb3a0dc8a43c43fdaf7eedc107eb6593/FLAG3d40f5f2f [2025-03-16 20:25:00,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12f5d6efa/bb3a0dc8a43c43fdaf7eedc107eb6593 [2025-03-16 20:25:00,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:25:00,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:25:00,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:25:00,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:25:00,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:25:00,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:25:00" (1/1) ... [2025-03-16 20:25:00,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29785afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:00, skipping insertion in model container [2025-03-16 20:25:00,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:25:00" (1/1) ... [2025-03-16 20:25:00,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:25:00,874 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.4.ufo.UNBOUNDED.pals+Problem12_label06.c[8712,8725] [2025-03-16 20:25:00,923 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.4.ufo.UNBOUNDED.pals+Problem12_label06.c[11529,11542] [2025-03-16 20:25:01,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:25:01,404 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:25:01,433 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.4.ufo.UNBOUNDED.pals+Problem12_label06.c[8712,8725] [2025-03-16 20:25:01,438 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.4.ufo.UNBOUNDED.pals+Problem12_label06.c[11529,11542] [2025-03-16 20:25:01,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:25:01,708 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:25:01,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01 WrapperNode [2025-03-16 20:25:01,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:25:01,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:25:01,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:25:01,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:25:01,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:01,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:02,037 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5033 [2025-03-16 20:25:02,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:25:02,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:25:02,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:25:02,039 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:25:02,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:02,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:02,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:02,202 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-16 20:25:02,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:02,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:02,350 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:02,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:02,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:02,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:02,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:25:02,430 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:25:02,430 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:25:02,430 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:25:02,431 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (1/1) ... [2025-03-16 20:25:02,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:25:02,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:02,457 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-16 20:25:02,463 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-16 20:25:02,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:25:02,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:25:02,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:25:02,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:25:02,538 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:25:02,539 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:25:05,799 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5025: havoc calculate_output3_#t~ret35#1; [2025-03-16 20:25:05,800 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2056: havoc calculate_output_#t~ret33#1; [2025-03-16 20:25:05,801 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3535: havoc calculate_output2_#t~ret34#1; [2025-03-16 20:25:05,962 INFO L? ?]: Removed 735 outVars from TransFormulas that were not future-live. [2025-03-16 20:25:05,962 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:25:05,996 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:25:05,996 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:25:05,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:25:05 BoogieIcfgContainer [2025-03-16 20:25:05,996 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:25:05,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:25:05,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:25:06,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:25:06,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:25:00" (1/3) ... [2025-03-16 20:25:06,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c931d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:25:06, skipping insertion in model container [2025-03-16 20:25:06,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:01" (2/3) ... [2025-03-16 20:25:06,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c931d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:25:06, skipping insertion in model container [2025-03-16 20:25:06,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:25:05" (3/3) ... [2025-03-16 20:25:06,004 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label06.c [2025-03-16 20:25:06,014 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:25:06,016 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label06.c that has 1 procedures, 822 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:25:06,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:25:06,095 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;@22c20159, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:25:06,095 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:25:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand has 822 states, 819 states have (on average 1.9743589743589745) internal successors, (1617), 821 states have internal predecessors, (1617), 0 states have call successors, (0), 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-16 20:25:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 20:25:06,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:06,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:06,108 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:06,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:06,112 INFO L85 PathProgramCache]: Analyzing trace with hash 640465911, now seen corresponding path program 1 times [2025-03-16 20:25:06,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:06,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559544297] [2025-03-16 20:25:06,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:06,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:06,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 20:25:06,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 20:25:06,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:06,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:06,285 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-16 20:25:06,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:06,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559544297] [2025-03-16 20:25:06,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559544297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:06,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:06,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:25:06,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993880057] [2025-03-16 20:25:06,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:06,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:25:06,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:06,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:25:06,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:25:06,347 INFO L87 Difference]: Start difference. First operand has 822 states, 819 states have (on average 1.9743589743589745) internal successors, (1617), 821 states have internal predecessors, (1617), 0 states have call successors, (0), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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-16 20:25:06,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:06,410 INFO L93 Difference]: Finished difference Result 1617 states and 3182 transitions. [2025-03-16 20:25:06,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:25:06,412 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-16 20:25:06,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:06,425 INFO L225 Difference]: With dead ends: 1617 [2025-03-16 20:25:06,428 INFO L226 Difference]: Without dead ends: 818 [2025-03-16 20:25:06,435 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-16 20:25:06,437 INFO L435 NwaCegarLoop]: 1552 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, 1552 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-16 20:25:06,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:06,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2025-03-16 20:25:06,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2025-03-16 20:25:06,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 816 states have (on average 1.8970588235294117) internal successors, (1548), 817 states have internal predecessors, (1548), 0 states have call successors, (0), 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-16 20:25:06,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1548 transitions. [2025-03-16 20:25:06,497 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1548 transitions. Word has length 19 [2025-03-16 20:25:06,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:06,499 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1548 transitions. [2025-03-16 20:25:06,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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-16 20:25:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1548 transitions. [2025-03-16 20:25:06,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 20:25:06,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:06,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:06,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:25:06,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:06,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:06,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2146949576, now seen corresponding path program 1 times [2025-03-16 20:25:06,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:06,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207477420] [2025-03-16 20:25:06,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:06,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:06,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 20:25:06,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 20:25:06,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:06,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:06,709 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-16 20:25:06,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:06,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207477420] [2025-03-16 20:25:06,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207477420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:06,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:06,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:25:06,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665214508] [2025-03-16 20:25:06,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:06,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:25:06,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:06,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:25:06,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:25:06,711 INFO L87 Difference]: Start difference. First operand 818 states and 1548 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-16 20:25:06,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:06,799 INFO L93 Difference]: Finished difference Result 858 states and 1610 transitions. [2025-03-16 20:25:06,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:25:06,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-16 20:25:06,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:06,803 INFO L225 Difference]: With dead ends: 858 [2025-03-16 20:25:06,806 INFO L226 Difference]: Without dead ends: 818 [2025-03-16 20:25:06,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:25:06,807 INFO L435 NwaCegarLoop]: 1547 mSDtfsCounter, 0 mSDsluCounter, 3067 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4614 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:06,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4614 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:06,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2025-03-16 20:25:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2025-03-16 20:25:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 816 states have (on average 1.8688725490196079) internal successors, (1525), 817 states have internal predecessors, (1525), 0 states have call successors, (0), 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-16 20:25:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1525 transitions. [2025-03-16 20:25:06,833 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1525 transitions. Word has length 19 [2025-03-16 20:25:06,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:06,833 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1525 transitions. [2025-03-16 20:25:06,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-16 20:25:06,833 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1525 transitions. [2025-03-16 20:25:06,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 20:25:06,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:06,834 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] [2025-03-16 20:25:06,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:25:06,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:06,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:06,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2138805323, now seen corresponding path program 1 times [2025-03-16 20:25:06,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:06,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567912290] [2025-03-16 20:25:06,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:06,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:06,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 20:25:06,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 20:25:06,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:06,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:06,912 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-16 20:25:06,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:06,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567912290] [2025-03-16 20:25:06,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567912290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:06,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:06,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:25:06,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754923752] [2025-03-16 20:25:06,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:06,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:06,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:06,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:06,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:06,914 INFO L87 Difference]: Start difference. First operand 818 states and 1525 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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-16 20:25:09,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:09,477 INFO L93 Difference]: Finished difference Result 2322 states and 4398 transitions. [2025-03-16 20:25:09,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:09,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-03-16 20:25:09,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:09,487 INFO L225 Difference]: With dead ends: 2322 [2025-03-16 20:25:09,488 INFO L226 Difference]: Without dead ends: 1569 [2025-03-16 20:25:09,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:09,489 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 881 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:09,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 514 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 20:25:09,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2025-03-16 20:25:09,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2025-03-16 20:25:09,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1567 states have (on average 1.6285896617740907) internal successors, (2552), 1568 states have internal predecessors, (2552), 0 states have call successors, (0), 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-16 20:25:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2552 transitions. [2025-03-16 20:25:09,518 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2552 transitions. Word has length 23 [2025-03-16 20:25:09,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:09,518 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 2552 transitions. [2025-03-16 20:25:09,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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-16 20:25:09,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2552 transitions. [2025-03-16 20:25:09,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 20:25:09,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:09,519 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] [2025-03-16 20:25:09,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:25:09,519 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:09,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:09,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1633251230, now seen corresponding path program 1 times [2025-03-16 20:25:09,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:09,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733203727] [2025-03-16 20:25:09,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:09,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:09,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 20:25:09,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 20:25:09,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:09,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:09,641 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-16 20:25:09,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:09,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733203727] [2025-03-16 20:25:09,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733203727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:09,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:09,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:09,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220951518] [2025-03-16 20:25:09,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:09,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:09,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:09,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:09,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:09,642 INFO L87 Difference]: Start difference. First operand 1569 states and 2552 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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-16 20:25:09,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:09,759 INFO L93 Difference]: Finished difference Result 1865 states and 3024 transitions. [2025-03-16 20:25:09,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:25:09,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-03-16 20:25:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:09,765 INFO L225 Difference]: With dead ends: 1865 [2025-03-16 20:25:09,766 INFO L226 Difference]: Without dead ends: 1828 [2025-03-16 20:25:09,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:25:09,767 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 6359 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6359 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:09,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6359 Valid, 1993 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:25:09,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2025-03-16 20:25:09,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1604. [2025-03-16 20:25:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1602 states have (on average 1.6279650436953808) internal successors, (2608), 1603 states have internal predecessors, (2608), 0 states have call successors, (0), 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-16 20:25:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2608 transitions. [2025-03-16 20:25:09,795 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2608 transitions. Word has length 41 [2025-03-16 20:25:09,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:09,795 INFO L471 AbstractCegarLoop]: Abstraction has 1604 states and 2608 transitions. [2025-03-16 20:25:09,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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-16 20:25:09,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2608 transitions. [2025-03-16 20:25:09,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 20:25:09,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:09,797 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] [2025-03-16 20:25:09,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:25:09,797 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:09,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:09,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1854186780, now seen corresponding path program 1 times [2025-03-16 20:25:09,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:09,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625086218] [2025-03-16 20:25:09,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:09,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:09,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 20:25:09,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 20:25:09,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:09,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:10,018 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-16 20:25:10,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:10,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625086218] [2025-03-16 20:25:10,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625086218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:10,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:10,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:10,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334055556] [2025-03-16 20:25:10,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:10,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:10,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:10,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:10,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:10,019 INFO L87 Difference]: Start difference. First operand 1604 states and 2608 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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-16 20:25:10,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:10,109 INFO L93 Difference]: Finished difference Result 1678 states and 2724 transitions. [2025-03-16 20:25:10,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:10,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-16 20:25:10,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:10,115 INFO L225 Difference]: With dead ends: 1678 [2025-03-16 20:25:10,115 INFO L226 Difference]: Without dead ends: 1606 [2025-03-16 20:25:10,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:25:10,116 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 4449 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4449 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:10,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4449 Valid, 1684 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:10,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-03-16 20:25:10,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1604. [2025-03-16 20:25:10,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1602 states have (on average 1.6273408239700375) internal successors, (2607), 1603 states have internal predecessors, (2607), 0 states have call successors, (0), 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-16 20:25:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2607 transitions. [2025-03-16 20:25:10,148 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2607 transitions. Word has length 43 [2025-03-16 20:25:10,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:10,149 INFO L471 AbstractCegarLoop]: Abstraction has 1604 states and 2607 transitions. [2025-03-16 20:25:10,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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-16 20:25:10,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2607 transitions. [2025-03-16 20:25:10,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 20:25:10,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:10,152 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] [2025-03-16 20:25:10,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:25:10,153 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:10,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:10,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1855229465, now seen corresponding path program 1 times [2025-03-16 20:25:10,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:10,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798031564] [2025-03-16 20:25:10,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:10,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:10,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 20:25:10,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 20:25:10,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:10,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:10,239 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-16 20:25:10,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:10,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798031564] [2025-03-16 20:25:10,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798031564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:10,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:10,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:10,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46855934] [2025-03-16 20:25:10,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:10,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:10,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:10,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:10,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:10,243 INFO L87 Difference]: Start difference. First operand 1604 states and 2607 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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-16 20:25:10,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:10,270 INFO L93 Difference]: Finished difference Result 1737 states and 2816 transitions. [2025-03-16 20:25:10,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:10,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-16 20:25:10,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:10,276 INFO L225 Difference]: With dead ends: 1737 [2025-03-16 20:25:10,277 INFO L226 Difference]: Without dead ends: 1665 [2025-03-16 20:25:10,277 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-16 20:25:10,278 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:10,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1573 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:10,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2025-03-16 20:25:10,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1661. [2025-03-16 20:25:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1659 states have (on average 1.623869801084991) internal successors, (2694), 1660 states have internal predecessors, (2694), 0 states have call successors, (0), 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-16 20:25:10,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2694 transitions. [2025-03-16 20:25:10,308 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2694 transitions. Word has length 43 [2025-03-16 20:25:10,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:10,309 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 2694 transitions. [2025-03-16 20:25:10,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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-16 20:25:10,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2694 transitions. [2025-03-16 20:25:10,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 20:25:10,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:10,309 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] [2025-03-16 20:25:10,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:25:10,310 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:10,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:10,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1644230272, now seen corresponding path program 1 times [2025-03-16 20:25:10,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:10,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65975636] [2025-03-16 20:25:10,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:10,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:10,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 20:25:10,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 20:25:10,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:10,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:10,478 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-16 20:25:10,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:10,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65975636] [2025-03-16 20:25:10,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65975636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:10,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:10,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:25:10,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278994527] [2025-03-16 20:25:10,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:10,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:25:10,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:10,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:25:10,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:25:10,479 INFO L87 Difference]: Start difference. First operand 1661 states and 2694 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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-16 20:25:10,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:10,506 INFO L93 Difference]: Finished difference Result 1667 states and 2701 transitions. [2025-03-16 20:25:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:25:10,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-03-16 20:25:10,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:10,512 INFO L225 Difference]: With dead ends: 1667 [2025-03-16 20:25:10,512 INFO L226 Difference]: Without dead ends: 1665 [2025-03-16 20:25:10,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:25:10,513 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 0 mSDsluCounter, 3038 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4561 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:10,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4561 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:10,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2025-03-16 20:25:10,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2025-03-16 20:25:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1663 states have (on average 1.6217678893565846) internal successors, (2697), 1664 states have internal predecessors, (2697), 0 states have call successors, (0), 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-16 20:25:10,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2697 transitions. [2025-03-16 20:25:10,541 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2697 transitions. Word has length 44 [2025-03-16 20:25:10,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:10,542 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2697 transitions. [2025-03-16 20:25:10,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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-16 20:25:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2697 transitions. [2025-03-16 20:25:10,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:25:10,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:10,544 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] [2025-03-16 20:25:10,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:25:10,544 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:10,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:10,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2138271558, now seen corresponding path program 1 times [2025-03-16 20:25:10,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:10,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137420793] [2025-03-16 20:25:10,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:10,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:10,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:25:10,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:25:10,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:10,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:10,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:10,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137420793] [2025-03-16 20:25:10,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137420793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:10,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:10,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:10,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591166661] [2025-03-16 20:25:10,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:10,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:10,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:10,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:10,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:10,609 INFO L87 Difference]: Start difference. First operand 1665 states and 2697 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-16 20:25:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:10,631 INFO L93 Difference]: Finished difference Result 1915 states and 3077 transitions. [2025-03-16 20:25:10,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:10,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-16 20:25:10,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:10,637 INFO L225 Difference]: With dead ends: 1915 [2025-03-16 20:25:10,637 INFO L226 Difference]: Without dead ends: 1782 [2025-03-16 20:25:10,638 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-16 20:25:10,638 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 1483 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 1619 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-16 20:25:10,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 1619 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:10,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2025-03-16 20:25:10,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1780. [2025-03-16 20:25:10,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1778 states have (on average 1.6130483689538808) internal successors, (2868), 1779 states have internal predecessors, (2868), 0 states have call successors, (0), 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-16 20:25:10,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2868 transitions. [2025-03-16 20:25:10,672 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2868 transitions. Word has length 45 [2025-03-16 20:25:10,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:10,672 INFO L471 AbstractCegarLoop]: Abstraction has 1780 states and 2868 transitions. [2025-03-16 20:25:10,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-16 20:25:10,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2868 transitions. [2025-03-16 20:25:10,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:25:10,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:10,673 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] [2025-03-16 20:25:10,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:25:10,673 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:10,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:10,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1588482630, now seen corresponding path program 1 times [2025-03-16 20:25:10,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:10,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860314509] [2025-03-16 20:25:10,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:10,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:10,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:25:10,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:25:10,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:10,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:10,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:10,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860314509] [2025-03-16 20:25:10,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860314509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:10,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:10,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:10,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232752661] [2025-03-16 20:25:10,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:10,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:10,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:10,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:10,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:10,727 INFO L87 Difference]: Start difference. First operand 1780 states and 2868 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-16 20:25:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:10,747 INFO L93 Difference]: Finished difference Result 2244 states and 3562 transitions. [2025-03-16 20:25:10,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:10,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-16 20:25:10,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:10,753 INFO L225 Difference]: With dead ends: 2244 [2025-03-16 20:25:10,753 INFO L226 Difference]: Without dead ends: 1996 [2025-03-16 20:25:10,754 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-16 20:25:10,755 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 1481 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1481 SdHoareTripleChecker+Valid, 1621 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-16 20:25:10,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1481 Valid, 1621 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:10,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2025-03-16 20:25:10,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1994. [2025-03-16 20:25:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1994 states, 1992 states have (on average 1.5953815261044177) internal successors, (3178), 1993 states have internal predecessors, (3178), 0 states have call successors, (0), 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-16 20:25:10,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 3178 transitions. [2025-03-16 20:25:10,789 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 3178 transitions. Word has length 45 [2025-03-16 20:25:10,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:10,790 INFO L471 AbstractCegarLoop]: Abstraction has 1994 states and 3178 transitions. [2025-03-16 20:25:10,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-16 20:25:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 3178 transitions. [2025-03-16 20:25:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:25:10,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:10,790 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] [2025-03-16 20:25:10,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:25:10,791 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:10,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:10,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2090513338, now seen corresponding path program 1 times [2025-03-16 20:25:10,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:10,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879862180] [2025-03-16 20:25:10,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:10,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:10,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:25:10,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:25:10,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:10,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:10,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:10,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:10,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879862180] [2025-03-16 20:25:10,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879862180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:10,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:10,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:10,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232002896] [2025-03-16 20:25:10,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:10,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:10,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:10,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:10,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:10,838 INFO L87 Difference]: Start difference. First operand 1994 states and 3178 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-16 20:25:10,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:10,865 INFO L93 Difference]: Finished difference Result 2854 states and 4436 transitions. [2025-03-16 20:25:10,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:10,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-16 20:25:10,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:10,873 INFO L225 Difference]: With dead ends: 2854 [2025-03-16 20:25:10,873 INFO L226 Difference]: Without dead ends: 2392 [2025-03-16 20:25:10,874 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-16 20:25:10,874 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1485 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1625 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-16 20:25:10,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 1625 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:10,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2025-03-16 20:25:10,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2390. [2025-03-16 20:25:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2390 states, 2388 states have (on average 1.5636515912897822) internal successors, (3734), 2389 states have internal predecessors, (3734), 0 states have call successors, (0), 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-16 20:25:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3734 transitions. [2025-03-16 20:25:10,917 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3734 transitions. Word has length 45 [2025-03-16 20:25:10,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:10,917 INFO L471 AbstractCegarLoop]: Abstraction has 2390 states and 3734 transitions. [2025-03-16 20:25:10,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-16 20:25:10,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3734 transitions. [2025-03-16 20:25:10,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 20:25:10,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:10,918 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] [2025-03-16 20:25:10,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:25:10,918 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:10,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:10,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1194131558, now seen corresponding path program 1 times [2025-03-16 20:25:10,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:10,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747036680] [2025-03-16 20:25:10,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:10,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:10,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 20:25:10,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 20:25:10,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:10,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:10,960 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-16 20:25:10,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:10,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747036680] [2025-03-16 20:25:10,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747036680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:10,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:10,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:10,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413597653] [2025-03-16 20:25:10,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:10,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:10,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:10,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:10,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:10,962 INFO L87 Difference]: Start difference. First operand 2390 states and 3734 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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-16 20:25:10,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:10,990 INFO L93 Difference]: Finished difference Result 3293 states and 5068 transitions. [2025-03-16 20:25:10,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:10,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-16 20:25:10,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:10,998 INFO L225 Difference]: With dead ends: 3293 [2025-03-16 20:25:10,998 INFO L226 Difference]: Without dead ends: 2794 [2025-03-16 20:25:11,000 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-16 20:25:11,001 INFO L435 NwaCegarLoop]: 1566 mSDtfsCounter, 1484 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1626 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-16 20:25:11,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1626 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:11,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2794 states. [2025-03-16 20:25:11,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2794 to 2792. [2025-03-16 20:25:11,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2792 states, 2790 states have (on average 1.542652329749104) internal successors, (4304), 2791 states have internal predecessors, (4304), 0 states have call successors, (0), 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-16 20:25:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 4304 transitions. [2025-03-16 20:25:11,048 INFO L78 Accepts]: Start accepts. Automaton has 2792 states and 4304 transitions. Word has length 47 [2025-03-16 20:25:11,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:11,049 INFO L471 AbstractCegarLoop]: Abstraction has 2792 states and 4304 transitions. [2025-03-16 20:25:11,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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-16 20:25:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 4304 transitions. [2025-03-16 20:25:11,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:25:11,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:11,050 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] [2025-03-16 20:25:11,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:25:11,050 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:11,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:11,050 INFO L85 PathProgramCache]: Analyzing trace with hash 96347508, now seen corresponding path program 1 times [2025-03-16 20:25:11,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:11,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790946599] [2025-03-16 20:25:11,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:11,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:11,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:25:11,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:25:11,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:11,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:25:11,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:11,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790946599] [2025-03-16 20:25:11,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790946599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:11,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:11,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:11,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59085408] [2025-03-16 20:25:11,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:11,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:11,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:11,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:11,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:11,139 INFO L87 Difference]: Start difference. First operand 2792 states and 4304 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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-16 20:25:11,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:11,295 INFO L93 Difference]: Finished difference Result 8098 states and 11917 transitions. [2025-03-16 20:25:11,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:11,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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 61 [2025-03-16 20:25:11,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:11,314 INFO L225 Difference]: With dead ends: 8098 [2025-03-16 20:25:11,314 INFO L226 Difference]: Without dead ends: 6840 [2025-03-16 20:25:11,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:25:11,319 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 4693 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4693 SdHoareTripleChecker+Valid, 3288 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:11,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4693 Valid, 3288 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:11,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6840 states. [2025-03-16 20:25:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6840 to 4048. [2025-03-16 20:25:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4048 states, 4046 states have (on average 1.504695996045477) internal successors, (6088), 4047 states have internal predecessors, (6088), 0 states have call successors, (0), 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-16 20:25:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4048 states to 4048 states and 6088 transitions. [2025-03-16 20:25:11,412 INFO L78 Accepts]: Start accepts. Automaton has 4048 states and 6088 transitions. Word has length 61 [2025-03-16 20:25:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:11,413 INFO L471 AbstractCegarLoop]: Abstraction has 4048 states and 6088 transitions. [2025-03-16 20:25:11,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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-16 20:25:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 4048 states and 6088 transitions. [2025-03-16 20:25:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:25:11,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:11,414 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] [2025-03-16 20:25:11,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:25:11,414 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:11,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:11,414 INFO L85 PathProgramCache]: Analyzing trace with hash -453441420, now seen corresponding path program 1 times [2025-03-16 20:25:11,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:11,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412895914] [2025-03-16 20:25:11,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:11,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:11,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:25:11,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:25:11,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:11,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:11,514 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:25:11,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:11,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412895914] [2025-03-16 20:25:11,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412895914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:11,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:11,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:11,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500825588] [2025-03-16 20:25:11,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:11,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:11,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:11,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:11,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:11,515 INFO L87 Difference]: Start difference. First operand 4048 states and 6088 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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-16 20:25:11,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:11,649 INFO L93 Difference]: Finished difference Result 9354 states and 13701 transitions. [2025-03-16 20:25:11,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:11,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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 61 [2025-03-16 20:25:11,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:11,663 INFO L225 Difference]: With dead ends: 9354 [2025-03-16 20:25:11,664 INFO L226 Difference]: Without dead ends: 8096 [2025-03-16 20:25:11,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:25:11,668 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 4687 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4687 SdHoareTripleChecker+Valid, 3297 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:11,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4687 Valid, 3297 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:11,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8096 states. [2025-03-16 20:25:11,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8096 to 5936. [2025-03-16 20:25:11,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5936 states, 5934 states have (on average 1.4735422986181328) internal successors, (8744), 5935 states have internal predecessors, (8744), 0 states have call successors, (0), 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-16 20:25:11,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5936 states to 5936 states and 8744 transitions. [2025-03-16 20:25:11,790 INFO L78 Accepts]: Start accepts. Automaton has 5936 states and 8744 transitions. Word has length 61 [2025-03-16 20:25:11,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:11,790 INFO L471 AbstractCegarLoop]: Abstraction has 5936 states and 8744 transitions. [2025-03-16 20:25:11,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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-16 20:25:11,790 INFO L276 IsEmpty]: Start isEmpty. Operand 5936 states and 8744 transitions. [2025-03-16 20:25:11,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:25:11,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:11,791 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] [2025-03-16 20:25:11,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:25:11,792 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:11,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:11,792 INFO L85 PathProgramCache]: Analyzing trace with hash 162529908, now seen corresponding path program 1 times [2025-03-16 20:25:11,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:11,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88838986] [2025-03-16 20:25:11,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:11,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:11,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:25:11,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:25:11,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:11,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:11,876 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:25:11,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:11,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88838986] [2025-03-16 20:25:11,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88838986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:11,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:11,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:11,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589646665] [2025-03-16 20:25:11,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:11,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:11,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:11,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:11,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:11,877 INFO L87 Difference]: Start difference. First operand 5936 states and 8744 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-16 20:25:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:12,057 INFO L93 Difference]: Finished difference Result 10610 states and 15485 transitions. [2025-03-16 20:25:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:12,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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 61 [2025-03-16 20:25:12,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:12,072 INFO L225 Difference]: With dead ends: 10610 [2025-03-16 20:25:12,073 INFO L226 Difference]: Without dead ends: 9352 [2025-03-16 20:25:12,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:25:12,075 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4655 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4655 SdHoareTripleChecker+Valid, 3338 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:12,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4655 Valid, 3338 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9352 states. [2025-03-16 20:25:12,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9352 to 7192. [2025-03-16 20:25:12,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7192 states, 7190 states have (on average 1.4642559109874826) internal successors, (10528), 7191 states have internal predecessors, (10528), 0 states have call successors, (0), 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-16 20:25:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7192 states to 7192 states and 10528 transitions. [2025-03-16 20:25:12,200 INFO L78 Accepts]: Start accepts. Automaton has 7192 states and 10528 transitions. Word has length 61 [2025-03-16 20:25:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:12,201 INFO L471 AbstractCegarLoop]: Abstraction has 7192 states and 10528 transitions. [2025-03-16 20:25:12,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-16 20:25:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 7192 states and 10528 transitions. [2025-03-16 20:25:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 20:25:12,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:12,202 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] [2025-03-16 20:25:12,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:25:12,203 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:12,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:12,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1862143114, now seen corresponding path program 1 times [2025-03-16 20:25:12,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:12,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971005344] [2025-03-16 20:25:12,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:12,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:12,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 20:25:12,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 20:25:12,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:12,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:12,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:12,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971005344] [2025-03-16 20:25:12,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971005344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:12,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:12,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:12,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568020697] [2025-03-16 20:25:12,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:12,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:12,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:12,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:12,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:12,266 INFO L87 Difference]: Start difference. First operand 7192 states and 10528 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:12,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:12,323 INFO L93 Difference]: Finished difference Result 11245 states and 16380 transitions. [2025-03-16 20:25:12,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:12,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 20:25:12,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:12,332 INFO L225 Difference]: With dead ends: 11245 [2025-03-16 20:25:12,333 INFO L226 Difference]: Without dead ends: 5587 [2025-03-16 20:25:12,338 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-16 20:25:12,339 INFO L435 NwaCegarLoop]: 1557 mSDtfsCounter, 42 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3067 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-16 20:25:12,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3067 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:12,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5587 states. [2025-03-16 20:25:12,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5587 to 5585. [2025-03-16 20:25:12,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5585 states, 5583 states have (on average 1.4818198101379187) internal successors, (8273), 5584 states have internal predecessors, (8273), 0 states have call successors, (0), 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-16 20:25:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5585 states to 5585 states and 8273 transitions. [2025-03-16 20:25:12,429 INFO L78 Accepts]: Start accepts. Automaton has 5585 states and 8273 transitions. Word has length 63 [2025-03-16 20:25:12,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:12,429 INFO L471 AbstractCegarLoop]: Abstraction has 5585 states and 8273 transitions. [2025-03-16 20:25:12,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:12,429 INFO L276 IsEmpty]: Start isEmpty. Operand 5585 states and 8273 transitions. [2025-03-16 20:25:12,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 20:25:12,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:12,430 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] [2025-03-16 20:25:12,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:25:12,430 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:12,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:12,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1705173780, now seen corresponding path program 1 times [2025-03-16 20:25:12,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:12,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203451172] [2025-03-16 20:25:12,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:12,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:12,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 20:25:12,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 20:25:12,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:12,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:12,518 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:25:12,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:12,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203451172] [2025-03-16 20:25:12,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203451172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:12,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:12,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:12,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67211654] [2025-03-16 20:25:12,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:12,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:12,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:12,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:12,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:12,519 INFO L87 Difference]: Start difference. First operand 5585 states and 8273 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:12,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:12,682 INFO L93 Difference]: Finished difference Result 9179 states and 13462 transitions. [2025-03-16 20:25:12,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:12,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 20:25:12,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:12,695 INFO L225 Difference]: With dead ends: 9179 [2025-03-16 20:25:12,695 INFO L226 Difference]: Without dead ends: 8281 [2025-03-16 20:25:12,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:25:12,698 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 4655 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4655 SdHoareTripleChecker+Valid, 3322 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:12,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4655 Valid, 3322 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:12,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8281 states. [2025-03-16 20:25:12,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8281 to 6481. [2025-03-16 20:25:12,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6481 states, 6479 states have (on average 1.474455934557802) internal successors, (9553), 6480 states have internal predecessors, (9553), 0 states have call successors, (0), 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-16 20:25:12,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6481 states to 6481 states and 9553 transitions. [2025-03-16 20:25:12,851 INFO L78 Accepts]: Start accepts. Automaton has 6481 states and 9553 transitions. Word has length 63 [2025-03-16 20:25:12,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:12,851 INFO L471 AbstractCegarLoop]: Abstraction has 6481 states and 9553 transitions. [2025-03-16 20:25:12,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 6481 states and 9553 transitions. [2025-03-16 20:25:12,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:25:12,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:12,853 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] [2025-03-16 20:25:12,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:25:12,853 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:12,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:12,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1410201656, now seen corresponding path program 1 times [2025-03-16 20:25:12,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:12,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176961725] [2025-03-16 20:25:12,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:12,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:12,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:25:12,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:25:12,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:12,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:12,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:12,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176961725] [2025-03-16 20:25:12,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176961725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:12,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:12,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:12,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906786587] [2025-03-16 20:25:12,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:12,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:12,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:12,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:12,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:12,943 INFO L87 Difference]: Start difference. First operand 6481 states and 9553 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:13,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:13,004 INFO L93 Difference]: Finished difference Result 8949 states and 13075 transitions. [2025-03-16 20:25:13,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:13,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 20:25:13,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:13,015 INFO L225 Difference]: With dead ends: 8949 [2025-03-16 20:25:13,015 INFO L226 Difference]: Without dead ends: 4019 [2025-03-16 20:25:13,020 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-16 20:25:13,021 INFO L435 NwaCegarLoop]: 1550 mSDtfsCounter, 37 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3052 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-16 20:25:13,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3052 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:13,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4019 states. [2025-03-16 20:25:13,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4019 to 4017. [2025-03-16 20:25:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4017 states, 4015 states have (on average 1.491656288916563) internal successors, (5989), 4016 states have internal predecessors, (5989), 0 states have call successors, (0), 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-16 20:25:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 5989 transitions. [2025-03-16 20:25:13,076 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 5989 transitions. Word has length 64 [2025-03-16 20:25:13,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:13,076 INFO L471 AbstractCegarLoop]: Abstraction has 4017 states and 5989 transitions. [2025-03-16 20:25:13,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:13,076 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 5989 transitions. [2025-03-16 20:25:13,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:25:13,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:13,077 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] [2025-03-16 20:25:13,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:25:13,077 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:13,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:13,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2134590337, now seen corresponding path program 1 times [2025-03-16 20:25:13,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:13,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364623839] [2025-03-16 20:25:13,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:13,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:13,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:25:13,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:25:13,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:13,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:13,139 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:13,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:13,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364623839] [2025-03-16 20:25:13,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364623839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:13,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:13,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:13,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280798045] [2025-03-16 20:25:13,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:13,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:13,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:13,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:13,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:13,140 INFO L87 Difference]: Start difference. First operand 4017 states and 5989 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:13,168 INFO L93 Difference]: Finished difference Result 5253 states and 7729 transitions. [2025-03-16 20:25:13,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:13,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 20:25:13,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:13,173 INFO L225 Difference]: With dead ends: 5253 [2025-03-16 20:25:13,173 INFO L226 Difference]: Without dead ends: 2787 [2025-03-16 20:25:13,176 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-16 20:25:13,176 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 34 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3037 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-16 20:25:13,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3037 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2787 states. [2025-03-16 20:25:13,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2787 to 2785. [2025-03-16 20:25:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2785 states, 2783 states have (on average 1.5195831836148042) internal successors, (4229), 2784 states have internal predecessors, (4229), 0 states have call successors, (0), 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-16 20:25:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 4229 transitions. [2025-03-16 20:25:13,209 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 4229 transitions. Word has length 66 [2025-03-16 20:25:13,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:13,209 INFO L471 AbstractCegarLoop]: Abstraction has 2785 states and 4229 transitions. [2025-03-16 20:25:13,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 4229 transitions. [2025-03-16 20:25:13,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 20:25:13,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:13,210 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] [2025-03-16 20:25:13,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:25:13,211 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:13,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:13,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1210827322, now seen corresponding path program 1 times [2025-03-16 20:25:13,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:13,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256174241] [2025-03-16 20:25:13,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:13,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:13,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 20:25:13,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 20:25:13,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:13,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:13,276 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:13,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:13,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256174241] [2025-03-16 20:25:13,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256174241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:13,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:13,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:13,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334001492] [2025-03-16 20:25:13,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:13,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:13,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:13,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:13,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:13,279 INFO L87 Difference]: Start difference. First operand 2785 states and 4229 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-16 20:25:13,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:13,300 INFO L93 Difference]: Finished difference Result 3405 states and 5089 transitions. [2025-03-16 20:25:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:13,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 20:25:13,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:13,304 INFO L225 Difference]: With dead ends: 3405 [2025-03-16 20:25:13,304 INFO L226 Difference]: Without dead ends: 2171 [2025-03-16 20:25:13,306 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-16 20:25:13,306 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 31 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3022 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-16 20:25:13,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3022 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:13,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2025-03-16 20:25:13,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 2169. [2025-03-16 20:25:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2167 states have (on average 1.5505306875865252) internal successors, (3360), 2168 states have internal predecessors, (3360), 0 states have call successors, (0), 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-16 20:25:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3360 transitions. [2025-03-16 20:25:13,331 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3360 transitions. Word has length 68 [2025-03-16 20:25:13,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:13,331 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 3360 transitions. [2025-03-16 20:25:13,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-16 20:25:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3360 transitions. [2025-03-16 20:25:13,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 20:25:13,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:13,332 INFO L218 NwaCegarLoop]: trace histogram [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-16 20:25:13,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:25:13,333 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:13,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:13,334 INFO L85 PathProgramCache]: Analyzing trace with hash 301011955, now seen corresponding path program 1 times [2025-03-16 20:25:13,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:13,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464502598] [2025-03-16 20:25:13,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:13,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:13,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:25:13,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:25:13,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:13,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:14,417 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:14,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:14,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464502598] [2025-03-16 20:25:14,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464502598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:25:14,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574076474] [2025-03-16 20:25:14,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:14,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:14,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:14,420 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-16 20:25:14,422 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-16 20:25:14,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:25:14,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:25:14,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:14,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:14,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:25:14,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:25:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:14,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:25:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:15,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574076474] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:25:15,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:25:15,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-03-16 20:25:15,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548545534] [2025-03-16 20:25:15,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:25:15,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 20:25:15,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:15,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 20:25:15,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2025-03-16 20:25:15,560 INFO L87 Difference]: Start difference. First operand 2169 states and 3360 transitions. Second operand has 28 states, 28 states have (on average 6.535714285714286) internal successors, (183), 27 states have internal predecessors, (183), 0 states have call successors, (0), 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-16 20:25:17,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:17,963 INFO L93 Difference]: Finished difference Result 5263 states and 7613 transitions. [2025-03-16 20:25:17,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-16 20:25:17,964 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.535714285714286) internal successors, (183), 27 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-16 20:25:17,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:17,970 INFO L225 Difference]: With dead ends: 5263 [2025-03-16 20:25:17,970 INFO L226 Difference]: Without dead ends: 4645 [2025-03-16 20:25:17,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1219 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=999, Invalid=4257, Unknown=0, NotChecked=0, Total=5256 [2025-03-16 20:25:17,973 INFO L435 NwaCegarLoop]: 1497 mSDtfsCounter, 23126 mSDsluCounter, 5107 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23126 SdHoareTripleChecker+Valid, 6604 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:17,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23126 Valid, 6604 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:25:17,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4645 states. [2025-03-16 20:25:18,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4645 to 4545. [2025-03-16 20:25:18,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4545 states, 4543 states have (on average 1.4369359454105217) internal successors, (6528), 4544 states have internal predecessors, (6528), 0 states have call successors, (0), 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-16 20:25:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4545 states to 4545 states and 6528 transitions. [2025-03-16 20:25:18,037 INFO L78 Accepts]: Start accepts. Automaton has 4545 states and 6528 transitions. Word has length 70 [2025-03-16 20:25:18,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:18,038 INFO L471 AbstractCegarLoop]: Abstraction has 4545 states and 6528 transitions. [2025-03-16 20:25:18,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.535714285714286) internal successors, (183), 27 states have internal predecessors, (183), 0 states have call successors, (0), 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-16 20:25:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4545 states and 6528 transitions. [2025-03-16 20:25:18,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:25:18,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:18,039 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:25:18,046 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-16 20:25:18,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:18,245 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:18,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:18,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1576910278, now seen corresponding path program 1 times [2025-03-16 20:25:18,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:18,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460639948] [2025-03-16 20:25:18,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:18,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:18,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:25:18,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:25:18,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:18,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:18,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:18,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460639948] [2025-03-16 20:25:18,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460639948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:25:18,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858786524] [2025-03-16 20:25:18,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:18,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:18,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:18,528 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-16 20:25:18,530 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-16 20:25:18,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:25:18,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:25:18,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:18,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:18,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 20:25:18,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:25:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:19,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:25:21,874 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:21,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858786524] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:25:21,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:25:21,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 18] total 41 [2025-03-16 20:25:21,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860238201] [2025-03-16 20:25:21,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:25:21,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-16 20:25:21,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:21,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-16 20:25:21,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1448, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 20:25:21,876 INFO L87 Difference]: Start difference. First operand 4545 states and 6528 transitions. Second operand has 41 states, 41 states have (on average 4.682926829268292) internal successors, (192), 41 states have internal predecessors, (192), 0 states have call successors, (0), 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-16 20:25:59,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:59,220 INFO L93 Difference]: Finished difference Result 25873 states and 35055 transitions. [2025-03-16 20:25:59,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2025-03-16 20:25:59,220 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.682926829268292) internal successors, (192), 41 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 20:25:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:59,252 INFO L225 Difference]: With dead ends: 25873 [2025-03-16 20:25:59,252 INFO L226 Difference]: Without dead ends: 22879 [2025-03-16 20:25:59,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29850 ImplicationChecksByTransitivity, 35.8s TimeCoverageRelationStatistics Valid=10208, Invalid=59752, Unknown=0, NotChecked=0, Total=69960 [2025-03-16 20:25:59,268 INFO L435 NwaCegarLoop]: 1553 mSDtfsCounter, 24116 mSDsluCounter, 19802 mSDsCounter, 0 mSdLazyCounter, 3088 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24116 SdHoareTripleChecker+Valid, 21355 SdHoareTripleChecker+Invalid, 3205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 3088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:59,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24116 Valid, 21355 Invalid, 3205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 3088 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 20:25:59,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22879 states. [2025-03-16 20:25:59,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22879 to 7685. [2025-03-16 20:25:59,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7685 states, 7683 states have (on average 1.3874788494077834) internal successors, (10660), 7684 states have internal predecessors, (10660), 0 states have call successors, (0), 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-16 20:25:59,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7685 states to 7685 states and 10660 transitions. [2025-03-16 20:25:59,531 INFO L78 Accepts]: Start accepts. Automaton has 7685 states and 10660 transitions. Word has length 71 [2025-03-16 20:25:59,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:59,531 INFO L471 AbstractCegarLoop]: Abstraction has 7685 states and 10660 transitions. [2025-03-16 20:25:59,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.682926829268292) internal successors, (192), 41 states have internal predecessors, (192), 0 states have call successors, (0), 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-16 20:25:59,531 INFO L276 IsEmpty]: Start isEmpty. Operand 7685 states and 10660 transitions. [2025-03-16 20:25:59,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:25:59,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:59,532 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:25:59,540 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-16 20:25:59,737 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,SelfDestructingSolverStorable20 [2025-03-16 20:25:59,737 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:59,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:59,737 INFO L85 PathProgramCache]: Analyzing trace with hash -416617920, now seen corresponding path program 1 times [2025-03-16 20:25:59,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:59,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885536558] [2025-03-16 20:25:59,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:59,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:59,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:25:59,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:25:59,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:59,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:01,227 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:01,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:26:01,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885536558] [2025-03-16 20:26:01,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885536558] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:26:01,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008704740] [2025-03-16 20:26:01,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:26:01,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:26:01,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:26:01,230 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-16 20:26:01,231 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-16 20:26:01,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:26:01,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:26:01,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:26:01,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:26:01,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 20:26:01,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:26:02,005 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:02,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:26:03,041 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:03,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008704740] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:26:03,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:26:03,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 14, 16] total 51 [2025-03-16 20:26:03,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035043858] [2025-03-16 20:26:03,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:26:03,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-16 20:26:03,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:03,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-16 20:26:03,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2366, Unknown=0, NotChecked=0, Total=2550 [2025-03-16 20:26:03,042 INFO L87 Difference]: Start difference. First operand 7685 states and 10660 transitions. Second operand has 51 states, 51 states have (on average 4.03921568627451) internal successors, (206), 51 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)