./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.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 afac0863a681e4712e7bffaf04a415cd693c6153e1fe439605f11a4c250fdcc1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:29:53,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:29:53,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:29:53,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:29:53,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:29:53,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:29:53,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:29:53,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:29:53,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:29:53,388 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:29:53,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:29:53,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:29:53,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:29:53,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:29:53,388 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:29:53,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:29:53,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:29:53,388 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:29:53,388 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:29:53,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:29:53,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:29:53,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:29:53,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:29:53,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:29:53,389 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:29:53,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:29:53,389 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:29:53,389 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:29:53,389 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:29:53,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:29:53,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:29:53,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:29:53,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:29:53,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:29:53,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:29:53,390 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:29:53,390 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:29:53,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:29:53,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:29:53,390 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:29:53,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:29:53,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:29:53,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:29:53,390 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 -> afac0863a681e4712e7bffaf04a415cd693c6153e1fe439605f11a4c250fdcc1 [2025-03-16 19:29:53,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:29:53,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:29:53,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:29:53,644 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:29:53,644 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:29:53,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-03-16 19:29:54,799 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/762e596d1/31c38f6a4d284c66b38776a2340ac788/FLAG7653830ff [2025-03-16 19:29:55,057 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:29:55,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-03-16 19:29:55,064 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/762e596d1/31c38f6a4d284c66b38776a2340ac788/FLAG7653830ff [2025-03-16 19:29:55,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/762e596d1/31c38f6a4d284c66b38776a2340ac788 [2025-03-16 19:29:55,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:29:55,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:29:55,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:29:55,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:29:55,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:29:55,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:29:55" (1/1) ... [2025-03-16 19:29:55,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d327a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:55, skipping insertion in model container [2025-03-16 19:29:55,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:29:55" (1/1) ... [2025-03-16 19:29:55,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:29:55,256 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4069,4082] [2025-03-16 19:29:55,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:29:55,278 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:29:55,298 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4069,4082] [2025-03-16 19:29:55,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:29:55,324 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:29:55,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:55 WrapperNode [2025-03-16 19:29:55,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:29:55,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:29:55,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:29:55,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:29:55,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:55" (1/1) ... [2025-03-16 19:29:55,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:55" (1/1) ... [2025-03-16 19:29:55,363 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 296 [2025-03-16 19:29:55,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:29:55,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:29:55,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:29:55,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:29:55,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:55" (1/1) ... [2025-03-16 19:29:55,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:55" (1/1) ... [2025-03-16 19:29:55,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:55" (1/1) ... [2025-03-16 19:29:55,384 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:29:55,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:55" (1/1) ... [2025-03-16 19:29:55,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:55" (1/1) ... [2025-03-16 19:29:55,391 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:55" (1/1) ... [2025-03-16 19:29:55,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:55" (1/1) ... [2025-03-16 19:29:55,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:55" (1/1) ... [2025-03-16 19:29:55,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:55" (1/1) ... [2025-03-16 19:29:55,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:29:55,396 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:29:55,396 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:29:55,396 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:29:55,397 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:55" (1/1) ... [2025-03-16 19:29:55,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:29:55,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:29:55,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:29:55,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:29:55,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:29:55,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:29:55,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:29:55,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:29:55,519 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:29:55,521 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:29:55,835 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:29:55,836 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:29:55,836 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:29:55,836 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L354: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:29:55,836 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L156: havoc main_~node3__m3~0#1; [2025-03-16 19:29:55,836 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: havoc main_~node2__m2~0#1; [2025-03-16 19:29:55,836 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:29:55,854 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-16 19:29:55,855 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:29:55,865 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:29:55,866 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:29:55,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:29:55 BoogieIcfgContainer [2025-03-16 19:29:55,866 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:29:55,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:29:55,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:29:55,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:29:55,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:29:55" (1/3) ... [2025-03-16 19:29:55,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba5e368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:29:55, skipping insertion in model container [2025-03-16 19:29:55,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:55" (2/3) ... [2025-03-16 19:29:55,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba5e368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:29:55, skipping insertion in model container [2025-03-16 19:29:55,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:29:55" (3/3) ... [2025-03-16 19:29:55,877 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-03-16 19:29:55,893 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:29:55,894 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c that has 1 procedures, 61 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:29:55,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:29:55,953 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;@51126014, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:29:55,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:29:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 59 states have (on average 1.728813559322034) internal successors, (102), 60 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 19:29:55,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:55,963 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-16 19:29:55,964 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:55,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:55,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1580752250, now seen corresponding path program 1 times [2025-03-16 19:29:55,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:55,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002732183] [2025-03-16 19:29:55,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:55,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:56,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 19:29:56,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 19:29:56,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:56,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:56,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:56,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002732183] [2025-03-16 19:29:56,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002732183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:56,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:56,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:56,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762048708] [2025-03-16 19:29:56,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:56,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:56,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:56,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:56,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:56,257 INFO L87 Difference]: Start difference. First operand has 61 states, 59 states have (on average 1.728813559322034) internal successors, (102), 60 states have internal predecessors, (102), 0 states have call successors, (0), 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 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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-16 19:29:56,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:56,300 INFO L93 Difference]: Finished difference Result 139 states and 223 transitions. [2025-03-16 19:29:56,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:56,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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-16 19:29:56,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:56,308 INFO L225 Difference]: With dead ends: 139 [2025-03-16 19:29:56,308 INFO L226 Difference]: Without dead ends: 90 [2025-03-16 19:29:56,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:56,315 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 68 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:56,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 214 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:56,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-16 19:29:56,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2025-03-16 19:29:56,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 87 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 129 transitions. [2025-03-16 19:29:56,363 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 129 transitions. Word has length 35 [2025-03-16 19:29:56,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:56,363 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 129 transitions. [2025-03-16 19:29:56,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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-16 19:29:56,363 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 129 transitions. [2025-03-16 19:29:56,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 19:29:56,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:56,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:56,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:29:56,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:56,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:56,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1047895779, now seen corresponding path program 1 times [2025-03-16 19:29:56,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:56,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60082937] [2025-03-16 19:29:56,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:56,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:56,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 19:29:56,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 19:29:56,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:56,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:56,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:56,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60082937] [2025-03-16 19:29:56,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60082937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:56,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:56,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:56,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83570966] [2025-03-16 19:29:56,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:56,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:56,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:56,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:56,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:56,513 INFO L87 Difference]: Start difference. First operand 88 states and 129 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:56,532 INFO L93 Difference]: Finished difference Result 212 states and 325 transitions. [2025-03-16 19:29:56,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:56,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-16 19:29:56,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:56,534 INFO L225 Difference]: With dead ends: 212 [2025-03-16 19:29:56,534 INFO L226 Difference]: Without dead ends: 142 [2025-03-16 19:29:56,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:56,535 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 48 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:56,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 181 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:56,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-16 19:29:56,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2025-03-16 19:29:56,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.5179856115107915) internal successors, (211), 139 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:56,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 211 transitions. [2025-03-16 19:29:56,544 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 211 transitions. Word has length 36 [2025-03-16 19:29:56,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:56,544 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 211 transitions. [2025-03-16 19:29:56,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 211 transitions. [2025-03-16 19:29:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 19:29:56,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:56,545 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-16 19:29:56,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:29:56,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:56,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:56,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1242730349, now seen corresponding path program 1 times [2025-03-16 19:29:56,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:56,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519864053] [2025-03-16 19:29:56,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:56,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:56,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 19:29:56,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 19:29:56,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:56,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:56,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:56,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:56,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519864053] [2025-03-16 19:29:56,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519864053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:56,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:56,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:56,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413219442] [2025-03-16 19:29:56,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:56,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:56,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:56,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:56,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:56,614 INFO L87 Difference]: Start difference. First operand 140 states and 211 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-16 19:29:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:56,631 INFO L93 Difference]: Finished difference Result 352 states and 545 transitions. [2025-03-16 19:29:56,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:56,631 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-16 19:29:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:56,633 INFO L225 Difference]: With dead ends: 352 [2025-03-16 19:29:56,633 INFO L226 Difference]: Without dead ends: 230 [2025-03-16 19:29:56,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:56,634 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 43 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:56,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 177 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:56,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-16 19:29:56,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2025-03-16 19:29:56,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.52863436123348) internal successors, (347), 227 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:56,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 347 transitions. [2025-03-16 19:29:56,649 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 347 transitions. Word has length 37 [2025-03-16 19:29:56,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:56,650 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 347 transitions. [2025-03-16 19:29:56,651 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-16 19:29:56,651 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 347 transitions. [2025-03-16 19:29:56,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 19:29:56,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:56,651 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-16 19:29:56,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:29:56,652 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:56,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:56,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1915283850, now seen corresponding path program 1 times [2025-03-16 19:29:56,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:56,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835630866] [2025-03-16 19:29:56,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:56,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:56,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 19:29:56,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 19:29:56,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:56,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:56,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:56,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:56,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835630866] [2025-03-16 19:29:56,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835630866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:56,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:56,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:29:56,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501121833] [2025-03-16 19:29:56,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:56,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:56,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:56,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:56,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:56,795 INFO L87 Difference]: Start difference. First operand 228 states and 347 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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-16 19:29:56,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:56,911 INFO L93 Difference]: Finished difference Result 1488 states and 2321 transitions. [2025-03-16 19:29:56,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:29:56,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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-16 19:29:56,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:56,918 INFO L225 Difference]: With dead ends: 1488 [2025-03-16 19:29:56,918 INFO L226 Difference]: Without dead ends: 1278 [2025-03-16 19:29:56,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:56,921 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 374 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:56,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 534 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:29:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2025-03-16 19:29:56,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 436. [2025-03-16 19:29:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 1.5149425287356322) internal successors, (659), 435 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 659 transitions. [2025-03-16 19:29:56,970 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 659 transitions. Word has length 38 [2025-03-16 19:29:56,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:56,971 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 659 transitions. [2025-03-16 19:29:56,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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-16 19:29:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 659 transitions. [2025-03-16 19:29:56,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 19:29:56,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:56,971 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] [2025-03-16 19:29:56,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:29:56,972 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:56,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:56,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1914306701, now seen corresponding path program 1 times [2025-03-16 19:29:56,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:56,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427702904] [2025-03-16 19:29:56,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:56,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:56,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 19:29:56,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 19:29:56,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:56,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:57,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:57,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:57,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427702904] [2025-03-16 19:29:57,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427702904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:57,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:57,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:29:57,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580164973] [2025-03-16 19:29:57,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:57,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:29:57,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:57,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:29:57,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:57,052 INFO L87 Difference]: Start difference. First operand 436 states and 659 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:57,073 INFO L93 Difference]: Finished difference Result 1054 states and 1603 transitions. [2025-03-16 19:29:57,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:29:57,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2025-03-16 19:29:57,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:57,075 INFO L225 Difference]: With dead ends: 1054 [2025-03-16 19:29:57,075 INFO L226 Difference]: Without dead ends: 636 [2025-03-16 19:29:57,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:29:57,078 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 34 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:57,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 153 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:57,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-16 19:29:57,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 634. [2025-03-16 19:29:57,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 1.4992101105845181) internal successors, (949), 633 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 949 transitions. [2025-03-16 19:29:57,095 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 949 transitions. Word has length 40 [2025-03-16 19:29:57,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:57,096 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 949 transitions. [2025-03-16 19:29:57,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:57,096 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 949 transitions. [2025-03-16 19:29:57,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 19:29:57,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:57,098 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] [2025-03-16 19:29:57,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:29:57,098 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:57,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:57,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1913144852, now seen corresponding path program 1 times [2025-03-16 19:29:57,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:57,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267565458] [2025-03-16 19:29:57,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:57,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:57,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 19:29:57,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 19:29:57,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:57,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:57,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:57,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:57,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267565458] [2025-03-16 19:29:57,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267565458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:57,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:57,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:29:57,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832947848] [2025-03-16 19:29:57,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:57,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:57,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:57,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:57,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:57,290 INFO L87 Difference]: Start difference. First operand 634 states and 949 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:57,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:57,351 INFO L93 Difference]: Finished difference Result 1250 states and 1879 transitions. [2025-03-16 19:29:57,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:57,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2025-03-16 19:29:57,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:57,354 INFO L225 Difference]: With dead ends: 1250 [2025-03-16 19:29:57,354 INFO L226 Difference]: Without dead ends: 636 [2025-03-16 19:29:57,354 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-16 19:29:57,355 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 82 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:57,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 194 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-16 19:29:57,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 634. [2025-03-16 19:29:57,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 1.4802527646129542) internal successors, (937), 633 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:57,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 937 transitions. [2025-03-16 19:29:57,367 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 937 transitions. Word has length 40 [2025-03-16 19:29:57,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:57,368 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 937 transitions. [2025-03-16 19:29:57,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:57,369 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 937 transitions. [2025-03-16 19:29:57,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 19:29:57,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:57,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:57,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:29:57,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:57,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:57,370 INFO L85 PathProgramCache]: Analyzing trace with hash 823007099, now seen corresponding path program 1 times [2025-03-16 19:29:57,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:57,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296800584] [2025-03-16 19:29:57,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:57,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:57,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 19:29:57,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 19:29:57,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:57,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:57,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:57,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296800584] [2025-03-16 19:29:57,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296800584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:57,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:57,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:29:57,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48063231] [2025-03-16 19:29:57,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:57,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:57,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:57,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:57,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:57,596 INFO L87 Difference]: Start difference. First operand 634 states and 937 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:57,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:57,621 INFO L93 Difference]: Finished difference Result 668 states and 986 transitions. [2025-03-16 19:29:57,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:57,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-16 19:29:57,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:57,623 INFO L225 Difference]: With dead ends: 668 [2025-03-16 19:29:57,623 INFO L226 Difference]: Without dead ends: 666 [2025-03-16 19:29:57,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-16 19:29:57,624 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:57,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:57,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-16 19:29:57,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2025-03-16 19:29:57,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 665 states have (on average 1.4511278195488722) internal successors, (965), 665 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:57,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 965 transitions. [2025-03-16 19:29:57,637 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 965 transitions. Word has length 41 [2025-03-16 19:29:57,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:57,637 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 965 transitions. [2025-03-16 19:29:57,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:57,638 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 965 transitions. [2025-03-16 19:29:57,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 19:29:57,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:57,639 INFO L218 NwaCegarLoop]: trace histogram [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-16 19:29:57,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:29:57,639 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:57,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:57,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1481788164, now seen corresponding path program 1 times [2025-03-16 19:29:57,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:57,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818378940] [2025-03-16 19:29:57,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:57,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:57,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 19:29:57,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 19:29:57,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:57,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:29:57,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:57,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818378940] [2025-03-16 19:29:57,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818378940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:57,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:57,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:29:57,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306316619] [2025-03-16 19:29:57,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:57,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:57,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:57,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:57,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:57,759 INFO L87 Difference]: Start difference. First operand 666 states and 965 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:57,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:57,819 INFO L93 Difference]: Finished difference Result 2538 states and 3697 transitions. [2025-03-16 19:29:57,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:57,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-16 19:29:57,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:57,826 INFO L225 Difference]: With dead ends: 2538 [2025-03-16 19:29:57,826 INFO L226 Difference]: Without dead ends: 2088 [2025-03-16 19:29:57,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-16 19:29:57,828 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 211 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:57,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 372 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:57,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2025-03-16 19:29:57,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1214. [2025-03-16 19:29:57,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1213 states have (on average 1.4484748557295961) internal successors, (1757), 1213 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:57,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1757 transitions. [2025-03-16 19:29:57,855 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1757 transitions. Word has length 59 [2025-03-16 19:29:57,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:57,855 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1757 transitions. [2025-03-16 19:29:57,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:57,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1757 transitions. [2025-03-16 19:29:57,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 19:29:57,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:57,858 INFO L218 NwaCegarLoop]: trace histogram [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-16 19:29:57,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:29:57,858 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:57,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:57,859 INFO L85 PathProgramCache]: Analyzing trace with hash 669931676, now seen corresponding path program 1 times [2025-03-16 19:29:57,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:57,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056886438] [2025-03-16 19:29:57,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:57,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:57,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 19:29:57,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 19:29:57,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:57,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:57,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:29:57,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:57,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056886438] [2025-03-16 19:29:57,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056886438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:57,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:57,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:29:57,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359122442] [2025-03-16 19:29:57,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:57,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:57,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:57,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:57,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:57,961 INFO L87 Difference]: Start difference. First operand 1214 states and 1757 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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-16 19:29:58,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:58,016 INFO L93 Difference]: Finished difference Result 3182 states and 4633 transitions. [2025-03-16 19:29:58,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:58,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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 59 [2025-03-16 19:29:58,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:58,022 INFO L225 Difference]: With dead ends: 3182 [2025-03-16 19:29:58,022 INFO L226 Difference]: Without dead ends: 2536 [2025-03-16 19:29:58,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-16 19:29:58,025 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 212 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:58,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 355 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:58,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2025-03-16 19:29:58,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2082. [2025-03-16 19:29:58,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2082 states, 2081 states have (on average 1.4459394521864488) internal successors, (3009), 2081 states have internal predecessors, (3009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:58,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 3009 transitions. [2025-03-16 19:29:58,072 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 3009 transitions. Word has length 59 [2025-03-16 19:29:58,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:58,073 INFO L471 AbstractCegarLoop]: Abstraction has 2082 states and 3009 transitions. [2025-03-16 19:29:58,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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-16 19:29:58,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 3009 transitions. [2025-03-16 19:29:58,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 19:29:58,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:58,074 INFO L218 NwaCegarLoop]: trace histogram [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-16 19:29:58,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:29:58,074 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:58,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:58,076 INFO L85 PathProgramCache]: Analyzing trace with hash 877775932, now seen corresponding path program 1 times [2025-03-16 19:29:58,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:58,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521550019] [2025-03-16 19:29:58,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:58,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:58,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 19:29:58,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 19:29:58,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:58,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:58,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 19:29:58,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:58,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521550019] [2025-03-16 19:29:58,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521550019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:58,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:58,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:29:58,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723278828] [2025-03-16 19:29:58,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:58,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:58,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:58,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:58,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:58,172 INFO L87 Difference]: Start difference. First operand 2082 states and 3009 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:58,235 INFO L93 Difference]: Finished difference Result 3826 states and 5565 transitions. [2025-03-16 19:29:58,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:58,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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 59 [2025-03-16 19:29:58,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:58,243 INFO L225 Difference]: With dead ends: 3826 [2025-03-16 19:29:58,243 INFO L226 Difference]: Without dead ends: 3180 [2025-03-16 19:29:58,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-16 19:29:58,245 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 217 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:58,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 365 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:58,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2025-03-16 19:29:58,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 2726. [2025-03-16 19:29:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2726 states, 2725 states have (on average 1.4462385321100917) internal successors, (3941), 2725 states have internal predecessors, (3941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 3941 transitions. [2025-03-16 19:29:58,302 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 3941 transitions. Word has length 59 [2025-03-16 19:29:58,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:58,302 INFO L471 AbstractCegarLoop]: Abstraction has 2726 states and 3941 transitions. [2025-03-16 19:29:58,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:58,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3941 transitions. [2025-03-16 19:29:58,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 19:29:58,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:58,303 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-16 19:29:58,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:29:58,304 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:58,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:58,306 INFO L85 PathProgramCache]: Analyzing trace with hash -2018268354, now seen corresponding path program 1 times [2025-03-16 19:29:58,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:58,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248876545] [2025-03-16 19:29:58,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:58,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:58,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:29:58,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:29:58,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:58,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:58,605 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:58,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:58,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248876545] [2025-03-16 19:29:58,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248876545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:29:58,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830954579] [2025-03-16 19:29:58,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:58,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:29:58,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:29:58,608 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:29:58,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:29:58,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:29:58,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:29:58,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:58,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:58,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 19:29:58,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:29:59,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:59,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:29:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:59,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830954579] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:29:59,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:29:59,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2025-03-16 19:29:59,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998511045] [2025-03-16 19:29:59,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:29:59,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 19:29:59,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:59,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 19:29:59,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:29:59,471 INFO L87 Difference]: Start difference. First operand 2726 states and 3941 transitions. Second operand has 19 states, 19 states have (on average 9.0) internal successors, (171), 19 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:02,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:02,760 INFO L93 Difference]: Finished difference Result 23074 states and 33342 transitions. [2025-03-16 19:30:02,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2025-03-16 19:30:02,761 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 9.0) internal successors, (171), 19 states have internal predecessors, (171), 0 states have call successors, (0), 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-16 19:30:02,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:02,815 INFO L225 Difference]: With dead ends: 23074 [2025-03-16 19:30:02,815 INFO L226 Difference]: Without dead ends: 20069 [2025-03-16 19:30:02,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5625 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2172, Invalid=11870, Unknown=0, NotChecked=0, Total=14042 [2025-03-16 19:30:02,827 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 2575 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1871 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2575 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:02,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2575 Valid, 936 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1871 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:30:02,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20069 states. [2025-03-16 19:30:03,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20069 to 16609. [2025-03-16 19:30:03,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16609 states, 16608 states have (on average 1.4173892100192678) internal successors, (23540), 16608 states have internal predecessors, (23540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:03,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16609 states to 16609 states and 23540 transitions. [2025-03-16 19:30:03,157 INFO L78 Accepts]: Start accepts. Automaton has 16609 states and 23540 transitions. Word has length 60 [2025-03-16 19:30:03,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:03,158 INFO L471 AbstractCegarLoop]: Abstraction has 16609 states and 23540 transitions. [2025-03-16 19:30:03,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.0) internal successors, (171), 19 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:03,158 INFO L276 IsEmpty]: Start isEmpty. Operand 16609 states and 23540 transitions. [2025-03-16 19:30:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 19:30:03,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:03,159 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:03,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 19:30:03,359 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,SelfDestructingSolverStorable10 [2025-03-16 19:30:03,360 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:03,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:03,360 INFO L85 PathProgramCache]: Analyzing trace with hash 488033720, now seen corresponding path program 1 times [2025-03-16 19:30:03,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:03,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562745510] [2025-03-16 19:30:03,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:03,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:03,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 19:30:03,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 19:30:03,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:03,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:03,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:03,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562745510] [2025-03-16 19:30:03,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562745510] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:30:03,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661792216] [2025-03-16 19:30:03,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:03,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:30:03,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:30:03,616 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:30:03,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:30:03,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 19:30:03,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 19:30:03,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:03,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:03,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 19:30:03,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:30:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:04,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:30:05,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:05,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661792216] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:30:05,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:30:05,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 14] total 34 [2025-03-16 19:30:05,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11090380] [2025-03-16 19:30:05,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:30:05,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-16 19:30:05,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:05,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-16 19:30:05,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1044, Unknown=0, NotChecked=0, Total=1190 [2025-03-16 19:30:05,282 INFO L87 Difference]: Start difference. First operand 16609 states and 23540 transitions. Second operand has 35 states, 35 states have (on average 4.771428571428571) internal successors, (167), 34 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:19,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:19,461 INFO L93 Difference]: Finished difference Result 348905 states and 490917 transitions. [2025-03-16 19:30:19,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 265 states. [2025-03-16 19:30:19,461 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.771428571428571) internal successors, (167), 34 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 19:30:19,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:20,271 INFO L225 Difference]: With dead ends: 348905 [2025-03-16 19:30:20,271 INFO L226 Difference]: Without dead ends: 332318 [2025-03-16 19:30:20,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35686 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=10419, Invalid=77493, Unknown=0, NotChecked=0, Total=87912 [2025-03-16 19:30:20,330 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 5389 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 2965 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5389 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 3061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:20,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5389 Valid, 1656 Invalid, 3061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2965 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 19:30:20,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332318 states. [2025-03-16 19:30:22,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332318 to 139633. [2025-03-16 19:30:23,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139633 states, 139632 states have (on average 1.3925461212329553) internal successors, (194444), 139632 states have internal predecessors, (194444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:23,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139633 states to 139633 states and 194444 transitions. [2025-03-16 19:30:23,674 INFO L78 Accepts]: Start accepts. Automaton has 139633 states and 194444 transitions. Word has length 61 [2025-03-16 19:30:23,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:23,674 INFO L471 AbstractCegarLoop]: Abstraction has 139633 states and 194444 transitions. [2025-03-16 19:30:23,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.771428571428571) internal successors, (167), 34 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:23,675 INFO L276 IsEmpty]: Start isEmpty. Operand 139633 states and 194444 transitions. [2025-03-16 19:30:23,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:30:23,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:23,676 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:23,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 19:30:23,877 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,SelfDestructingSolverStorable11 [2025-03-16 19:30:23,877 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:23,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:23,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1274581566, now seen corresponding path program 1 times [2025-03-16 19:30:23,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:23,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45216609] [2025-03-16 19:30:23,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:23,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:23,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:30:23,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:30:23,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:23,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:23,907 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:30:23,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:23,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45216609] [2025-03-16 19:30:23,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45216609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:23,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:23,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:23,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225907389] [2025-03-16 19:30:23,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:23,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:23,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:23,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:23,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:23,909 INFO L87 Difference]: Start difference. First operand 139633 states and 194444 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:24,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:24,621 INFO L93 Difference]: Finished difference Result 257675 states and 359499 transitions. [2025-03-16 19:30:24,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:24,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 19:30:24,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:24,821 INFO L225 Difference]: With dead ends: 257675 [2025-03-16 19:30:24,822 INFO L226 Difference]: Without dead ends: 118166 [2025-03-16 19:30:24,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:24,907 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 57 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:24,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 105 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:25,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118166 states. [2025-03-16 19:30:26,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118166 to 118166. [2025-03-16 19:30:26,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118166 states, 118165 states have (on average 1.3751618499555707) internal successors, (162496), 118165 states have internal predecessors, (162496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118166 states to 118166 states and 162496 transitions. [2025-03-16 19:30:26,669 INFO L78 Accepts]: Start accepts. Automaton has 118166 states and 162496 transitions. Word has length 62 [2025-03-16 19:30:26,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:26,669 INFO L471 AbstractCegarLoop]: Abstraction has 118166 states and 162496 transitions. [2025-03-16 19:30:26,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:26,669 INFO L276 IsEmpty]: Start isEmpty. Operand 118166 states and 162496 transitions. [2025-03-16 19:30:26,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:30:26,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:26,671 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:26,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:30:26,671 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:26,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:26,671 INFO L85 PathProgramCache]: Analyzing trace with hash -30103056, now seen corresponding path program 1 times [2025-03-16 19:30:26,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:26,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707704637] [2025-03-16 19:30:26,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:26,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:26,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:30:26,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:30:26,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:26,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:27,845 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:27,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:27,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707704637] [2025-03-16 19:30:27,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707704637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:30:27,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458582296] [2025-03-16 19:30:27,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:27,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:30:27,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:30:27,847 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:30:27,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:30:27,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:30:27,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:30:27,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:27,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:27,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-16 19:30:27,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:30:28,590 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:28,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:30:29,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:29,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458582296] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:30:29,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:30:29,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 42 [2025-03-16 19:30:29,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133332731] [2025-03-16 19:30:29,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:30:29,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-16 19:30:29,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:29,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-16 19:30:29,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1678, Unknown=0, NotChecked=0, Total=1806 [2025-03-16 19:30:29,200 INFO L87 Difference]: Start difference. First operand 118166 states and 162496 transitions. Second operand has 43 states, 43 states have (on average 3.7906976744186047) internal successors, (163), 42 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:35,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:35,894 INFO L93 Difference]: Finished difference Result 387431 states and 530305 transitions. [2025-03-16 19:30:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2025-03-16 19:30:35,895 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.7906976744186047) internal successors, (163), 42 states have internal predecessors, (163), 0 states have call successors, (0), 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-16 19:30:35,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:36,279 INFO L225 Difference]: With dead ends: 387431 [2025-03-16 19:30:36,279 INFO L226 Difference]: Without dead ends: 336641 [2025-03-16 19:30:36,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3431 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2696, Invalid=12556, Unknown=0, NotChecked=0, Total=15252 [2025-03-16 19:30:36,351 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 2941 mSDsluCounter, 3217 mSDsCounter, 0 mSdLazyCounter, 2612 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2941 SdHoareTripleChecker+Valid, 3365 SdHoareTripleChecker+Invalid, 2641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:36,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2941 Valid, 3365 Invalid, 2641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2612 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:30:36,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336641 states. [2025-03-16 19:30:38,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336641 to 118768. [2025-03-16 19:30:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118768 states, 118767 states have (on average 1.376122997128832) internal successors, (163438), 118767 states have internal predecessors, (163438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:38,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118768 states to 118768 states and 163438 transitions. [2025-03-16 19:30:38,801 INFO L78 Accepts]: Start accepts. Automaton has 118768 states and 163438 transitions. Word has length 62 [2025-03-16 19:30:38,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:38,801 INFO L471 AbstractCegarLoop]: Abstraction has 118768 states and 163438 transitions. [2025-03-16 19:30:38,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.7906976744186047) internal successors, (163), 42 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:38,801 INFO L276 IsEmpty]: Start isEmpty. Operand 118768 states and 163438 transitions. [2025-03-16 19:30:38,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:30:38,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:38,803 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:38,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 19:30:39,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:30:39,003 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:39,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:39,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1972898070, now seen corresponding path program 1 times [2025-03-16 19:30:39,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:39,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104350415] [2025-03-16 19:30:39,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:39,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:39,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:30:39,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:30:39,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:39,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:39,041 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:30:39,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:39,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104350415] [2025-03-16 19:30:39,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104350415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:39,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:39,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:39,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476307052] [2025-03-16 19:30:39,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:39,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:39,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:39,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:39,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:39,043 INFO L87 Difference]: Start difference. First operand 118768 states and 163438 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:39,572 INFO L93 Difference]: Finished difference Result 204235 states and 282163 transitions. [2025-03-16 19:30:39,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:39,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 19:30:39,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:39,679 INFO L225 Difference]: With dead ends: 204235 [2025-03-16 19:30:39,679 INFO L226 Difference]: Without dead ends: 85542 [2025-03-16 19:30:39,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:39,753 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 46 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:39,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 72 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:39,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85542 states. [2025-03-16 19:30:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85542 to 85542. [2025-03-16 19:30:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85542 states, 85541 states have (on average 1.3699278708455593) internal successors, (117185), 85541 states have internal predecessors, (117185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85542 states to 85542 states and 117185 transitions. [2025-03-16 19:30:40,985 INFO L78 Accepts]: Start accepts. Automaton has 85542 states and 117185 transitions. Word has length 63 [2025-03-16 19:30:40,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:40,985 INFO L471 AbstractCegarLoop]: Abstraction has 85542 states and 117185 transitions. [2025-03-16 19:30:40,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:40,985 INFO L276 IsEmpty]: Start isEmpty. Operand 85542 states and 117185 transitions. [2025-03-16 19:30:40,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:30:40,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:40,986 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:40,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:30:40,986 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:40,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:40,986 INFO L85 PathProgramCache]: Analyzing trace with hash -644129237, now seen corresponding path program 1 times [2025-03-16 19:30:40,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:40,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642201478] [2025-03-16 19:30:40,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:40,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:40,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:30:41,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:30:41,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:41,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:41,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:41,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642201478] [2025-03-16 19:30:41,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642201478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:41,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:41,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:41,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005023586] [2025-03-16 19:30:41,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:41,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:41,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:41,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:41,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:41,033 INFO L87 Difference]: Start difference. First operand 85542 states and 117185 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:41,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:41,315 INFO L93 Difference]: Finished difference Result 167403 states and 229619 transitions. [2025-03-16 19:30:41,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:41,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 19:30:41,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:41,406 INFO L225 Difference]: With dead ends: 167403 [2025-03-16 19:30:41,406 INFO L226 Difference]: Without dead ends: 82072 [2025-03-16 19:30:41,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:41,459 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 35 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:41,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 169 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82072 states. [2025-03-16 19:30:42,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82072 to 79490. [2025-03-16 19:30:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79490 states, 79489 states have (on average 1.345192416560782) internal successors, (106928), 79489 states have internal predecessors, (106928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79490 states to 79490 states and 106928 transitions. [2025-03-16 19:30:42,531 INFO L78 Accepts]: Start accepts. Automaton has 79490 states and 106928 transitions. Word has length 63 [2025-03-16 19:30:42,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:42,531 INFO L471 AbstractCegarLoop]: Abstraction has 79490 states and 106928 transitions. [2025-03-16 19:30:42,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 79490 states and 106928 transitions. [2025-03-16 19:30:42,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:30:42,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:42,532 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:42,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:30:42,532 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:42,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:42,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1319624767, now seen corresponding path program 1 times [2025-03-16 19:30:42,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:42,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118844418] [2025-03-16 19:30:42,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:42,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:42,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:30:42,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:30:42,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:42,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:42,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:42,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118844418] [2025-03-16 19:30:42,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118844418] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:30:42,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828244828] [2025-03-16 19:30:42,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:42,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:30:42,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:30:42,985 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-16 19:30:42,987 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-16 19:30:43,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:30:43,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:30:43,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:43,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:43,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-16 19:30:43,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:30:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:46,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:30:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:47,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828244828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:30:47,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:30:47,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20, 21] total 48 [2025-03-16 19:30:47,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79224937] [2025-03-16 19:30:47,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:30:47,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-16 19:30:47,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:47,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-16 19:30:47,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=2040, Unknown=0, NotChecked=0, Total=2352 [2025-03-16 19:30:47,890 INFO L87 Difference]: Start difference. First operand 79490 states and 106928 transitions. Second operand has 49 states, 49 states have (on average 3.4693877551020407) internal successors, (170), 48 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:50,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 19:31:06,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:06,548 INFO L93 Difference]: Finished difference Result 264779 states and 356950 transitions. [2025-03-16 19:31:06,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2025-03-16 19:31:06,549 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.4693877551020407) internal successors, (170), 48 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 19:31:06,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:06,835 INFO L225 Difference]: With dead ends: 264779 [2025-03-16 19:31:06,835 INFO L226 Difference]: Without dead ends: 225115 [2025-03-16 19:31:06,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11678 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=5920, Invalid=26300, Unknown=0, NotChecked=0, Total=32220 [2025-03-16 19:31:06,918 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 3792 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3792 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 2562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:06,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3792 Valid, 1536 Invalid, 2562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-16 19:31:07,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225115 states. [2025-03-16 19:31:08,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225115 to 130463. [2025-03-16 19:31:08,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130463 states, 130462 states have (on average 1.3458478330854962) internal successors, (175582), 130462 states have internal predecessors, (175582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:08,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130463 states to 130463 states and 175582 transitions. [2025-03-16 19:31:08,730 INFO L78 Accepts]: Start accepts. Automaton has 130463 states and 175582 transitions. Word has length 64 [2025-03-16 19:31:08,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:08,730 INFO L471 AbstractCegarLoop]: Abstraction has 130463 states and 175582 transitions. [2025-03-16 19:31:08,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.4693877551020407) internal successors, (170), 48 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:08,730 INFO L276 IsEmpty]: Start isEmpty. Operand 130463 states and 175582 transitions. [2025-03-16 19:31:08,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:31:08,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:08,731 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:08,737 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-16 19:31:08,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 19:31:08,932 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:31:08,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:08,933 INFO L85 PathProgramCache]: Analyzing trace with hash 698655046, now seen corresponding path program 1 times [2025-03-16 19:31:08,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:08,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528435505] [2025-03-16 19:31:08,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:08,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:08,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:31:08,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:31:08,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:08,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:08,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:31:08,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:08,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528435505] [2025-03-16 19:31:08,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528435505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:08,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:08,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:31:08,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741473436] [2025-03-16 19:31:08,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:08,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:31:08,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:08,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:31:08,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:31:08,964 INFO L87 Difference]: Start difference. First operand 130463 states and 175582 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:09,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:09,493 INFO L93 Difference]: Finished difference Result 231625 states and 312095 transitions. [2025-03-16 19:31:09,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:31:09,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 19:31:09,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:09,618 INFO L225 Difference]: With dead ends: 231625 [2025-03-16 19:31:09,618 INFO L226 Difference]: Without dead ends: 101267 [2025-03-16 19:31:09,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:31:09,697 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 50 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:09,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 88 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:31:09,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101267 states. [2025-03-16 19:31:10,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101267 to 101267. [2025-03-16 19:31:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101267 states, 101266 states have (on average 1.3287776746390694) internal successors, (134560), 101266 states have internal predecessors, (134560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101267 states to 101267 states and 134560 transitions. [2025-03-16 19:31:10,960 INFO L78 Accepts]: Start accepts. Automaton has 101267 states and 134560 transitions. Word has length 64 [2025-03-16 19:31:10,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:10,960 INFO L471 AbstractCegarLoop]: Abstraction has 101267 states and 134560 transitions. [2025-03-16 19:31:10,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 101267 states and 134560 transitions. [2025-03-16 19:31:10,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 19:31:10,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:10,964 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:10,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:31:10,964 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:31:10,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:10,965 INFO L85 PathProgramCache]: Analyzing trace with hash 183689538, now seen corresponding path program 1 times [2025-03-16 19:31:10,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:10,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538567407] [2025-03-16 19:31:10,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:10,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:10,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:31:10,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:31:10,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:10,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:11,046 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 72 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 19:31:11,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:11,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538567407] [2025-03-16 19:31:11,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538567407] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:31:11,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017660079] [2025-03-16 19:31:11,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:11,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:31:11,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:31:11,050 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-16 19:31:11,052 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-16 19:31:11,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:31:11,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:31:11,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:11,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:11,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 19:31:11,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:31:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 34 proven. 46 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 19:31:11,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:31:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 34 proven. 46 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 19:31:11,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017660079] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:31:11,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:31:11,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-16 19:31:11,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717249740] [2025-03-16 19:31:11,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:31:11,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:31:11,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:11,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:31:11,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:31:11,475 INFO L87 Difference]: Start difference. First operand 101267 states and 134560 transitions. Second operand has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 14 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:11,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:11,889 INFO L93 Difference]: Finished difference Result 168467 states and 222302 transitions. [2025-03-16 19:31:11,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:31:11,890 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 14 states have internal predecessors, (258), 0 states have call successors, (0), 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 105 [2025-03-16 19:31:11,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:11,978 INFO L225 Difference]: With dead ends: 168467 [2025-03-16 19:31:11,978 INFO L226 Difference]: Without dead ends: 93705 [2025-03-16 19:31:12,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:31:12,028 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 265 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:12,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 415 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:31:12,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93705 states. [2025-03-16 19:31:12,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93705 to 88345. [2025-03-16 19:31:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88345 states, 88344 states have (on average 1.317350357692656) internal successors, (116380), 88344 states have internal predecessors, (116380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:12,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88345 states to 88345 states and 116380 transitions. [2025-03-16 19:31:12,763 INFO L78 Accepts]: Start accepts. Automaton has 88345 states and 116380 transitions. Word has length 105 [2025-03-16 19:31:12,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:12,763 INFO L471 AbstractCegarLoop]: Abstraction has 88345 states and 116380 transitions. [2025-03-16 19:31:12,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 14 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:12,763 INFO L276 IsEmpty]: Start isEmpty. Operand 88345 states and 116380 transitions. [2025-03-16 19:31:12,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 19:31:12,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:12,766 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:12,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 19:31:12,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:31:12,967 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:31:12,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:12,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1614387584, now seen corresponding path program 1 times [2025-03-16 19:31:12,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:12,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360304253] [2025-03-16 19:31:12,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:12,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:12,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:31:12,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:31:12,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:12,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 19:31:13,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:13,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360304253] [2025-03-16 19:31:13,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360304253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:13,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:13,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:31:13,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000800889] [2025-03-16 19:31:13,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:13,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:31:13,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:13,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:31:13,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:31:13,043 INFO L87 Difference]: Start difference. First operand 88345 states and 116380 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:13,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:13,282 INFO L93 Difference]: Finished difference Result 135654 states and 178651 transitions. [2025-03-16 19:31:13,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:31:13,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 105 [2025-03-16 19:31:13,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:13,327 INFO L225 Difference]: With dead ends: 135654 [2025-03-16 19:31:13,327 INFO L226 Difference]: Without dead ends: 47412 [2025-03-16 19:31:13,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:31:13,371 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 29 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:13,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 147 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:31:13,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47412 states. [2025-03-16 19:31:13,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47412 to 47410. [2025-03-16 19:31:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47410 states, 47409 states have (on average 1.2936362294079182) internal successors, (61330), 47409 states have internal predecessors, (61330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47410 states to 47410 states and 61330 transitions. [2025-03-16 19:31:13,974 INFO L78 Accepts]: Start accepts. Automaton has 47410 states and 61330 transitions. Word has length 105 [2025-03-16 19:31:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:13,974 INFO L471 AbstractCegarLoop]: Abstraction has 47410 states and 61330 transitions. [2025-03-16 19:31:13,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:13,974 INFO L276 IsEmpty]: Start isEmpty. Operand 47410 states and 61330 transitions. [2025-03-16 19:31:13,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 19:31:13,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:13,976 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:13,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:31:13,976 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:31:13,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:13,977 INFO L85 PathProgramCache]: Analyzing trace with hash -284698900, now seen corresponding path program 1 times [2025-03-16 19:31:13,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:13,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401761070] [2025-03-16 19:31:13,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:13,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:13,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:31:13,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:31:13,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:13,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 30 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:14,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:14,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401761070] [2025-03-16 19:31:14,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401761070] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:31:14,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211793815] [2025-03-16 19:31:14,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:14,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:31:14,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:31:14,530 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-16 19:31:14,532 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-16 19:31:14,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:31:14,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:31:14,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:14,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:14,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-16 19:31:14,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:31:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 30 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:16,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:31:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 30 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:17,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211793815] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:31:17,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:31:17,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 20] total 56 [2025-03-16 19:31:17,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268770520] [2025-03-16 19:31:17,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:31:17,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-16 19:31:17,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:17,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-16 19:31:17,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=2814, Unknown=0, NotChecked=0, Total=3080 [2025-03-16 19:31:17,493 INFO L87 Difference]: Start difference. First operand 47410 states and 61330 transitions. Second operand has 56 states, 56 states have (on average 5.0) internal successors, (280), 56 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)