./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label05.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.3.1.ufo.BOUNDED-6.pals+Problem12_label05.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 55a25aaba499ad6f05f5b24cde70628308432569fd1f75e76cd806a685179688 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:00:18,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:00:18,105 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:00:18,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:00:18,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:00:18,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:00:18,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:00:18,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:00:18,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:00:18,128 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:00:18,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:00:18,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:00:18,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:00:18,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:00:18,129 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:00:18,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:00:18,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:00:18,129 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:00:18,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:00:18,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:00:18,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:00:18,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:00:18,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:00:18,129 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:00:18,129 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:00:18,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:00:18,129 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:00:18,129 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:00:18,129 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:00:18,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:00:18,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:00:18,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:00:18,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:00:18,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:00:18,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:00:18,130 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:00:18,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:00:18,130 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:00:18,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:00:18,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:00:18,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:00:18,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:00:18,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:00:18,130 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 -> 55a25aaba499ad6f05f5b24cde70628308432569fd1f75e76cd806a685179688 [2025-03-03 16:00:18,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:00:18,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:00:18,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:00:18,381 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:00:18,381 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:00:18,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label05.c [2025-03-03 16:00:19,520 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80adf9f1a/1aca7ab9d1a04777b1149689ee63a15c/FLAG848f6494a [2025-03-03 16:00:19,925 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:00:19,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label05.c [2025-03-03 16:00:19,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80adf9f1a/1aca7ab9d1a04777b1149689ee63a15c/FLAG848f6494a [2025-03-03 16:00:20,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80adf9f1a/1aca7ab9d1a04777b1149689ee63a15c [2025-03-03 16:00:20,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:00:20,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:00:20,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:00:20,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:00:20,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:00:20,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:00:20" (1/1) ... [2025-03-03 16:00:20,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b6c7ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:00:20, skipping insertion in model container [2025-03-03 16:00:20,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:00:20" (1/1) ... [2025-03-03 16:00:20,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:00:20,407 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.3.1.ufo.BOUNDED-6.pals+Problem12_label05.c[6391,6404] [2025-03-03 16:00:20,467 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.3.1.ufo.BOUNDED-6.pals+Problem12_label05.c[13327,13340] [2025-03-03 16:00:20,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:00:20,865 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:00:20,892 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.3.1.ufo.BOUNDED-6.pals+Problem12_label05.c[6391,6404] [2025-03-03 16:00:20,897 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.3.1.ufo.BOUNDED-6.pals+Problem12_label05.c[13327,13340] [2025-03-03 16:00:21,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:00:21,155 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:00:21,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:00:21 WrapperNode [2025-03-03 16:00:21,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:00:21,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:00:21,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:00:21,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:00:21,161 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:00:21" (1/1) ... [2025-03-03 16:00:21,195 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:00:21" (1/1) ... [2025-03-03 16:00:21,417 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4978 [2025-03-03 16:00:21,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:00:21,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:00:21,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:00:21,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:00:21,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:00:21" (1/1) ... [2025-03-03 16:00:21,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:00:21" (1/1) ... [2025-03-03 16:00:21,461 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:00:21" (1/1) ... [2025-03-03 16:00:21,664 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:00:21,665 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:00:21" (1/1) ... [2025-03-03 16:00:21,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:00:21" (1/1) ... [2025-03-03 16:00:21,771 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:00:21" (1/1) ... [2025-03-03 16:00:21,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:00:21" (1/1) ... [2025-03-03 16:00:21,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:00:21" (1/1) ... [2025-03-03 16:00:21,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:00:21" (1/1) ... [2025-03-03 16:00:21,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:00:21,876 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:00:21,877 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:00:21,877 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:00:21,878 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:00:21" (1/1) ... [2025-03-03 16:00:21,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:00:21,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:00:21,905 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:00:21,909 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:00:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:00:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:00:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:00:21,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:00:22,003 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:00:22,005 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:00:25,399 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1984: havoc calculate_output_#t~ret30#1; [2025-03-03 16:00:25,400 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3463: havoc calculate_output2_#t~ret31#1; [2025-03-03 16:00:25,400 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4953: havoc calculate_output3_#t~ret32#1; [2025-03-03 16:00:25,516 INFO L? ?]: Removed 732 outVars from TransFormulas that were not future-live. [2025-03-03 16:00:25,516 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:00:25,549 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:00:25,553 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:00:25,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:00:25 BoogieIcfgContainer [2025-03-03 16:00:25,553 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:00:25,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:00:25,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:00:25,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:00:25,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:00:20" (1/3) ... [2025-03-03 16:00:25,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9b867c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:00:25, skipping insertion in model container [2025-03-03 16:00:25,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:00:21" (2/3) ... [2025-03-03 16:00:25,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9b867c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:00:25, skipping insertion in model container [2025-03-03 16:00:25,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:00:25" (3/3) ... [2025-03-03 16:00:25,561 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label05.c [2025-03-03 16:00:25,572 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:00:25,575 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label05.c that has 1 procedures, 871 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:00:25,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:00:25,649 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;@43c5f476, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:00:25,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:00:25,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 871 states, 868 states have (on average 1.9055299539170507) internal successors, (1654), 870 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states 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:00:25,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 16:00:25,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:25,661 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] [2025-03-03 16:00:25,662 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:25,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:25,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1636970803, now seen corresponding path program 1 times [2025-03-03 16:00:25,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:25,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549000631] [2025-03-03 16:00:25,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:25,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:25,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 16:00:25,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 16:00:25,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:25,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:25,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:00:25,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:25,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549000631] [2025-03-03 16:00:25,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549000631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:00:25,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:00:25,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:00:25,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334748278] [2025-03-03 16:00:25,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:00:25,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 16:00:25,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:00:25,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 16:00:25,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:00:25,850 INFO L87 Difference]: Start difference. First operand has 871 states, 868 states have (on average 1.9055299539170507) internal successors, (1654), 870 states have internal predecessors, (1654), 0 states have call successors, (0), 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 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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:00:25,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:25,919 INFO L93 Difference]: Finished difference Result 1720 states and 3268 transitions. [2025-03-03 16:00:25,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 16:00:25,920 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-03-03 16:00:25,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:25,935 INFO L225 Difference]: With dead ends: 1720 [2025-03-03 16:00:25,935 INFO L226 Difference]: Without dead ends: 806 [2025-03-03 16:00:25,942 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:00:25,945 INFO L435 NwaCegarLoop]: 1590 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, 1590 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:00:25,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1590 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:00:25,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-03-03 16:00:25,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2025-03-03 16:00:25,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 804 states have (on average 1.8955223880597014) internal successors, (1524), 805 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states 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:00:26,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1524 transitions. [2025-03-03 16:00:26,004 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1524 transitions. Word has length 20 [2025-03-03 16:00:26,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:26,004 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1524 transitions. [2025-03-03 16:00:26,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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:00:26,005 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1524 transitions. [2025-03-03 16:00:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 16:00:26,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:26,006 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] [2025-03-03 16:00:26,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:00:26,006 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:26,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:26,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1131412178, now seen corresponding path program 1 times [2025-03-03 16:00:26,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:26,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353060092] [2025-03-03 16:00:26,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:26,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:26,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 16:00:26,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 16:00:26,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:26,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:26,159 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:00:26,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:26,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353060092] [2025-03-03 16:00:26,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353060092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:00:26,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:00:26,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:00:26,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598775965] [2025-03-03 16:00:26,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:00:26,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:00:26,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:00:26,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:00:26,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:00:26,164 INFO L87 Difference]: Start difference. First operand 806 states and 1524 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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:00:26,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:26,257 INFO L93 Difference]: Finished difference Result 870 states and 1622 transitions. [2025-03-03 16:00:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:00:26,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-03-03 16:00:26,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:26,260 INFO L225 Difference]: With dead ends: 870 [2025-03-03 16:00:26,260 INFO L226 Difference]: Without dead ends: 836 [2025-03-03 16:00:26,261 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:00:26,283 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 46 mSDsluCounter, 4538 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 6058 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:00:26,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 6058 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:00:26,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-03-03 16:00:26,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 806. [2025-03-03 16:00:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 804 states have (on average 1.8756218905472637) internal successors, (1508), 805 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states 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:00:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1508 transitions. [2025-03-03 16:00:26,309 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1508 transitions. Word has length 20 [2025-03-03 16:00:26,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:26,309 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1508 transitions. [2025-03-03 16:00:26,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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:00:26,309 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1508 transitions. [2025-03-03 16:00:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 16:00:26,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:26,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:00:26,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:00:26,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:26,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:26,311 INFO L85 PathProgramCache]: Analyzing trace with hash 784018818, now seen corresponding path program 1 times [2025-03-03 16:00:26,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:26,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001075707] [2025-03-03 16:00:26,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:26,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:26,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 16:00:26,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 16:00:26,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:26,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:26,447 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:00:26,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:26,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001075707] [2025-03-03 16:00:26,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001075707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:00:26,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:00:26,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:00:26,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628734382] [2025-03-03 16:00:26,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:00:26,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:00:26,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:00:26,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:00:26,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:00:26,449 INFO L87 Difference]: Start difference. First operand 806 states and 1508 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:00:26,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:26,548 INFO L93 Difference]: Finished difference Result 986 states and 1790 transitions. [2025-03-03 16:00:26,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:00:26,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-03-03 16:00:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:26,555 INFO L225 Difference]: With dead ends: 986 [2025-03-03 16:00:26,555 INFO L226 Difference]: Without dead ends: 956 [2025-03-03 16:00:26,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:00:26,557 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 4589 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4589 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:00:26,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4589 Valid, 1865 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:00:26,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-03-03 16:00:26,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 834. [2025-03-03 16:00:26,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 832 states have (on average 1.8653846153846154) internal successors, (1552), 833 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states 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:00:26,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1552 transitions. [2025-03-03 16:00:26,585 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1552 transitions. Word has length 35 [2025-03-03 16:00:26,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:26,585 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1552 transitions. [2025-03-03 16:00:26,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:00:26,585 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1552 transitions. [2025-03-03 16:00:26,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 16:00:26,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:26,587 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:00:26,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:00:26,587 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:26,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:26,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1351806755, now seen corresponding path program 1 times [2025-03-03 16:00:26,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:26,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70056717] [2025-03-03 16:00:26,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:26,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:26,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 16:00:26,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 16:00:26,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:26,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:26,674 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:00:26,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:26,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70056717] [2025-03-03 16:00:26,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70056717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:00:26,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:00:26,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:00:26,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905722762] [2025-03-03 16:00:26,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:00:26,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:00:26,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:00:26,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:00:26,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:00:26,675 INFO L87 Difference]: Start difference. First operand 834 states and 1552 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:00:26,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:26,700 INFO L93 Difference]: Finished difference Result 939 states and 1715 transitions. [2025-03-03 16:00:26,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:00:26,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-03-03 16:00:26,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:26,705 INFO L225 Difference]: With dead ends: 939 [2025-03-03 16:00:26,705 INFO L226 Difference]: Without dead ends: 881 [2025-03-03 16:00:26,706 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:00:26,707 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 1466 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1548 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:00:26,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 1548 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:00:26,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-03 16:00:26,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2025-03-03 16:00:26,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 877 states have (on average 1.847206385404789) internal successors, (1620), 878 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states 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:00:26,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1620 transitions. [2025-03-03 16:00:26,730 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1620 transitions. Word has length 37 [2025-03-03 16:00:26,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:26,730 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1620 transitions. [2025-03-03 16:00:26,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:00:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1620 transitions. [2025-03-03 16:00:26,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 16:00:26,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:26,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:00:26,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:00:26,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:26,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:26,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1319483520, now seen corresponding path program 1 times [2025-03-03 16:00:26,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:26,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223268273] [2025-03-03 16:00:26,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:26,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:26,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 16:00:26,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 16:00:26,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:26,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:26,882 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:00:26,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:26,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223268273] [2025-03-03 16:00:26,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223268273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:00:26,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:00:26,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:00:26,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114517081] [2025-03-03 16:00:26,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:00:26,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:00:26,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:00:26,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:00:26,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:00:26,884 INFO L87 Difference]: Start difference. First operand 879 states and 1620 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:00:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:26,939 INFO L93 Difference]: Finished difference Result 984 states and 1780 transitions. [2025-03-03 16:00:26,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:00:26,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-03-03 16:00:26,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:26,942 INFO L225 Difference]: With dead ends: 984 [2025-03-03 16:00:26,942 INFO L226 Difference]: Without dead ends: 881 [2025-03-03 16:00:26,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:00:26,943 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 1475 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:00:26,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1632 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:00:26,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-03 16:00:26,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2025-03-03 16:00:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 877 states have (on average 1.8449258836944127) internal successors, (1618), 878 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states 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:00:26,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1618 transitions. [2025-03-03 16:00:26,959 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1618 transitions. Word has length 37 [2025-03-03 16:00:26,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:26,959 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1618 transitions. [2025-03-03 16:00:26,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:00:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1618 transitions. [2025-03-03 16:00:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 16:00:26,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:26,960 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:00:26,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:00:26,961 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:26,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:26,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2076221574, now seen corresponding path program 1 times [2025-03-03 16:00:26,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:26,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236029983] [2025-03-03 16:00:26,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:26,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:26,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 16:00:26,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 16:00:26,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:26,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:27,141 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:00:27,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:27,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236029983] [2025-03-03 16:00:27,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236029983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:00:27,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:00:27,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:00:27,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670299343] [2025-03-03 16:00:27,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:00:27,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:00:27,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:00:27,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:00:27,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:00:27,143 INFO L87 Difference]: Start difference. First operand 879 states and 1618 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:00:27,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:27,242 INFO L93 Difference]: Finished difference Result 887 states and 1627 transitions. [2025-03-03 16:00:27,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:00:27,243 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-03-03 16:00:27,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:27,247 INFO L225 Difference]: With dead ends: 887 [2025-03-03 16:00:27,247 INFO L226 Difference]: Without dead ends: 885 [2025-03-03 16:00:27,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:00:27,248 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 0 mSDsluCounter, 8996 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10498 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:00:27,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10498 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:00:27,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-03-03 16:00:27,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2025-03-03 16:00:27,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 883 states have (on average 1.838052095130238) internal successors, (1623), 884 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states 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:00:27,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1623 transitions. [2025-03-03 16:00:27,272 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1623 transitions. Word has length 38 [2025-03-03 16:00:27,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:27,273 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1623 transitions. [2025-03-03 16:00:27,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:00:27,274 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1623 transitions. [2025-03-03 16:00:27,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 16:00:27,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:27,275 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] [2025-03-03 16:00:27,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:00:27,275 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:27,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:27,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2103070882, now seen corresponding path program 1 times [2025-03-03 16:00:27,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:27,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977870974] [2025-03-03 16:00:27,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:27,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:27,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 16:00:27,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 16:00:27,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:27,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:27,335 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:00:27,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:27,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977870974] [2025-03-03 16:00:27,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977870974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:00:27,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:00:27,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:00:27,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807530921] [2025-03-03 16:00:27,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:00:27,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:00:27,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:00:27,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:00:27,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:00:27,337 INFO L87 Difference]: Start difference. First operand 885 states and 1623 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:00:27,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:27,360 INFO L93 Difference]: Finished difference Result 1007 states and 1804 transitions. [2025-03-03 16:00:27,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:00:27,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-03-03 16:00:27,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:27,364 INFO L225 Difference]: With dead ends: 1007 [2025-03-03 16:00:27,364 INFO L226 Difference]: Without dead ends: 943 [2025-03-03 16:00:27,364 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:00:27,365 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1476 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1588 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:00:27,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1588 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:00:27,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-03-03 16:00:27,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 941. [2025-03-03 16:00:27,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 939 states have (on average 1.8146964856230032) internal successors, (1704), 940 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:00:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1704 transitions. [2025-03-03 16:00:27,387 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1704 transitions. Word has length 39 [2025-03-03 16:00:27,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:27,387 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1704 transitions. [2025-03-03 16:00:27,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:00:27,388 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1704 transitions. [2025-03-03 16:00:27,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 16:00:27,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:27,390 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] [2025-03-03 16:00:27,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:00:27,390 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:27,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:27,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1687895010, now seen corresponding path program 1 times [2025-03-03 16:00:27,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:27,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043907448] [2025-03-03 16:00:27,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:27,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:27,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 16:00:27,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 16:00:27,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:27,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:27,435 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:00:27,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:27,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043907448] [2025-03-03 16:00:27,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043907448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:00:27,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:00:27,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:00:27,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703154979] [2025-03-03 16:00:27,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:00:27,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:00:27,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:00:27,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:00:27,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:00:27,436 INFO L87 Difference]: Start difference. First operand 941 states and 1704 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:00:27,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:27,460 INFO L93 Difference]: Finished difference Result 1243 states and 2144 transitions. [2025-03-03 16:00:27,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:00:27,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-03-03 16:00:27,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:27,464 INFO L225 Difference]: With dead ends: 1243 [2025-03-03 16:00:27,464 INFO L226 Difference]: Without dead ends: 1080 [2025-03-03 16:00:27,465 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:00:27,465 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1594 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:00:27,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1594 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:00:27,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2025-03-03 16:00:27,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1078. [2025-03-03 16:00:27,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1076 states have (on average 1.762081784386617) internal successors, (1896), 1077 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states 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:00:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1896 transitions. [2025-03-03 16:00:27,489 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1896 transitions. Word has length 39 [2025-03-03 16:00:27,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:27,489 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1896 transitions. [2025-03-03 16:00:27,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:00:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1896 transitions. [2025-03-03 16:00:27,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 16:00:27,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:27,490 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] [2025-03-03 16:00:27,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:00:27,490 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:27,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:27,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2120354014, now seen corresponding path program 1 times [2025-03-03 16:00:27,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:27,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667958768] [2025-03-03 16:00:27,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:27,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:27,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 16:00:27,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 16:00:27,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:27,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:27,529 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:00:27,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:27,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667958768] [2025-03-03 16:00:27,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667958768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:00:27,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:00:27,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:00:27,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593953673] [2025-03-03 16:00:27,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:00:27,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:00:27,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:00:27,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:00:27,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:00:27,531 INFO L87 Difference]: Start difference. First operand 1078 states and 1896 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:00:27,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:27,559 INFO L93 Difference]: Finished difference Result 1630 states and 2678 transitions. [2025-03-03 16:00:27,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:00:27,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-03-03 16:00:27,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:27,564 INFO L225 Difference]: With dead ends: 1630 [2025-03-03 16:00:27,565 INFO L226 Difference]: Without dead ends: 1330 [2025-03-03 16:00:27,565 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:00:27,567 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1472 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1596 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:00:27,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1596 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:00:27,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-03-03 16:00:27,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1328. [2025-03-03 16:00:27,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1326 states have (on average 1.6832579185520362) internal successors, (2232), 1327 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states 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:00:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 2232 transitions. [2025-03-03 16:00:27,598 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 2232 transitions. Word has length 39 [2025-03-03 16:00:27,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:27,598 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 2232 transitions. [2025-03-03 16:00:27,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:00:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 2232 transitions. [2025-03-03 16:00:27,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 16:00:27,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:27,599 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] [2025-03-03 16:00:27,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:00:27,599 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:27,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:27,600 INFO L85 PathProgramCache]: Analyzing trace with hash 900512759, now seen corresponding path program 1 times [2025-03-03 16:00:27,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:27,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73387492] [2025-03-03 16:00:27,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:27,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:27,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 16:00:27,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 16:00:27,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:27,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:00:27,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:27,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73387492] [2025-03-03 16:00:27,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73387492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:00:27,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:00:27,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:00:27,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707134611] [2025-03-03 16:00:27,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:00:27,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:00:27,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:00:27,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:00:27,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:00:27,720 INFO L87 Difference]: Start difference. First operand 1328 states and 2232 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:00:27,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:27,801 INFO L93 Difference]: Finished difference Result 2960 states and 4508 transitions. [2025-03-03 16:00:27,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:00:27,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-03 16:00:27,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:27,811 INFO L225 Difference]: With dead ends: 2960 [2025-03-03 16:00:27,812 INFO L226 Difference]: Without dead ends: 2558 [2025-03-03 16:00:27,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:00:27,814 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 3037 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3037 SdHoareTripleChecker+Valid, 3172 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:00:27,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3037 Valid, 3172 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:00:27,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2025-03-03 16:00:27,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 1804. [2025-03-03 16:00:27,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1802 states have (on average 1.602663706992231) internal successors, (2888), 1803 states have internal predecessors, (2888), 0 states have call successors, (0), 0 states 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:00:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2888 transitions. [2025-03-03 16:00:27,855 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2888 transitions. Word has length 54 [2025-03-03 16:00:27,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:27,855 INFO L471 AbstractCegarLoop]: Abstraction has 1804 states and 2888 transitions. [2025-03-03 16:00:27,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:00:27,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2888 transitions. [2025-03-03 16:00:27,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 16:00:27,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:27,856 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] [2025-03-03 16:00:27,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:00:27,857 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:27,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:27,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1315688631, now seen corresponding path program 1 times [2025-03-03 16:00:27,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:27,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279239801] [2025-03-03 16:00:27,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:27,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:27,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 16:00:27,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 16:00:27,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:27,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:00:27,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:27,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279239801] [2025-03-03 16:00:27,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279239801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:00:27,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:00:27,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:00:27,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846594772] [2025-03-03 16:00:27,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:00:27,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:00:27,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:00:27,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:00:27,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:00:27,960 INFO L87 Difference]: Start difference. First operand 1804 states and 2888 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:00:28,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:28,030 INFO L93 Difference]: Finished difference Result 3508 states and 5268 transitions. [2025-03-03 16:00:28,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:00:28,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-03 16:00:28,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:28,039 INFO L225 Difference]: With dead ends: 3508 [2025-03-03 16:00:28,040 INFO L226 Difference]: Without dead ends: 2958 [2025-03-03 16:00:28,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:00:28,042 INFO L435 NwaCegarLoop]: 1547 mSDtfsCounter, 3041 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3041 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:00:28,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3041 Valid, 3147 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:00:28,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2025-03-03 16:00:28,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2552. [2025-03-03 16:00:28,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2550 states have (on average 1.5356862745098039) internal successors, (3916), 2551 states have internal predecessors, (3916), 0 states have call successors, (0), 0 states 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:00:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3916 transitions. [2025-03-03 16:00:28,092 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3916 transitions. Word has length 54 [2025-03-03 16:00:28,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:28,092 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3916 transitions. [2025-03-03 16:00:28,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:00:28,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3916 transitions. [2025-03-03 16:00:28,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 16:00:28,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:28,093 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] [2025-03-03 16:00:28,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:00:28,093 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:28,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:28,094 INFO L85 PathProgramCache]: Analyzing trace with hash 828970359, now seen corresponding path program 1 times [2025-03-03 16:00:28,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:28,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178607726] [2025-03-03 16:00:28,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:28,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:28,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 16:00:28,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 16:00:28,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:28,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:28,237 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:00:28,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:28,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178607726] [2025-03-03 16:00:28,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178607726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:00:28,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:00:28,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:00:28,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713281378] [2025-03-03 16:00:28,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:00:28,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:00:28,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:00:28,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:00:28,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:00:28,243 INFO L87 Difference]: Start difference. First operand 2552 states and 3916 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:00:28,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:28,390 INFO L93 Difference]: Finished difference Result 4056 states and 6024 transitions. [2025-03-03 16:00:28,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:00:28,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-03 16:00:28,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:28,401 INFO L225 Difference]: With dead ends: 4056 [2025-03-03 16:00:28,401 INFO L226 Difference]: Without dead ends: 3506 [2025-03-03 16:00:28,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:00:28,403 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 3047 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3047 SdHoareTripleChecker+Valid, 3153 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:00:28,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3047 Valid, 3153 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:00:28,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2025-03-03 16:00:28,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3100. [2025-03-03 16:00:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3100 states, 3098 states have (on average 1.5080697224015494) internal successors, (4672), 3099 states have internal predecessors, (4672), 0 states have call successors, (0), 0 states 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:00:28,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4672 transitions. [2025-03-03 16:00:28,462 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4672 transitions. Word has length 54 [2025-03-03 16:00:28,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:28,462 INFO L471 AbstractCegarLoop]: Abstraction has 3100 states and 4672 transitions. [2025-03-03 16:00:28,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:00:28,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4672 transitions. [2025-03-03 16:00:28,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 16:00:28,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:28,463 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] [2025-03-03 16:00:28,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:00:28,463 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:28,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:28,464 INFO L85 PathProgramCache]: Analyzing trace with hash -357767785, now seen corresponding path program 1 times [2025-03-03 16:00:28,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:28,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788063877] [2025-03-03 16:00:28,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:28,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:28,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 16:00:28,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 16:00:28,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:28,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:00:28,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:28,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788063877] [2025-03-03 16:00:28,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788063877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:00:28,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:00:28,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:00:28,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72269304] [2025-03-03 16:00:28,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:00:28,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:00:28,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:00:28,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:00:28,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:00:28,532 INFO L87 Difference]: Start difference. First operand 3100 states and 4672 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:00:28,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:28,574 INFO L93 Difference]: Finished difference Result 5424 states and 7882 transitions. [2025-03-03 16:00:28,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:00:28,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-03 16:00:28,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:28,583 INFO L225 Difference]: With dead ends: 5424 [2025-03-03 16:00:28,583 INFO L226 Difference]: Without dead ends: 3102 [2025-03-03 16:00:28,586 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:00:28,587 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 29 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3022 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:00:28,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3022 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:00:28,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2025-03-03 16:00:28,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 3100. [2025-03-03 16:00:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3100 states, 3098 states have (on average 1.4919302775984506) internal successors, (4622), 3099 states have internal predecessors, (4622), 0 states have call successors, (0), 0 states 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:00:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4622 transitions. [2025-03-03 16:00:28,642 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4622 transitions. Word has length 55 [2025-03-03 16:00:28,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:28,643 INFO L471 AbstractCegarLoop]: Abstraction has 3100 states and 4622 transitions. [2025-03-03 16:00:28,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:00:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4622 transitions. [2025-03-03 16:00:28,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 16:00:28,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:28,644 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] [2025-03-03 16:00:28,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:00:28,644 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:28,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:28,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1485901451, now seen corresponding path program 1 times [2025-03-03 16:00:28,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:28,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703815949] [2025-03-03 16:00:28,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:28,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:28,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 16:00:28,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 16:00:28,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:28,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:28,703 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:00:28,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:28,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703815949] [2025-03-03 16:00:28,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703815949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:00:28,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:00:28,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:00:28,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744528394] [2025-03-03 16:00:28,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:00:28,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:00:28,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:00:28,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:00:28,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:00:28,706 INFO L87 Difference]: Start difference. First operand 3100 states and 4622 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:00:28,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:28,738 INFO L93 Difference]: Finished difference Result 4019 states and 5882 transitions. [2025-03-03 16:00:28,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:00:28,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-03 16:00:28,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:28,743 INFO L225 Difference]: With dead ends: 4019 [2025-03-03 16:00:28,744 INFO L226 Difference]: Without dead ends: 1697 [2025-03-03 16:00:28,746 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:00:28,746 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 23 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3019 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:00:28,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3019 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:00:28,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2025-03-03 16:00:28,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1689. [2025-03-03 16:00:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1687 states have (on average 1.5986959098992295) internal successors, (2697), 1688 states have internal predecessors, (2697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:00:28,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2697 transitions. [2025-03-03 16:00:28,820 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2697 transitions. Word has length 56 [2025-03-03 16:00:28,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:28,820 INFO L471 AbstractCegarLoop]: Abstraction has 1689 states and 2697 transitions. [2025-03-03 16:00:28,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:00:28,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2697 transitions. [2025-03-03 16:00:28,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 16:00:28,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:28,821 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] [2025-03-03 16:00:28,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:00:28,821 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:28,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:28,822 INFO L85 PathProgramCache]: Analyzing trace with hash 505748734, now seen corresponding path program 1 times [2025-03-03 16:00:28,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:28,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951713432] [2025-03-03 16:00:28,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:28,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:28,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 16:00:28,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 16:00:28,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:28,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:00:28,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:28,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951713432] [2025-03-03 16:00:28,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951713432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:00:28,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:00:28,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:00:28,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541108132] [2025-03-03 16:00:28,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:00:28,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:00:28,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:00:28,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:00:28,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:00:28,873 INFO L87 Difference]: Start difference. First operand 1689 states and 2697 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:00:28,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:28,896 INFO L93 Difference]: Finished difference Result 2143 states and 3311 transitions. [2025-03-03 16:00:28,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:00:28,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-03 16:00:28,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:28,900 INFO L225 Difference]: With dead ends: 2143 [2025-03-03 16:00:28,900 INFO L226 Difference]: Without dead ends: 1241 [2025-03-03 16:00:28,902 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:00:28,902 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 25 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2998 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:00:28,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2998 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:00:28,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2025-03-03 16:00:28,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1239. [2025-03-03 16:00:28,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1237 states have (on average 1.6782538399353275) internal successors, (2076), 1238 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states 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:00:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 2076 transitions. [2025-03-03 16:00:28,926 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 2076 transitions. Word has length 57 [2025-03-03 16:00:28,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:28,927 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 2076 transitions. [2025-03-03 16:00:28,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:00:28,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2076 transitions. [2025-03-03 16:00:28,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:00:28,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:28,927 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] [2025-03-03 16:00:28,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:00:28,929 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:28,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:28,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1114797445, now seen corresponding path program 1 times [2025-03-03 16:00:28,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:28,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839039922] [2025-03-03 16:00:28,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:28,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:28,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:00:28,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:00:28,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:28,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:29,275 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:00:29,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:29,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839039922] [2025-03-03 16:00:29,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839039922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:00:29,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583239859] [2025-03-03 16:00:29,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:29,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:00:29,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:00:29,281 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:00:29,283 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:00:29,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:00:29,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:00:29,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:29,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:29,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 16:00:29,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:00:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:00:29,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:00:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:00:29,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583239859] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:00:29,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:00:29,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 4] total 16 [2025-03-03 16:00:29,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702559738] [2025-03-03 16:00:29,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:00:29,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 16:00:29,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:00:29,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 16:00:29,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-03 16:00:29,757 INFO L87 Difference]: Start difference. First operand 1239 states and 2076 transitions. Second operand has 16 states, 16 states have (on average 10.0) internal successors, (160), 16 states have internal predecessors, (160), 0 states have call successors, (0), 0 states 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:00:30,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:30,736 INFO L93 Difference]: Finished difference Result 3247 states and 4697 transitions. [2025-03-03 16:00:30,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 16:00:30,737 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.0) internal successors, (160), 16 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-03 16:00:30,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:30,747 INFO L225 Difference]: With dead ends: 3247 [2025-03-03 16:00:30,747 INFO L226 Difference]: Without dead ends: 2795 [2025-03-03 16:00:30,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=396, Invalid=1326, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 16:00:30,750 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 10929 mSDsluCounter, 6173 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10929 SdHoareTripleChecker+Valid, 7672 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:00:30,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10929 Valid, 7672 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:00:30,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2795 states. [2025-03-03 16:00:30,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2795 to 2677. [2025-03-03 16:00:30,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2675 states have (on average 1.4418691588785046) internal successors, (3857), 2676 states have internal predecessors, (3857), 0 states have call successors, (0), 0 states 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:00:30,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 3857 transitions. [2025-03-03 16:00:30,845 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 3857 transitions. Word has length 59 [2025-03-03 16:00:30,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:30,845 INFO L471 AbstractCegarLoop]: Abstraction has 2677 states and 3857 transitions. [2025-03-03 16:00:30,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.0) internal successors, (160), 16 states have internal predecessors, (160), 0 states have call successors, (0), 0 states 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:00:30,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3857 transitions. [2025-03-03 16:00:30,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 16:00:30,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:30,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:00:30,859 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:00:31,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 16:00:31,051 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:31,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:31,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1652376586, now seen corresponding path program 1 times [2025-03-03 16:00:31,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:31,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429576426] [2025-03-03 16:00:31,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:31,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:31,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:00:31,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:00:31,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:31,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:31,134 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:00:31,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:31,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429576426] [2025-03-03 16:00:31,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429576426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:00:31,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:00:31,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:00:31,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609065377] [2025-03-03 16:00:31,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:00:31,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:00:31,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:00:31,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:00:31,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:00:31,135 INFO L87 Difference]: Start difference. First operand 2677 states and 3857 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:00:35,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:35,489 INFO L93 Difference]: Finished difference Result 4932 states and 8166 transitions. [2025-03-03 16:00:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:00:35,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-03 16:00:35,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:35,496 INFO L225 Difference]: With dead ends: 4932 [2025-03-03 16:00:35,496 INFO L226 Difference]: Without dead ends: 4179 [2025-03-03 16:00:35,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:00:35,497 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 2319 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2319 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:00:35,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2319 Valid, 780 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-03 16:00:35,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4179 states. [2025-03-03 16:00:35,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4179 to 4179. [2025-03-03 16:00:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4179 states, 4177 states have (on average 1.4323677280344744) internal successors, (5983), 4178 states have internal predecessors, (5983), 0 states have call successors, (0), 0 states 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:00:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4179 states to 4179 states and 5983 transitions. [2025-03-03 16:00:35,571 INFO L78 Accepts]: Start accepts. Automaton has 4179 states and 5983 transitions. Word has length 60 [2025-03-03 16:00:35,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:35,572 INFO L471 AbstractCegarLoop]: Abstraction has 4179 states and 5983 transitions. [2025-03-03 16:00:35,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:00:35,572 INFO L276 IsEmpty]: Start isEmpty. Operand 4179 states and 5983 transitions. [2025-03-03 16:00:35,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 16:00:35,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:35,573 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:00:35,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:00:35,573 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:35,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:35,574 INFO L85 PathProgramCache]: Analyzing trace with hash 420436844, now seen corresponding path program 1 times [2025-03-03 16:00:35,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:35,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601245886] [2025-03-03 16:00:35,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:35,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:35,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:00:35,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:00:35,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:35,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:36,015 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:00:36,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:36,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601245886] [2025-03-03 16:00:36,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601245886] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:00:36,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072060419] [2025-03-03 16:00:36,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:36,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:00:36,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:00:36,019 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:00:36,021 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:00:36,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:00:36,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:00:36,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:36,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:36,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 16:00:36,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:00:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:00:36,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:00:38,002 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:00:38,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072060419] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:00:38,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:00:38,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 30 [2025-03-03 16:00:38,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141004445] [2025-03-03 16:00:38,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:00:38,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 16:00:38,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:00:38,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 16:00:38,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2025-03-03 16:00:38,003 INFO L87 Difference]: Start difference. First operand 4179 states and 5983 transitions. Second operand has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 states have internal predecessors, (160), 0 states have call successors, (0), 0 states 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:00:38,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:38,996 INFO L93 Difference]: Finished difference Result 8858 states and 11919 transitions. [2025-03-03 16:00:38,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 16:00:38,996 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-03 16:00:38,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:39,009 INFO L225 Difference]: With dead ends: 8858 [2025-03-03 16:00:39,009 INFO L226 Difference]: Without dead ends: 7371 [2025-03-03 16:00:39,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=758, Invalid=2322, Unknown=0, NotChecked=0, Total=3080 [2025-03-03 16:00:39,013 INFO L435 NwaCegarLoop]: 1487 mSDtfsCounter, 16932 mSDsluCounter, 7705 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16932 SdHoareTripleChecker+Valid, 9192 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:00:39,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16932 Valid, 9192 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:00:39,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7371 states. [2025-03-03 16:00:39,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7371 to 7175. [2025-03-03 16:00:39,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7175 states, 7173 states have (on average 1.3478321483340303) internal successors, (9668), 7174 states have internal predecessors, (9668), 0 states have call successors, (0), 0 states 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:00:39,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7175 states to 7175 states and 9668 transitions. [2025-03-03 16:00:39,183 INFO L78 Accepts]: Start accepts. Automaton has 7175 states and 9668 transitions. Word has length 60 [2025-03-03 16:00:39,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:39,183 INFO L471 AbstractCegarLoop]: Abstraction has 7175 states and 9668 transitions. [2025-03-03 16:00:39,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 states have internal predecessors, (160), 0 states have call successors, (0), 0 states 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:00:39,183 INFO L276 IsEmpty]: Start isEmpty. Operand 7175 states and 9668 transitions. [2025-03-03 16:00:39,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 16:00:39,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:39,184 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:00:39,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 16:00:39,385 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,SelfDestructingSolverStorable17 [2025-03-03 16:00:39,385 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:39,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:39,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1592793716, now seen corresponding path program 1 times [2025-03-03 16:00:39,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:39,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568764409] [2025-03-03 16:00:39,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:39,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:39,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:00:39,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:00:39,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:39,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:39,663 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:00:39,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:39,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568764409] [2025-03-03 16:00:39,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568764409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:00:39,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031456455] [2025-03-03 16:00:39,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:39,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:00:39,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:00:39,666 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:00:39,668 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:00:39,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:00:39,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:00:39,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:39,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:39,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:00:39,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:00:39,979 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:00:39,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:00:40,498 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:00:40,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031456455] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:00:40,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:00:40,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 16:00:40,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673386897] [2025-03-03 16:00:40,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:00:40,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 16:00:40,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:00:40,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 16:00:40,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-03 16:00:40,500 INFO L87 Difference]: Start difference. First operand 7175 states and 9668 transitions. Second operand has 21 states, 21 states have (on average 6.095238095238095) internal successors, (128), 20 states have internal predecessors, (128), 0 states have call successors, (0), 0 states 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:00:40,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:40,948 INFO L93 Difference]: Finished difference Result 13112 states and 17130 transitions. [2025-03-03 16:00:40,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 16:00:40,949 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.095238095238095) internal successors, (128), 20 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-03 16:00:40,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:40,963 INFO L225 Difference]: With dead ends: 13112 [2025-03-03 16:00:40,963 INFO L226 Difference]: Without dead ends: 8986 [2025-03-03 16:00:40,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2025-03-03 16:00:40,966 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 11876 mSDsluCounter, 3236 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11876 SdHoareTripleChecker+Valid, 4738 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:00:40,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11876 Valid, 4738 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:00:40,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8986 states. [2025-03-03 16:00:41,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8986 to 8918. [2025-03-03 16:00:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8918 states, 8916 states have (on average 1.322902646926873) internal successors, (11795), 8917 states have internal predecessors, (11795), 0 states have call successors, (0), 0 states 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:00:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8918 states to 8918 states and 11795 transitions. [2025-03-03 16:00:41,137 INFO L78 Accepts]: Start accepts. Automaton has 8918 states and 11795 transitions. Word has length 60 [2025-03-03 16:00:41,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:41,137 INFO L471 AbstractCegarLoop]: Abstraction has 8918 states and 11795 transitions. [2025-03-03 16:00:41,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.095238095238095) internal successors, (128), 20 states have internal predecessors, (128), 0 states have call successors, (0), 0 states 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:00:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 8918 states and 11795 transitions. [2025-03-03 16:00:41,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 16:00:41,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:41,138 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:00:41,145 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:00:41,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:00:41,339 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:41,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:41,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1045991069, now seen corresponding path program 1 times [2025-03-03 16:00:41,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:41,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175243996] [2025-03-03 16:00:41,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:41,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:41,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 16:00:41,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 16:00:41,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:41,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:41,889 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:00:41,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:41,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175243996] [2025-03-03 16:00:41,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175243996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:00:41,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578952710] [2025-03-03 16:00:41,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:41,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:00:41,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:00:41,892 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:00:41,894 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:00:41,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 16:00:41,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 16:00:41,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:41,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:41,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 16:00:41,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:00:43,287 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:00:43,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:00:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:00:44,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578952710] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:00:44,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:00:44,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 17] total 44 [2025-03-03 16:00:44,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62045904] [2025-03-03 16:00:44,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:00:44,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-03 16:00:44,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:00:44,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-03 16:00:44,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1629, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 16:00:44,522 INFO L87 Difference]: Start difference. First operand 8918 states and 11795 transitions. Second operand has 44 states, 44 states have (on average 3.659090909090909) internal successors, (161), 44 states have internal predecessors, (161), 0 states have call successors, (0), 0 states 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:00:54,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:54,623 INFO L93 Difference]: Finished difference Result 16606 states and 21381 transitions. [2025-03-03 16:00:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-03-03 16:00:54,623 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.659090909090909) internal successors, (161), 44 states have internal predecessors, (161), 0 states have call successors, (0), 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:00:54,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:54,639 INFO L225 Difference]: With dead ends: 16606 [2025-03-03 16:00:54,639 INFO L226 Difference]: Without dead ends: 12629 [2025-03-03 16:00:54,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7754 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=4457, Invalid=16135, Unknown=0, NotChecked=0, Total=20592 [2025-03-03 16:00:54,647 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 9044 mSDsluCounter, 21808 mSDsCounter, 0 mSdLazyCounter, 1898 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9044 SdHoareTripleChecker+Valid, 23331 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:00:54,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9044 Valid, 23331 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1898 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 16:00:54,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12629 states. [2025-03-03 16:00:54,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12629 to 8998. [2025-03-03 16:00:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8998 states, 8996 states have (on average 1.322032014228546) internal successors, (11893), 8997 states have internal predecessors, (11893), 0 states have call successors, (0), 0 states 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:00:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8998 states to 8998 states and 11893 transitions. [2025-03-03 16:00:54,973 INFO L78 Accepts]: Start accepts. Automaton has 8998 states and 11893 transitions. Word has length 61 [2025-03-03 16:00:54,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:54,973 INFO L471 AbstractCegarLoop]: Abstraction has 8998 states and 11893 transitions. [2025-03-03 16:00:54,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.659090909090909) internal successors, (161), 44 states have internal predecessors, (161), 0 states have call successors, (0), 0 states 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:00:54,974 INFO L276 IsEmpty]: Start isEmpty. Operand 8998 states and 11893 transitions. [2025-03-03 16:00:54,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 16:00:54,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:54,974 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] [2025-03-03 16:00:54,981 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:00:55,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:00:55,175 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:55,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:55,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1435836916, now seen corresponding path program 1 times [2025-03-03 16:00:55,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:55,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825390690] [2025-03-03 16:00:55,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:55,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:55,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 16:00:55,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 16:00:55,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:55,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:55,737 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:00:55,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:55,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825390690] [2025-03-03 16:00:55,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825390690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:00:55,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844972209] [2025-03-03 16:00:55,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:55,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:00:55,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:00:55,739 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:00:55,741 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:00:55,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 16:00:55,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 16:00:55,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:55,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:55,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 16:00:55,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:00:56,276 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:00:56,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:00:57,064 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:00:57,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844972209] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:00:57,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:00:57,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 33 [2025-03-03 16:00:57,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378425554] [2025-03-03 16:00:57,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:00:57,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 16:00:57,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:00:57,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 16:00:57,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 16:00:57,066 INFO L87 Difference]: Start difference. First operand 8998 states and 11893 transitions. Second operand has 33 states, 33 states have (on average 4.393939393939394) internal successors, (145), 33 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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:00:58,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:58,277 INFO L93 Difference]: Finished difference Result 13025 states and 16880 transitions. [2025-03-03 16:00:58,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:00:58,278 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.393939393939394) internal successors, (145), 33 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-03 16:00:58,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:58,289 INFO L225 Difference]: With dead ends: 13025 [2025-03-03 16:00:58,289 INFO L226 Difference]: Without dead ends: 8979 [2025-03-03 16:00:58,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=442, Invalid=1720, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 16:00:58,294 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 12521 mSDsluCounter, 13793 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12521 SdHoareTripleChecker+Valid, 15300 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:00:58,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12521 Valid, 15300 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:00:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8979 states. [2025-03-03 16:00:58,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8979 to 6462. [2025-03-03 16:00:58,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6462 states, 6460 states have (on average 1.360061919504644) internal successors, (8786), 6461 states have internal predecessors, (8786), 0 states have call successors, (0), 0 states 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:00:58,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6462 states to 6462 states and 8786 transitions. [2025-03-03 16:00:58,582 INFO L78 Accepts]: Start accepts. Automaton has 6462 states and 8786 transitions. Word has length 62 [2025-03-03 16:00:58,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:58,582 INFO L471 AbstractCegarLoop]: Abstraction has 6462 states and 8786 transitions. [2025-03-03 16:00:58,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.393939393939394) internal successors, (145), 33 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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:00:58,582 INFO L276 IsEmpty]: Start isEmpty. Operand 6462 states and 8786 transitions. [2025-03-03 16:00:58,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 16:00:58,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:58,584 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 16:00:58,591 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:00:58,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:00:58,785 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:58,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:58,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1483083885, now seen corresponding path program 1 times [2025-03-03 16:00:58,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:00:58,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825368] [2025-03-03 16:00:58,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:58,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:00:58,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 16:00:58,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 16:00:58,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:58,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:59,421 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 25 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:00:59,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:00:59,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825368] [2025-03-03 16:00:59,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825368] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:00:59,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220465754] [2025-03-03 16:00:59,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:59,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:00:59,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:00:59,424 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:00:59,424 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:00:59,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 16:00:59,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 16:00:59,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:59,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:59,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 16:00:59,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:00:59,971 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 27 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:00:59,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:01:01,096 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 25 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:01,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220465754] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:01:01,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:01:01,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2025-03-03 16:01:01,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636213976] [2025-03-03 16:01:01,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:01:01,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 16:01:01,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:01,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 16:01:01,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2025-03-03 16:01:01,098 INFO L87 Difference]: Start difference. First operand 6462 states and 8786 transitions. Second operand has 31 states, 31 states have (on average 7.645161290322581) internal successors, (237), 30 states have internal predecessors, (237), 0 states have call successors, (0), 0 states 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:01:02,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:02,414 INFO L93 Difference]: Finished difference Result 15798 states and 20594 transitions. [2025-03-03 16:01:02,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 16:01:02,417 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.645161290322581) internal successors, (237), 30 states have internal predecessors, (237), 0 states have call successors, (0), 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 99 [2025-03-03 16:01:02,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:02,428 INFO L225 Difference]: With dead ends: 15798 [2025-03-03 16:01:02,429 INFO L226 Difference]: Without dead ends: 11922 [2025-03-03 16:01:02,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=835, Invalid=2947, Unknown=0, NotChecked=0, Total=3782 [2025-03-03 16:01:02,435 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 22994 mSDsluCounter, 13891 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22994 SdHoareTripleChecker+Valid, 15427 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:02,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22994 Valid, 15427 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:01:02,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11922 states. [2025-03-03 16:01:02,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11922 to 11112. [2025-03-03 16:01:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11112 states, 11110 states have (on average 1.2996399639963996) internal successors, (14439), 11111 states have internal predecessors, (14439), 0 states have call successors, (0), 0 states 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:01:02,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11112 states to 11112 states and 14439 transitions. [2025-03-03 16:01:02,782 INFO L78 Accepts]: Start accepts. Automaton has 11112 states and 14439 transitions. Word has length 99 [2025-03-03 16:01:02,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:02,782 INFO L471 AbstractCegarLoop]: Abstraction has 11112 states and 14439 transitions. [2025-03-03 16:01:02,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.645161290322581) internal successors, (237), 30 states have internal predecessors, (237), 0 states have call successors, (0), 0 states 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:01:02,782 INFO L276 IsEmpty]: Start isEmpty. Operand 11112 states and 14439 transitions. [2025-03-03 16:01:02,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 16:01:02,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:02,784 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 16:01:02,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 16:01:02,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:01:02,984 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:02,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:02,985 INFO L85 PathProgramCache]: Analyzing trace with hash -397254221, now seen corresponding path program 1 times [2025-03-03 16:01:02,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:02,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981588456] [2025-03-03 16:01:02,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:02,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:02,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 16:01:03,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 16:01:03,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:03,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:04,261 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:04,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:04,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981588456] [2025-03-03 16:01:04,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981588456] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:01:04,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998124881] [2025-03-03 16:01:04,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:04,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:01:04,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:01:04,264 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:01:04,265 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:01:04,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 16:01:04,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 16:01:04,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:04,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:04,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-03 16:01:04,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:01:07,259 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 25 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:07,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:01:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:11,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998124881] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:01:11,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:01:11,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26, 24] total 69 [2025-03-03 16:01:11,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333572105] [2025-03-03 16:01:11,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:01:11,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2025-03-03 16:01:11,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:11,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2025-03-03 16:01:11,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=4280, Unknown=0, NotChecked=0, Total=4692 [2025-03-03 16:01:11,246 INFO L87 Difference]: Start difference. First operand 11112 states and 14439 transitions. Second operand has 69 states, 69 states have (on average 4.086956521739131) internal successors, (282), 69 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)