./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label04.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 6bd5a1b43baf28037f1364b515dd3aa33d97d8b4eac9039e625792f2e3fbcc41 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:05:17,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:05:17,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:05:17,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:05:17,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:05:17,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:05:17,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:05:17,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:05:17,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:05:17,929 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:05:17,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:05:17,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:05:17,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:05:17,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:05:17,930 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:05:17,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:05:17,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:05:17,930 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:05:17,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:05:17,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:05:17,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:05:17,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:05:17,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:05:17,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:05:17,931 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:05:17,931 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:05:17,931 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:05:17,931 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:05:17,931 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:05:17,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:05:17,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:05:17,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:05:17,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:05:17,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:05:17,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:05:17,932 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:05:17,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:05:17,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:05:17,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:05:17,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:05:17,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:05:17,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:05:17,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:05:17,933 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 -> 6bd5a1b43baf28037f1364b515dd3aa33d97d8b4eac9039e625792f2e3fbcc41 [2025-03-03 16:05:18,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:05:18,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:05:18,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:05:18,153 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:05:18,153 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:05:18,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label04.c [2025-03-03 16:05:19,242 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14c4b21ab/594d39cc35cc49bebe27669a4d6d1365/FLAG5a245203e [2025-03-03 16:05:19,709 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:05:19,710 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label04.c [2025-03-03 16:05:19,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14c4b21ab/594d39cc35cc49bebe27669a4d6d1365/FLAG5a245203e [2025-03-03 16:05:19,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14c4b21ab/594d39cc35cc49bebe27669a4d6d1365 [2025-03-03 16:05:19,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:05:19,758 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:05:19,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:05:19,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:05:19,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:05:19,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:05:19" (1/1) ... [2025-03-03 16:05:19,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f88245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:19, skipping insertion in model container [2025-03-03 16:05:19,764 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:05:19" (1/1) ... [2025-03-03 16:05:19,839 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:05:20,054 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.BOUNDED-8.pals+Problem12_label04.c[8616,8629] [2025-03-03 16:05:20,104 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.BOUNDED-8.pals+Problem12_label04.c[15677,15690] [2025-03-03 16:05:20,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:05:20,491 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:05:20,509 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.BOUNDED-8.pals+Problem12_label04.c[8616,8629] [2025-03-03 16:05:20,517 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.BOUNDED-8.pals+Problem12_label04.c[15677,15690] [2025-03-03 16:05:20,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:05:20,791 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:05:20,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20 WrapperNode [2025-03-03 16:05:20,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:05:20,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:05:20,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:05:20,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:05:20,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:20,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,057 INFO L138 Inliner]: procedures = 34, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 5033 [2025-03-03 16:05:21,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:05:21,058 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:05:21,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:05:21,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:05:21,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,103 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,249 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:05:21,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,359 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:05:21,422 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:05:21,423 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:05:21,423 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:05:21,424 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:05:21,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:05:21,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:05:21,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:05:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:05:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:05:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:05:21,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:05:21,534 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:05:21,535 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:05:24,843 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5020: havoc calculate_output3_#t~ret36#1; [2025-03-03 16:05:24,844 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2051: havoc calculate_output_#t~ret34#1; [2025-03-03 16:05:24,844 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3530: havoc calculate_output2_#t~ret35#1; [2025-03-03 16:05:25,013 INFO L? ?]: Removed 737 outVars from TransFormulas that were not future-live. [2025-03-03 16:05:25,013 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:05:25,037 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:05:25,037 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:05:25,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:05:25 BoogieIcfgContainer [2025-03-03 16:05:25,038 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:05:25,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:05:25,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:05:25,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:05:25,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:05:19" (1/3) ... [2025-03-03 16:05:25,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d9b246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:05:25, skipping insertion in model container [2025-03-03 16:05:25,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (2/3) ... [2025-03-03 16:05:25,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d9b246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:05:25, skipping insertion in model container [2025-03-03 16:05:25,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:05:25" (3/3) ... [2025-03-03 16:05:25,046 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label04.c [2025-03-03 16:05:25,057 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:05:25,060 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label04.c that has 1 procedures, 884 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:05:25,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:05:25,141 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;@24848dff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:05:25,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:05:25,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 884 states, 881 states have (on average 1.9046538024971622) internal successors, (1678), 883 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:25,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 16:05:25,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:25,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:25,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:25,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:25,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1657989458, now seen corresponding path program 1 times [2025-03-03 16:05:25,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:25,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998539162] [2025-03-03 16:05:25,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:25,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:25,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 16:05:25,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 16:05:25,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:25,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:25,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:25,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998539162] [2025-03-03 16:05:25,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998539162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:25,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:25,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:05:25,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246088426] [2025-03-03 16:05:25,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:25,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 16:05:25,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:25,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 16:05:25,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:05:25,358 INFO L87 Difference]: Start difference. First operand has 884 states, 881 states have (on average 1.9046538024971622) internal successors, (1678), 883 states have internal predecessors, (1678), 0 states have call successors, (0), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:25,410 INFO L93 Difference]: Finished difference Result 1739 states and 3302 transitions. [2025-03-03 16:05:25,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 16:05:25,411 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-03-03 16:05:25,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:25,426 INFO L225 Difference]: With dead ends: 1739 [2025-03-03 16:05:25,426 INFO L226 Difference]: Without dead ends: 819 [2025-03-03 16:05:25,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:05:25,432 INFO L435 NwaCegarLoop]: 1614 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, 1614 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:25,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:25,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-03-03 16:05:25,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2025-03-03 16:05:25,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 817 states have (on average 1.894736842105263) internal successors, (1548), 818 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-03 16:05:25,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1548 transitions. [2025-03-03 16:05:25,504 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1548 transitions. Word has length 22 [2025-03-03 16:05:25,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:25,504 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1548 transitions. [2025-03-03 16:05:25,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:25,505 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1548 transitions. [2025-03-03 16:05:25,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 16:05:25,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:25,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:25,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:05:25,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:25,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:25,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1147455281, now seen corresponding path program 1 times [2025-03-03 16:05:25,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:25,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948772603] [2025-03-03 16:05:25,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:25,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:25,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 16:05:25,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 16:05:25,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:25,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:25,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:25,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:25,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948772603] [2025-03-03 16:05:25,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948772603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:25,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:25,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:05:25,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698316531] [2025-03-03 16:05:25,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:25,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:05:25,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:25,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:05:25,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:05:25,684 INFO L87 Difference]: Start difference. First operand 819 states and 1548 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:25,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:25,783 INFO L93 Difference]: Finished difference Result 895 states and 1666 transitions. [2025-03-03 16:05:25,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:05:25,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-03-03 16:05:25,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:25,787 INFO L225 Difference]: With dead ends: 895 [2025-03-03 16:05:25,787 INFO L226 Difference]: Without dead ends: 855 [2025-03-03 16:05:25,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:05:25,788 INFO L435 NwaCegarLoop]: 1544 mSDtfsCounter, 56 mSDsluCounter, 4603 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 6147 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:25,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 6147 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:05:25,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-03-03 16:05:25,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 819. [2025-03-03 16:05:25,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 817 states have (on average 1.8665850673194615) internal successors, (1525), 818 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-03 16:05:25,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1525 transitions. [2025-03-03 16:05:25,811 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1525 transitions. Word has length 22 [2025-03-03 16:05:25,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:25,811 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1525 transitions. [2025-03-03 16:05:25,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:25,811 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1525 transitions. [2025-03-03 16:05:25,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 16:05:25,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:25,812 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-03 16:05:25,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:05:25,812 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:25,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:25,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1619243067, now seen corresponding path program 1 times [2025-03-03 16:05:25,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:25,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592197925] [2025-03-03 16:05:25,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:25,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:25,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 16:05:25,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 16:05:25,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:25,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:25,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:25,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:25,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592197925] [2025-03-03 16:05:25,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592197925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:25,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:25,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:05:25,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847546905] [2025-03-03 16:05:25,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:25,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:05:25,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:25,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:05:25,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:05:25,975 INFO L87 Difference]: Start difference. First operand 819 states and 1525 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 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-03 16:05:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:26,136 INFO L93 Difference]: Finished difference Result 1107 states and 1981 transitions. [2025-03-03 16:05:26,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:05:26,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 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-03 16:05:26,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:26,140 INFO L225 Difference]: With dead ends: 1107 [2025-03-03 16:05:26,140 INFO L226 Difference]: Without dead ends: 1071 [2025-03-03 16:05:26,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:05:26,141 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 6217 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6217 SdHoareTripleChecker+Valid, 2309 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:26,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6217 Valid, 2309 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:05:26,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-03-03 16:05:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 853. [2025-03-03 16:05:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 851 states have (on average 1.8554641598119859) internal successors, (1579), 852 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:26,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1579 transitions. [2025-03-03 16:05:26,161 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1579 transitions. Word has length 44 [2025-03-03 16:05:26,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:26,161 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1579 transitions. [2025-03-03 16:05:26,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 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-03 16:05:26,162 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1579 transitions. [2025-03-03 16:05:26,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 16:05:26,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:26,163 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] [2025-03-03 16:05:26,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:05:26,163 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:26,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:26,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1860187818, now seen corresponding path program 1 times [2025-03-03 16:05:26,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:26,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483910948] [2025-03-03 16:05:26,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:26,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:26,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 16:05:26,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 16:05:26,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:26,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:26,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:26,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483910948] [2025-03-03 16:05:26,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483910948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:26,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:26,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:05:26,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828849278] [2025-03-03 16:05:26,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:26,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:05:26,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:26,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:05:26,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:26,230 INFO L87 Difference]: Start difference. First operand 853 states and 1579 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:26,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:26,256 INFO L93 Difference]: Finished difference Result 982 states and 1782 transitions. [2025-03-03 16:05:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:05:26,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-03-03 16:05:26,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:26,260 INFO L225 Difference]: With dead ends: 982 [2025-03-03 16:05:26,260 INFO L226 Difference]: Without dead ends: 912 [2025-03-03 16:05:26,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:26,261 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:26,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1575 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:26,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-03-03 16:05:26,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 910. [2025-03-03 16:05:26,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 908 states have (on average 1.8359030837004404) internal successors, (1667), 909 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:26,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1667 transitions. [2025-03-03 16:05:26,276 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1667 transitions. Word has length 46 [2025-03-03 16:05:26,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:26,276 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1667 transitions. [2025-03-03 16:05:26,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:26,277 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1667 transitions. [2025-03-03 16:05:26,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 16:05:26,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:26,278 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] [2025-03-03 16:05:26,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:05:26,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:26,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:26,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1827864583, now seen corresponding path program 1 times [2025-03-03 16:05:26,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:26,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912275776] [2025-03-03 16:05:26,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:26,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:26,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 16:05:26,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 16:05:26,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:26,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:26,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:26,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:26,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912275776] [2025-03-03 16:05:26,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912275776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:26,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:26,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:05:26,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363033059] [2025-03-03 16:05:26,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:26,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:05:26,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:26,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:05:26,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:05:26,534 INFO L87 Difference]: Start difference. First operand 910 states and 1667 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:26,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:26,633 INFO L93 Difference]: Finished difference Result 1039 states and 1867 transitions. [2025-03-03 16:05:26,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:05:26,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-03-03 16:05:26,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:26,637 INFO L225 Difference]: With dead ends: 1039 [2025-03-03 16:05:26,637 INFO L226 Difference]: Without dead ends: 912 [2025-03-03 16:05:26,638 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-03 16:05:26,640 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 4446 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4446 SdHoareTripleChecker+Valid, 1678 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-03 16:05:26,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4446 Valid, 1678 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:26,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-03-03 16:05:26,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 910. [2025-03-03 16:05:26,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 908 states have (on average 1.8337004405286343) internal successors, (1665), 909 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:26,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1665 transitions. [2025-03-03 16:05:26,658 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1665 transitions. Word has length 46 [2025-03-03 16:05:26,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:26,658 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1665 transitions. [2025-03-03 16:05:26,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:26,659 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1665 transitions. [2025-03-03 16:05:26,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 16:05:26,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:26,659 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-03 16:05:26,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:05:26,660 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:26,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:26,660 INFO L85 PathProgramCache]: Analyzing trace with hash -798689491, now seen corresponding path program 1 times [2025-03-03 16:05:26,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:26,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483083623] [2025-03-03 16:05:26,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:26,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:26,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 16:05:26,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 16:05:26,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:26,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:26,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:26,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:26,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483083623] [2025-03-03 16:05:26,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483083623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:26,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:26,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:05:26,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390011384] [2025-03-03 16:05:26,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:26,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:05:26,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:26,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:05:26,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:05:26,800 INFO L87 Difference]: Start difference. First operand 910 states and 1665 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-03 16:05:26,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:26,831 INFO L93 Difference]: Finished difference Result 918 states and 1674 transitions. [2025-03-03 16:05:26,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:05:26,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-03 16:05:26,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:26,834 INFO L225 Difference]: With dead ends: 918 [2025-03-03 16:05:26,834 INFO L226 Difference]: Without dead ends: 916 [2025-03-03 16:05:26,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:05:26,835 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 0 mSDsluCounter, 4557 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6079 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:26,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6079 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:26,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2025-03-03 16:05:26,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 916. [2025-03-03 16:05:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 914 states have (on average 1.8271334792122538) internal successors, (1670), 915 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1670 transitions. [2025-03-03 16:05:26,851 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1670 transitions. Word has length 47 [2025-03-03 16:05:26,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:26,851 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1670 transitions. [2025-03-03 16:05:26,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-03 16:05:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1670 transitions. [2025-03-03 16:05:26,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 16:05:26,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:26,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:26,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:05:26,853 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:26,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:26,853 INFO L85 PathProgramCache]: Analyzing trace with hash -583055145, now seen corresponding path program 1 times [2025-03-03 16:05:26,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:26,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373048355] [2025-03-03 16:05:26,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:26,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:26,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 16:05:26,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 16:05:26,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:26,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:26,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:26,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:26,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373048355] [2025-03-03 16:05:26,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373048355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:26,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:26,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:05:26,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669328222] [2025-03-03 16:05:26,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:26,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:05:26,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:26,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:05:26,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:26,891 INFO L87 Difference]: Start difference. First operand 916 states and 1670 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:26,920 INFO L93 Difference]: Finished difference Result 1062 states and 1891 transitions. [2025-03-03 16:05:26,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:05:26,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-03 16:05:26,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:26,924 INFO L225 Difference]: With dead ends: 1062 [2025-03-03 16:05:26,924 INFO L226 Difference]: Without dead ends: 986 [2025-03-03 16:05:26,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:26,925 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 1486 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 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-03 16:05:26,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1625 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:26,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2025-03-03 16:05:26,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2025-03-03 16:05:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 982 states have (on average 1.8034623217922607) internal successors, (1771), 983 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1771 transitions. [2025-03-03 16:05:26,944 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1771 transitions. Word has length 48 [2025-03-03 16:05:26,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:26,944 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1771 transitions. [2025-03-03 16:05:26,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1771 transitions. [2025-03-03 16:05:26,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 16:05:26,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:26,945 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:26,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:05:26,945 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:26,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:26,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1031000681, now seen corresponding path program 1 times [2025-03-03 16:05:26,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:26,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911328459] [2025-03-03 16:05:26,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:26,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:26,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 16:05:26,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 16:05:26,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:26,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:26,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:26,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911328459] [2025-03-03 16:05:26,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911328459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:26,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:26,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:05:26,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172764983] [2025-03-03 16:05:26,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:26,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:05:26,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:26,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:05:26,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:26,987 INFO L87 Difference]: Start difference. First operand 984 states and 1771 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:27,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:27,007 INFO L93 Difference]: Finished difference Result 1358 states and 2331 transitions. [2025-03-03 16:05:27,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:05:27,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-03 16:05:27,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:27,011 INFO L225 Difference]: With dead ends: 1358 [2025-03-03 16:05:27,011 INFO L226 Difference]: Without dead ends: 1159 [2025-03-03 16:05:27,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:27,012 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 1484 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:27,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1631 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:27,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-03-03 16:05:27,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1157. [2025-03-03 16:05:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1155 states have (on average 1.7515151515151515) internal successors, (2023), 1156 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:27,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 2023 transitions. [2025-03-03 16:05:27,033 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 2023 transitions. Word has length 48 [2025-03-03 16:05:27,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:27,033 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 2023 transitions. [2025-03-03 16:05:27,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:27,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 2023 transitions. [2025-03-03 16:05:27,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 16:05:27,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:27,034 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:27,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:05:27,034 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:27,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:27,035 INFO L85 PathProgramCache]: Analyzing trace with hash -615824809, now seen corresponding path program 1 times [2025-03-03 16:05:27,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:27,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391807754] [2025-03-03 16:05:27,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:27,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:27,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 16:05:27,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 16:05:27,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:27,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:27,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:27,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:27,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391807754] [2025-03-03 16:05:27,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391807754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:27,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:27,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:05:27,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329356742] [2025-03-03 16:05:27,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:27,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:05:27,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:27,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:05:27,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:27,082 INFO L87 Difference]: Start difference. First operand 1157 states and 2023 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:27,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:27,108 INFO L93 Difference]: Finished difference Result 1853 states and 3045 transitions. [2025-03-03 16:05:27,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:05:27,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-03 16:05:27,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:27,113 INFO L225 Difference]: With dead ends: 1853 [2025-03-03 16:05:27,113 INFO L226 Difference]: Without dead ends: 1481 [2025-03-03 16:05:27,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:27,114 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 1482 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:27,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1633 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:27,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2025-03-03 16:05:27,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1479. [2025-03-03 16:05:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1477 states have (on average 1.6784021665538253) internal successors, (2479), 1478 states have internal predecessors, (2479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 2479 transitions. [2025-03-03 16:05:27,141 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 2479 transitions. Word has length 48 [2025-03-03 16:05:27,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:27,142 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 2479 transitions. [2025-03-03 16:05:27,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2479 transitions. [2025-03-03 16:05:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 16:05:27,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:27,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:27,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:05:27,142 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:27,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:27,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1102543081, now seen corresponding path program 1 times [2025-03-03 16:05:27,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:27,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612634155] [2025-03-03 16:05:27,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:27,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:27,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 16:05:27,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 16:05:27,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:27,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:27,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:27,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:27,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612634155] [2025-03-03 16:05:27,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612634155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:27,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:27,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:05:27,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229272975] [2025-03-03 16:05:27,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:27,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:05:27,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:27,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:05:27,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:27,186 INFO L87 Difference]: Start difference. First operand 1479 states and 2479 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:27,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:27,215 INFO L93 Difference]: Finished difference Result 2771 states and 4329 transitions. [2025-03-03 16:05:27,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:05:27,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-03 16:05:27,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:27,222 INFO L225 Difference]: With dead ends: 2771 [2025-03-03 16:05:27,222 INFO L226 Difference]: Without dead ends: 2077 [2025-03-03 16:05:27,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:27,223 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 1480 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:27,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1635 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:27,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2025-03-03 16:05:27,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 2075. [2025-03-03 16:05:27,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2075 states, 2073 states have (on average 1.5894838398456343) internal successors, (3295), 2074 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:27,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 3295 transitions. [2025-03-03 16:05:27,263 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 3295 transitions. Word has length 48 [2025-03-03 16:05:27,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:27,264 INFO L471 AbstractCegarLoop]: Abstraction has 2075 states and 3295 transitions. [2025-03-03 16:05:27,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:27,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 3295 transitions. [2025-03-03 16:05:27,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 16:05:27,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:27,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:27,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:05:27,265 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:27,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:27,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1040841629, now seen corresponding path program 1 times [2025-03-03 16:05:27,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:27,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538983502] [2025-03-03 16:05:27,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:27,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:27,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 16:05:27,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 16:05:27,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:27,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:27,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:27,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538983502] [2025-03-03 16:05:27,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538983502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:27,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:27,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:05:27,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508690135] [2025-03-03 16:05:27,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:27,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:05:27,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:27,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:05:27,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:27,322 INFO L87 Difference]: Start difference. First operand 2075 states and 3295 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:29,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:29,983 INFO L93 Difference]: Finished difference Result 3579 states and 6168 transitions. [2025-03-03 16:05:29,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:05:29,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-03 16:05:29,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:29,994 INFO L225 Difference]: With dead ends: 3579 [2025-03-03 16:05:29,994 INFO L226 Difference]: Without dead ends: 2826 [2025-03-03 16:05:29,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:29,995 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 826 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:29,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 561 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 16:05:29,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2025-03-03 16:05:30,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2826. [2025-03-03 16:05:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2826 states, 2824 states have (on average 1.5134560906515582) internal successors, (4274), 2825 states have internal predecessors, (4274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 4274 transitions. [2025-03-03 16:05:30,041 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 4274 transitions. Word has length 61 [2025-03-03 16:05:30,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:30,041 INFO L471 AbstractCegarLoop]: Abstraction has 2826 states and 4274 transitions. [2025-03-03 16:05:30,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:30,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 4274 transitions. [2025-03-03 16:05:30,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:05:30,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:30,044 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:30,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:05:30,044 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:30,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:30,045 INFO L85 PathProgramCache]: Analyzing trace with hash -492453955, now seen corresponding path program 1 times [2025-03-03 16:05:30,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:30,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257040087] [2025-03-03 16:05:30,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:30,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:30,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:05:30,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:05:30,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:30,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:30,148 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:05:30,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:30,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257040087] [2025-03-03 16:05:30,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257040087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:30,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:30,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:05:30,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109502953] [2025-03-03 16:05:30,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:30,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:05:30,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:30,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:05:30,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:05:30,150 INFO L87 Difference]: Start difference. First operand 2826 states and 4274 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:30,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:30,269 INFO L93 Difference]: Finished difference Result 7916 states and 11463 transitions. [2025-03-03 16:05:30,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:05:30,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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 65 [2025-03-03 16:05:30,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:30,287 INFO L225 Difference]: With dead ends: 7916 [2025-03-03 16:05:30,287 INFO L226 Difference]: Without dead ends: 6986 [2025-03-03 16:05:30,290 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-03 16:05:30,290 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4645 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4645 SdHoareTripleChecker+Valid, 3389 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:30,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4645 Valid, 3389 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6986 states. [2025-03-03 16:05:30,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6986 to 3938. [2025-03-03 16:05:30,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3938 states, 3936 states have (on average 1.4801829268292683) internal successors, (5826), 3937 states have internal predecessors, (5826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:30,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3938 states to 3938 states and 5826 transitions. [2025-03-03 16:05:30,376 INFO L78 Accepts]: Start accepts. Automaton has 3938 states and 5826 transitions. Word has length 65 [2025-03-03 16:05:30,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:30,376 INFO L471 AbstractCegarLoop]: Abstraction has 3938 states and 5826 transitions. [2025-03-03 16:05:30,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:30,377 INFO L276 IsEmpty]: Start isEmpty. Operand 3938 states and 5826 transitions. [2025-03-03 16:05:30,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:05:30,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:30,380 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:30,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:05:30,380 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:30,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:30,381 INFO L85 PathProgramCache]: Analyzing trace with hash -940399491, now seen corresponding path program 1 times [2025-03-03 16:05:30,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:30,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042416854] [2025-03-03 16:05:30,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:30,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:30,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:05:30,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:05:30,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:30,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:30,487 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:05:30,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:30,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042416854] [2025-03-03 16:05:30,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042416854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:30,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:30,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:05:30,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214219093] [2025-03-03 16:05:30,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:30,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:05:30,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:30,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:05:30,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:05:30,489 INFO L87 Difference]: Start difference. First operand 3938 states and 5826 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-03 16:05:30,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:30,615 INFO L93 Difference]: Finished difference Result 9204 states and 13271 transitions. [2025-03-03 16:05:30,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:05:30,616 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 65 [2025-03-03 16:05:30,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:30,637 INFO L225 Difference]: With dead ends: 9204 [2025-03-03 16:05:30,637 INFO L226 Difference]: Without dead ends: 7914 [2025-03-03 16:05:30,641 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-03 16:05:30,642 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 4647 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4647 SdHoareTripleChecker+Valid, 3366 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:30,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4647 Valid, 3366 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:30,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7914 states. [2025-03-03 16:05:30,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7914 to 5690. [2025-03-03 16:05:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5690 states, 5688 states have (on average 1.4532348804500703) internal successors, (8266), 5689 states have internal predecessors, (8266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:30,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5690 states to 5690 states and 8266 transitions. [2025-03-03 16:05:30,761 INFO L78 Accepts]: Start accepts. Automaton has 5690 states and 8266 transitions. Word has length 65 [2025-03-03 16:05:30,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:30,761 INFO L471 AbstractCegarLoop]: Abstraction has 5690 states and 8266 transitions. [2025-03-03 16:05:30,761 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-03 16:05:30,761 INFO L276 IsEmpty]: Start isEmpty. Operand 5690 states and 8266 transitions. [2025-03-03 16:05:30,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:05:30,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:30,762 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:30,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:05:30,763 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:30,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:30,763 INFO L85 PathProgramCache]: Analyzing trace with hash -525223619, now seen corresponding path program 1 times [2025-03-03 16:05:30,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:30,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655168693] [2025-03-03 16:05:30,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:30,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:30,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:05:30,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:05:30,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:30,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:30,906 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:05:30,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:30,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655168693] [2025-03-03 16:05:30,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655168693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:30,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:30,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:05:30,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318196862] [2025-03-03 16:05:30,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:30,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:05:30,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:30,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:05:30,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:05:30,908 INFO L87 Difference]: Start difference. First operand 5690 states and 8266 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:31,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:31,033 INFO L93 Difference]: Finished difference Result 10492 states and 15071 transitions. [2025-03-03 16:05:31,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:05:31,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 16:05:31,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:31,047 INFO L225 Difference]: With dead ends: 10492 [2025-03-03 16:05:31,047 INFO L226 Difference]: Without dead ends: 9202 [2025-03-03 16:05:31,050 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-03 16:05:31,051 INFO L435 NwaCegarLoop]: 1574 mSDtfsCounter, 4671 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4671 SdHoareTripleChecker+Valid, 3336 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:31,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4671 Valid, 3336 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:31,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9202 states. [2025-03-03 16:05:31,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9202 to 6978. [2025-03-03 16:05:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6978 states, 6976 states have (on average 1.442947247706422) internal successors, (10066), 6977 states have internal predecessors, (10066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:31,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6978 states to 6978 states and 10066 transitions. [2025-03-03 16:05:31,172 INFO L78 Accepts]: Start accepts. Automaton has 6978 states and 10066 transitions. Word has length 65 [2025-03-03 16:05:31,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:31,172 INFO L471 AbstractCegarLoop]: Abstraction has 6978 states and 10066 transitions. [2025-03-03 16:05:31,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:31,173 INFO L276 IsEmpty]: Start isEmpty. Operand 6978 states and 10066 transitions. [2025-03-03 16:05:31,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:05:31,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:31,174 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:31,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:05:31,174 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:31,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:31,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1011941891, now seen corresponding path program 1 times [2025-03-03 16:05:31,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:31,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556344528] [2025-03-03 16:05:31,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:31,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:31,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:05:31,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:05:31,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:31,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 16:05:31,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:31,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556344528] [2025-03-03 16:05:31,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556344528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:31,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:31,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:05:31,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534566722] [2025-03-03 16:05:31,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:31,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:05:31,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:31,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:05:31,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:05:31,258 INFO L87 Difference]: Start difference. First operand 6978 states and 10066 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-03 16:05:31,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:31,399 INFO L93 Difference]: Finished difference Result 11780 states and 16871 transitions. [2025-03-03 16:05:31,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:05:31,399 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 65 [2025-03-03 16:05:31,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:31,415 INFO L225 Difference]: With dead ends: 11780 [2025-03-03 16:05:31,415 INFO L226 Difference]: Without dead ends: 10490 [2025-03-03 16:05:31,419 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-03 16:05:31,419 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 4661 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4661 SdHoareTripleChecker+Valid, 3359 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:31,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4661 Valid, 3359 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:31,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10490 states. [2025-03-03 16:05:31,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10490 to 8266. [2025-03-03 16:05:31,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8266 states, 8264 states have (on average 1.435866408518877) internal successors, (11866), 8265 states have internal predecessors, (11866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8266 states to 8266 states and 11866 transitions. [2025-03-03 16:05:31,551 INFO L78 Accepts]: Start accepts. Automaton has 8266 states and 11866 transitions. Word has length 65 [2025-03-03 16:05:31,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:31,551 INFO L471 AbstractCegarLoop]: Abstraction has 8266 states and 11866 transitions. [2025-03-03 16:05:31,551 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-03 16:05:31,551 INFO L276 IsEmpty]: Start isEmpty. Operand 8266 states and 11866 transitions. [2025-03-03 16:05:31,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:05:31,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:31,552 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:31,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:05:31,552 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:31,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:31,553 INFO L85 PathProgramCache]: Analyzing trace with hash 78192369, now seen corresponding path program 1 times [2025-03-03 16:05:31,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:31,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778595015] [2025-03-03 16:05:31,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:31,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:31,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:05:31,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:05:31,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:31,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:31,667 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:31,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:31,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778595015] [2025-03-03 16:05:31,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778595015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:31,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:31,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:05:31,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460385521] [2025-03-03 16:05:31,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:31,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:05:31,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:31,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:05:31,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:31,672 INFO L87 Difference]: Start difference. First operand 8266 states and 11866 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-03 16:05:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:31,795 INFO L93 Difference]: Finished difference Result 14998 states and 21284 transitions. [2025-03-03 16:05:31,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:05:31,795 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-03 16:05:31,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:31,809 INFO L225 Difference]: With dead ends: 14998 [2025-03-03 16:05:31,809 INFO L226 Difference]: Without dead ends: 8268 [2025-03-03 16:05:31,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:31,818 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 37 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3064 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:31,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3064 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:31,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8268 states. [2025-03-03 16:05:31,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8268 to 8266. [2025-03-03 16:05:31,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8266 states, 8264 states have (on average 1.4208615682478218) internal successors, (11742), 8265 states have internal predecessors, (11742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8266 states to 8266 states and 11742 transitions. [2025-03-03 16:05:31,979 INFO L78 Accepts]: Start accepts. Automaton has 8266 states and 11742 transitions. Word has length 66 [2025-03-03 16:05:31,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:31,979 INFO L471 AbstractCegarLoop]: Abstraction has 8266 states and 11742 transitions. [2025-03-03 16:05:31,979 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-03 16:05:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand 8266 states and 11742 transitions. [2025-03-03 16:05:31,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:05:31,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:31,980 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:31,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:05:31,980 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:31,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:31,981 INFO L85 PathProgramCache]: Analyzing trace with hash -628102213, now seen corresponding path program 1 times [2025-03-03 16:05:31,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:31,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585989238] [2025-03-03 16:05:31,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:31,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:31,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:05:32,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:05:32,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:32,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:32,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:32,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585989238] [2025-03-03 16:05:32,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585989238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:32,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:32,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:05:32,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376822066] [2025-03-03 16:05:32,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:32,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:05:32,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:32,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:05:32,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:32,052 INFO L87 Difference]: Start difference. First operand 8266 states and 11742 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:32,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:32,094 INFO L93 Difference]: Finished difference Result 10839 states and 15326 transitions. [2025-03-03 16:05:32,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:05:32,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 16:05:32,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:32,103 INFO L225 Difference]: With dead ends: 10839 [2025-03-03 16:05:32,103 INFO L226 Difference]: Without dead ends: 4109 [2025-03-03 16:05:32,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:32,109 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 31 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3061 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:32,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3061 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:32,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4109 states. [2025-03-03 16:05:32,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4109 to 4101. [2025-03-03 16:05:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 4099 states have (on average 1.4591363747255428) internal successors, (5981), 4100 states have internal predecessors, (5981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:32,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5981 transitions. [2025-03-03 16:05:32,162 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5981 transitions. Word has length 67 [2025-03-03 16:05:32,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:32,162 INFO L471 AbstractCegarLoop]: Abstraction has 4101 states and 5981 transitions. [2025-03-03 16:05:32,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:32,162 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5981 transitions. [2025-03-03 16:05:32,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:05:32,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:32,163 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:32,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:05:32,164 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:32,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:32,164 INFO L85 PathProgramCache]: Analyzing trace with hash 667894008, now seen corresponding path program 1 times [2025-03-03 16:05:32,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:32,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313154173] [2025-03-03 16:05:32,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:32,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:32,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:05:32,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:05:32,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:32,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:32,239 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:32,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:32,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313154173] [2025-03-03 16:05:32,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313154173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:32,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:32,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:05:32,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826011938] [2025-03-03 16:05:32,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:32,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:05:32,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:32,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:05:32,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:32,241 INFO L87 Difference]: Start difference. First operand 4101 states and 5981 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-03 16:05:32,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:32,267 INFO L93 Difference]: Finished difference Result 5381 states and 7743 transitions. [2025-03-03 16:05:32,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:05:32,267 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-03 16:05:32,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:32,272 INFO L225 Difference]: With dead ends: 5381 [2025-03-03 16:05:32,272 INFO L226 Difference]: Without dead ends: 2827 [2025-03-03 16:05:32,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:32,275 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 33 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3040 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:32,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3040 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:32,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2025-03-03 16:05:32,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2825. [2025-03-03 16:05:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2823 states have (on average 1.4874247254693589) internal successors, (4199), 2824 states have internal predecessors, (4199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 4199 transitions. [2025-03-03 16:05:32,305 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 4199 transitions. Word has length 68 [2025-03-03 16:05:32,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:32,305 INFO L471 AbstractCegarLoop]: Abstraction has 2825 states and 4199 transitions. [2025-03-03 16:05:32,305 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-03 16:05:32,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 4199 transitions. [2025-03-03 16:05:32,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 16:05:32,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:32,306 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:32,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:05:32,306 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:32,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:32,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1675746273, now seen corresponding path program 1 times [2025-03-03 16:05:32,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:32,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651831056] [2025-03-03 16:05:32,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:32,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:32,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 16:05:32,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 16:05:32,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:32,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:32,370 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:32,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:32,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651831056] [2025-03-03 16:05:32,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651831056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:32,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:32,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:05:32,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915515431] [2025-03-03 16:05:32,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:32,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:05:32,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:32,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:05:32,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:32,371 INFO L87 Difference]: Start difference. First operand 2825 states and 4199 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:32,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:32,390 INFO L93 Difference]: Finished difference Result 3467 states and 5070 transitions. [2025-03-03 16:05:32,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:05:32,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 16:05:32,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:32,394 INFO L225 Difference]: With dead ends: 3467 [2025-03-03 16:05:32,394 INFO L226 Difference]: Without dead ends: 2189 [2025-03-03 16:05:32,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:32,396 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 30 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3025 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:32,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3025 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:32,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2025-03-03 16:05:32,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 2187. [2025-03-03 16:05:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2187 states, 2185 states have (on average 1.5189931350114416) internal successors, (3319), 2186 states have internal predecessors, (3319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 3319 transitions. [2025-03-03 16:05:32,417 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 3319 transitions. Word has length 70 [2025-03-03 16:05:32,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:32,417 INFO L471 AbstractCegarLoop]: Abstraction has 2187 states and 3319 transitions. [2025-03-03 16:05:32,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:32,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 3319 transitions. [2025-03-03 16:05:32,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 16:05:32,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:32,418 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:32,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:05:32,418 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:32,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:32,420 INFO L85 PathProgramCache]: Analyzing trace with hash 642136166, now seen corresponding path program 1 times [2025-03-03 16:05:32,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:32,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317217396] [2025-03-03 16:05:32,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:32,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:32,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 16:05:32,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 16:05:32,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:32,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:33,542 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:33,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:33,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317217396] [2025-03-03 16:05:33,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317217396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:05:33,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351092652] [2025-03-03 16:05:33,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:33,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:05:33,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:05:33,544 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:05:33,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:05:33,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 16:05:33,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 16:05:33,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:33,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:33,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 16:05:33,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:05:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:34,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:05:34,673 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:34,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351092652] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:05:34,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:05:34,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-03-03 16:05:34,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864868428] [2025-03-03 16:05:34,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:05:34,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 16:05:34,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:34,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 16:05:34,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2025-03-03 16:05:34,675 INFO L87 Difference]: Start difference. First operand 2187 states and 3319 transitions. Second operand has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 27 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:36,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:36,599 INFO L93 Difference]: Finished difference Result 5325 states and 7572 transitions. [2025-03-03 16:05:36,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-03 16:05:36,600 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 27 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 16:05:36,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:36,606 INFO L225 Difference]: With dead ends: 5325 [2025-03-03 16:05:36,606 INFO L226 Difference]: Without dead ends: 4685 [2025-03-03 16:05:36,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=840, Invalid=3716, Unknown=0, NotChecked=0, Total=4556 [2025-03-03 16:05:36,609 INFO L435 NwaCegarLoop]: 1487 mSDtfsCounter, 21921 mSDsluCounter, 7840 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21921 SdHoareTripleChecker+Valid, 9327 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:36,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21921 Valid, 9327 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:05:36,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4685 states. [2025-03-03 16:05:36,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4685 to 4629. [2025-03-03 16:05:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4629 states, 4627 states have (on average 1.4091203803760537) internal successors, (6520), 4628 states have internal predecessors, (6520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4629 states to 4629 states and 6520 transitions. [2025-03-03 16:05:36,666 INFO L78 Accepts]: Start accepts. Automaton has 4629 states and 6520 transitions. Word has length 72 [2025-03-03 16:05:36,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:36,666 INFO L471 AbstractCegarLoop]: Abstraction has 4629 states and 6520 transitions. [2025-03-03 16:05:36,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 27 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:36,666 INFO L276 IsEmpty]: Start isEmpty. Operand 4629 states and 6520 transitions. [2025-03-03 16:05:36,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 16:05:36,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:36,667 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, 1, 1, 1] [2025-03-03 16:05:36,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 16:05:36,872 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-03 16:05:36,872 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:36,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:36,872 INFO L85 PathProgramCache]: Analyzing trace with hash 934575819, now seen corresponding path program 1 times [2025-03-03 16:05:36,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:36,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581077366] [2025-03-03 16:05:36,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:36,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:36,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 16:05:36,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 16:05:36,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:36,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:37,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:37,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581077366] [2025-03-03 16:05:37,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581077366] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:05:37,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031584809] [2025-03-03 16:05:37,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:37,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:05:37,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:05:37,730 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:05:37,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 16:05:37,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 16:05:37,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 16:05:37,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:37,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:37,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:05:37,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:05:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:38,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:05:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:38,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031584809] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:05:38,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:05:38,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-03-03 16:05:38,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469084185] [2025-03-03 16:05:38,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:05:38,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 16:05:38,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:38,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 16:05:38,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2025-03-03 16:05:38,952 INFO L87 Difference]: Start difference. First operand 4629 states and 6520 transitions. Second operand has 28 states, 28 states have (on average 6.464285714285714) internal successors, (181), 27 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:39,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:39,982 INFO L93 Difference]: Finished difference Result 16567 states and 22246 transitions. [2025-03-03 16:05:39,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 16:05:39,982 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.464285714285714) internal successors, (181), 27 states have internal predecessors, (181), 0 states have call successors, (0), 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 73 [2025-03-03 16:05:39,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:40,004 INFO L225 Difference]: With dead ends: 16567 [2025-03-03 16:05:40,004 INFO L226 Difference]: Without dead ends: 13485 [2025-03-03 16:05:40,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=582, Invalid=2388, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 16:05:40,013 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 19819 mSDsluCounter, 4977 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19819 SdHoareTripleChecker+Valid, 6476 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:40,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19819 Valid, 6476 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:05:40,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13485 states. [2025-03-03 16:05:40,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13485 to 13385. [2025-03-03 16:05:40,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13385 states, 13383 states have (on average 1.338713292983636) internal successors, (17916), 13384 states have internal predecessors, (17916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:40,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13385 states to 13385 states and 17916 transitions. [2025-03-03 16:05:40,307 INFO L78 Accepts]: Start accepts. Automaton has 13385 states and 17916 transitions. Word has length 73 [2025-03-03 16:05:40,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:40,307 INFO L471 AbstractCegarLoop]: Abstraction has 13385 states and 17916 transitions. [2025-03-03 16:05:40,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.464285714285714) internal successors, (181), 27 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:40,307 INFO L276 IsEmpty]: Start isEmpty. Operand 13385 states and 17916 transitions. [2025-03-03 16:05:40,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 16:05:40,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:40,309 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, 1, 1, 1] [2025-03-03 16:05:40,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 16:05:40,509 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-03 16:05:40,510 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:40,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:40,510 INFO L85 PathProgramCache]: Analyzing trace with hash 542316651, now seen corresponding path program 1 times [2025-03-03 16:05:40,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:40,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662255135] [2025-03-03 16:05:40,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:40,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:40,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 16:05:40,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 16:05:40,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:40,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:40,711 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:40,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:40,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662255135] [2025-03-03 16:05:40,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662255135] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:05:40,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576228866] [2025-03-03 16:05:40,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:40,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:05:40,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:05:40,715 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:05:40,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 16:05:40,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 16:05:40,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 16:05:40,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:40,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:40,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 16:05:40,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:05:41,986 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:41,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:05:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:43,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576228866] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:05:43,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:05:43,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 15] total 33 [2025-03-03 16:05:43,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086842636] [2025-03-03 16:05:43,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:05:43,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 16:05:43,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:43,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 16:05:43,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 16:05:43,038 INFO L87 Difference]: Start difference. First operand 13385 states and 17916 transitions. Second operand has 33 states, 33 states have (on average 5.848484848484849) internal successors, (193), 33 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:45,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:45,330 INFO L93 Difference]: Finished difference Result 35781 states and 47414 transitions. [2025-03-03 16:05:45,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-03 16:05:45,333 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 5.848484848484849) internal successors, (193), 33 states have internal predecessors, (193), 0 states have call successors, (0), 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 73 [2025-03-03 16:05:45,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:45,442 INFO L225 Difference]: With dead ends: 35781 [2025-03-03 16:05:45,442 INFO L226 Difference]: Without dead ends: 23943 [2025-03-03 16:05:45,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1454, Invalid=4398, Unknown=0, NotChecked=0, Total=5852 [2025-03-03 16:05:45,461 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 13358 mSDsluCounter, 11531 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13358 SdHoareTripleChecker+Valid, 13073 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:45,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13358 Valid, 13073 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:05:45,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23943 states. [2025-03-03 16:05:46,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23943 to 15913. [2025-03-03 16:05:46,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15913 states, 15911 states have (on average 1.3172019357677078) internal successors, (20958), 15912 states have internal predecessors, (20958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15913 states to 15913 states and 20958 transitions. [2025-03-03 16:05:46,163 INFO L78 Accepts]: Start accepts. Automaton has 15913 states and 20958 transitions. Word has length 73 [2025-03-03 16:05:46,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:46,163 INFO L471 AbstractCegarLoop]: Abstraction has 15913 states and 20958 transitions. [2025-03-03 16:05:46,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.848484848484849) internal successors, (193), 33 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:46,164 INFO L276 IsEmpty]: Start isEmpty. Operand 15913 states and 20958 transitions. [2025-03-03 16:05:46,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 16:05:46,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:46,165 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, 1, 1, 1, 1] [2025-03-03 16:05:46,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 16:05:46,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:05:46,370 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:46,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:46,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1987671038, now seen corresponding path program 1 times [2025-03-03 16:05:46,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:46,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830665189] [2025-03-03 16:05:46,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:46,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:46,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 16:05:46,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 16:05:46,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:46,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:46,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:46,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830665189] [2025-03-03 16:05:46,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830665189] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:05:46,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043073833] [2025-03-03 16:05:46,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:46,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:05:46,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:05:46,639 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:05:46,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 16:05:46,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 16:05:46,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 16:05:46,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:46,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:46,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-03 16:05:46,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:05:49,085 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:49,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:05:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:51,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043073833] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:05:51,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:05:51,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23, 24] total 51 [2025-03-03 16:05:51,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470779647] [2025-03-03 16:05:51,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:05:51,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-03 16:05:51,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:51,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-03 16:05:51,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=2147, Unknown=0, NotChecked=0, Total=2550 [2025-03-03 16:05:51,844 INFO L87 Difference]: Start difference. First operand 15913 states and 20958 transitions. Second operand has 51 states, 51 states have (on average 3.9607843137254903) internal successors, (202), 51 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:55,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:55,601 INFO L93 Difference]: Finished difference Result 40972 states and 52941 transitions. [2025-03-03 16:05:55,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-03 16:05:55,602 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.9607843137254903) internal successors, (202), 51 states have internal predecessors, (202), 0 states have call successors, (0), 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 74 [2025-03-03 16:05:55,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:55,677 INFO L225 Difference]: With dead ends: 40972 [2025-03-03 16:05:55,677 INFO L226 Difference]: Without dead ends: 26606 [2025-03-03 16:05:55,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2970 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2390, Invalid=8116, Unknown=0, NotChecked=0, Total=10506 [2025-03-03 16:05:55,689 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 18094 mSDsluCounter, 17078 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18094 SdHoareTripleChecker+Valid, 18580 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:55,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18094 Valid, 18580 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 16:05:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26606 states. [2025-03-03 16:05:56,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26606 to 15189. [2025-03-03 16:05:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15189 states, 15187 states have (on average 1.30908013432541) internal successors, (19881), 15188 states have internal predecessors, (19881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15189 states to 15189 states and 19881 transitions. [2025-03-03 16:05:56,042 INFO L78 Accepts]: Start accepts. Automaton has 15189 states and 19881 transitions. Word has length 74 [2025-03-03 16:05:56,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:56,043 INFO L471 AbstractCegarLoop]: Abstraction has 15189 states and 19881 transitions. [2025-03-03 16:05:56,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.9607843137254903) internal successors, (202), 51 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:56,043 INFO L276 IsEmpty]: Start isEmpty. Operand 15189 states and 19881 transitions. [2025-03-03 16:05:56,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 16:05:56,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:56,044 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, 1, 1, 1, 1, 1] [2025-03-03 16:05:56,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 16:05:56,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:05:56,245 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:56,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:56,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1202430224, now seen corresponding path program 1 times [2025-03-03 16:05:56,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:56,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750488720] [2025-03-03 16:05:56,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:56,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:56,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:05:56,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:05:56,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:56,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:57,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:57,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750488720] [2025-03-03 16:05:57,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750488720] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:05:57,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616239178] [2025-03-03 16:05:57,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:57,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:05:57,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:05:57,951 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:05:57,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 16:05:57,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:05:58,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:05:58,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:58,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:58,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 16:05:58,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:05:58,690 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:58,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:05:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:59,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616239178] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:05:59,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:05:59,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 12, 12] total 47 [2025-03-03 16:05:59,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878826972] [2025-03-03 16:05:59,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:05:59,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-03 16:05:59,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:59,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-03 16:05:59,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1998, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 16:05:59,275 INFO L87 Difference]: Start difference. First operand 15189 states and 19881 transitions. Second operand has 47 states, 47 states have (on average 4.319148936170213) internal successors, (203), 47 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:07,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:07,086 INFO L93 Difference]: Finished difference Result 32430 states and 42241 transitions. [2025-03-03 16:06:07,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-03-03 16:06:07,087 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 4.319148936170213) internal successors, (203), 47 states have internal predecessors, (203), 0 states have call successors, (0), 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 75 [2025-03-03 16:06:07,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:07,119 INFO L225 Difference]: With dead ends: 32430 [2025-03-03 16:06:07,119 INFO L226 Difference]: Without dead ends: 27276 [2025-03-03 16:06:07,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3943 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=3214, Invalid=11548, Unknown=0, NotChecked=0, Total=14762 [2025-03-03 16:06:07,131 INFO L435 NwaCegarLoop]: 1538 mSDtfsCounter, 25811 mSDsluCounter, 24642 mSDsCounter, 0 mSdLazyCounter, 2875 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25811 SdHoareTripleChecker+Valid, 26180 SdHoareTripleChecker+Invalid, 2990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:07,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25811 Valid, 26180 Invalid, 2990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2875 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 16:06:07,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27276 states. [2025-03-03 16:06:07,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27276 to 17373. [2025-03-03 16:06:07,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17373 states, 17371 states have (on average 1.3013067756605838) internal successors, (22605), 17372 states have internal predecessors, (22605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17373 states to 17373 states and 22605 transitions. [2025-03-03 16:06:07,655 INFO L78 Accepts]: Start accepts. Automaton has 17373 states and 22605 transitions. Word has length 75 [2025-03-03 16:06:07,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:07,655 INFO L471 AbstractCegarLoop]: Abstraction has 17373 states and 22605 transitions. [2025-03-03 16:06:07,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 4.319148936170213) internal successors, (203), 47 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:07,655 INFO L276 IsEmpty]: Start isEmpty. Operand 17373 states and 22605 transitions. [2025-03-03 16:06:07,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 16:06:07,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:07,657 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, 1, 1, 1, 1, 1] [2025-03-03 16:06:07,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 16:06:07,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-03 16:06:07,857 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:07,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:07,858 INFO L85 PathProgramCache]: Analyzing trace with hash -917270960, now seen corresponding path program 1 times [2025-03-03 16:06:07,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:07,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097593209] [2025-03-03 16:06:07,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:07,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:07,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:06:07,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:06:07,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:07,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:08,367 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:08,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:08,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097593209] [2025-03-03 16:06:08,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097593209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:06:08,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636770944] [2025-03-03 16:06:08,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:08,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:06:08,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:06:08,370 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:06:08,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 16:06:08,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:06:08,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:06:08,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:08,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:08,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 16:06:08,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:06:09,020 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:09,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:06:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:09,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636770944] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:06:09,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:06:09,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-03 16:06:09,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542512104] [2025-03-03 16:06:09,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:06:09,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 16:06:09,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:09,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 16:06:09,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 16:06:09,910 INFO L87 Difference]: Start difference. First operand 17373 states and 22605 transitions. Second operand has 33 states, 33 states have (on average 5.848484848484849) internal successors, (193), 33 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:12,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:12,820 INFO L93 Difference]: Finished difference Result 25083 states and 32424 transitions. [2025-03-03 16:06:12,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-03 16:06:12,820 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 5.848484848484849) internal successors, (193), 33 states have internal predecessors, (193), 0 states have call successors, (0), 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 75 [2025-03-03 16:06:12,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:12,834 INFO L225 Difference]: With dead ends: 25083 [2025-03-03 16:06:12,834 INFO L226 Difference]: Without dead ends: 15481 [2025-03-03 16:06:12,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1127, Invalid=4129, Unknown=0, NotChecked=0, Total=5256 [2025-03-03 16:06:12,844 INFO L435 NwaCegarLoop]: 1514 mSDtfsCounter, 15028 mSDsluCounter, 24384 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15028 SdHoareTripleChecker+Valid, 25898 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:12,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15028 Valid, 25898 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:06:12,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15481 states. [2025-03-03 16:06:13,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15481 to 13673. [2025-03-03 16:06:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13673 states, 13671 states have (on average 1.3048789408236412) internal successors, (17839), 13672 states have internal predecessors, (17839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13673 states to 13673 states and 17839 transitions. [2025-03-03 16:06:13,231 INFO L78 Accepts]: Start accepts. Automaton has 13673 states and 17839 transitions. Word has length 75 [2025-03-03 16:06:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:13,232 INFO L471 AbstractCegarLoop]: Abstraction has 13673 states and 17839 transitions. [2025-03-03 16:06:13,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.848484848484849) internal successors, (193), 33 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:13,232 INFO L276 IsEmpty]: Start isEmpty. Operand 13673 states and 17839 transitions. [2025-03-03 16:06:13,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 16:06:13,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:13,233 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:06:13,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 16:06:13,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:06:13,433 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:13,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:13,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1068467684, now seen corresponding path program 1 times [2025-03-03 16:06:13,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:13,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257770389] [2025-03-03 16:06:13,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:13,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:13,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 16:06:13,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 16:06:13,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:13,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:13,504 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:06:13,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:13,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257770389] [2025-03-03 16:06:13,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257770389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:06:13,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166891227] [2025-03-03 16:06:13,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:13,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:06:13,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:06:13,507 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:06:13,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 16:06:13,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 16:06:13,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 16:06:13,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:13,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:13,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:06:13,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:06:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:06:13,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:06:13,840 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:06:13,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166891227] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:06:13,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:06:13,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2025-03-03 16:06:13,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142903858] [2025-03-03 16:06:13,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:06:13,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:06:13,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:13,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:06:13,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:06:13,843 INFO L87 Difference]: Start difference. First operand 13673 states and 17839 transitions. Second operand has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:14,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:14,496 INFO L93 Difference]: Finished difference Result 31944 states and 40504 transitions. [2025-03-03 16:06:14,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:06:14,497 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 0 states have call successors, (0), 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 76 [2025-03-03 16:06:14,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:14,515 INFO L225 Difference]: With dead ends: 31944 [2025-03-03 16:06:14,515 INFO L226 Difference]: Without dead ends: 19818 [2025-03-03 16:06:14,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:06:14,523 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 5830 mSDsluCounter, 3146 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5830 SdHoareTripleChecker+Valid, 4666 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:14,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5830 Valid, 4666 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:06:14,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19818 states. [2025-03-03 16:06:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19818 to 18784. [2025-03-03 16:06:15,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18784 states, 18782 states have (on average 1.2491747417740389) internal successors, (23462), 18783 states have internal predecessors, (23462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18784 states to 18784 states and 23462 transitions. [2025-03-03 16:06:15,328 INFO L78 Accepts]: Start accepts. Automaton has 18784 states and 23462 transitions. Word has length 76 [2025-03-03 16:06:15,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:15,328 INFO L471 AbstractCegarLoop]: Abstraction has 18784 states and 23462 transitions. [2025-03-03 16:06:15,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:15,328 INFO L276 IsEmpty]: Start isEmpty. Operand 18784 states and 23462 transitions. [2025-03-03 16:06:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 16:06:15,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:15,332 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:06:15,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 16:06:15,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:06:15,532 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:15,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:15,533 INFO L85 PathProgramCache]: Analyzing trace with hash 791945369, now seen corresponding path program 1 times [2025-03-03 16:06:15,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:15,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47450200] [2025-03-03 16:06:15,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:15,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:15,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 16:06:15,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 16:06:15,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:15,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:16,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:16,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47450200] [2025-03-03 16:06:16,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47450200] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:06:16,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460582453] [2025-03-03 16:06:16,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:16,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:06:16,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:06:16,033 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:06:16,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 16:06:16,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 16:06:16,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 16:06:16,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:16,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:16,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-03 16:06:16,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:06:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:19,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:06:27,845 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 24 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:27,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460582453] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:06:27,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:06:27,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 31, 33] total 74 [2025-03-03 16:06:27,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977600190] [2025-03-03 16:06:27,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:06:27,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2025-03-03 16:06:27,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:27,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2025-03-03 16:06:27,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=4929, Unknown=0, NotChecked=0, Total=5402 [2025-03-03 16:06:27,847 INFO L87 Difference]: Start difference. First operand 18784 states and 23462 transitions. Second operand has 74 states, 74 states have (on average 4.581081081081081) internal successors, (339), 74 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)