./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_max.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/verifythis/tree_max.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 e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:52:02,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:52:02,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:52:02,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:52:02,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:52:02,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:52:02,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:52:02,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:52:02,468 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:52:02,468 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:52:02,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:52:02,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:52:02,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:52:02,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:52:02,469 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:52:02,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:52:02,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:52:02,469 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:52:02,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:52:02,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:52:02,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:52:02,469 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:52:02,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:52:02,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:52:02,469 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:52:02,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:52:02,469 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:52:02,469 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:52:02,469 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:52:02,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:52:02,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:52:02,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:52:02,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:52:02,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:52:02,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:52:02,470 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:52:02,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:52:02,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:52:02,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:52:02,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:52:02,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:52:02,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:52:02,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:52:02,470 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 -> e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c [2025-03-08 05:52:02,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:52:02,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:52:02,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:52:02,702 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:52:02,702 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:52:02,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_max.c [2025-03-08 05:52:03,861 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e8142753/a11e1a8fbc72451a9d94fc0018a19217/FLAG72d5f1990 [2025-03-08 05:52:04,102 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:52:04,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c [2025-03-08 05:52:04,107 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e8142753/a11e1a8fbc72451a9d94fc0018a19217/FLAG72d5f1990 [2025-03-08 05:52:04,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e8142753/a11e1a8fbc72451a9d94fc0018a19217 [2025-03-08 05:52:04,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:52:04,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:52:04,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:52:04,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:52:04,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:52:04,443 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:52:04" (1/1) ... [2025-03-08 05:52:04,444 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7406797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:04, skipping insertion in model container [2025-03-08 05:52:04,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:52:04" (1/1) ... [2025-03-08 05:52:04,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:52:04,545 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/verifythis/tree_max.c[544,557] [2025-03-08 05:52:04,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:52:04,569 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:52:04,576 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/verifythis/tree_max.c[544,557] [2025-03-08 05:52:04,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:52:04,593 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:52:04,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:04 WrapperNode [2025-03-08 05:52:04,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:52:04,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:52:04,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:52:04,596 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:52:04,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:04" (1/1) ... [2025-03-08 05:52:04,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:04" (1/1) ... [2025-03-08 05:52:04,621 INFO L138 Inliner]: procedures = 24, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 39 [2025-03-08 05:52:04,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:52:04,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:52:04,621 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:52:04,621 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:52:04,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:04" (1/1) ... [2025-03-08 05:52:04,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:04" (1/1) ... [2025-03-08 05:52:04,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:04" (1/1) ... [2025-03-08 05:52:04,646 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-08 05:52:04,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:04" (1/1) ... [2025-03-08 05:52:04,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:04" (1/1) ... [2025-03-08 05:52:04,655 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:04" (1/1) ... [2025-03-08 05:52:04,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:04" (1/1) ... [2025-03-08 05:52:04,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:04" (1/1) ... [2025-03-08 05:52:04,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:04" (1/1) ... [2025-03-08 05:52:04,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:52:04,663 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:52:04,663 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:52:04,665 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:52:04,666 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:04" (1/1) ... [2025-03-08 05:52:04,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:52:04,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:04,692 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-08 05:52:04,696 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-08 05:52:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 05:52:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 05:52:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:52:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure max [2025-03-08 05:52:04,716 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2025-03-08 05:52:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2025-03-08 05:52:04,716 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2025-03-08 05:52:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:52:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:52:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure check [2025-03-08 05:52:04,716 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2025-03-08 05:52:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 05:52:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 05:52:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 05:52:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 05:52:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 05:52:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:52:04,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:52:04,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 05:52:04,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 05:52:04,784 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:52:04,785 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:52:04,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L38: havoc ~a~0, ~b~0, ~c~0; [2025-03-08 05:52:04,894 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L26: havoc ~n~0.base, ~n~0.offset; [2025-03-08 05:52:04,955 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-08 05:52:04,956 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:52:04,962 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:52:04,963 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:52:04,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:52:04 BoogieIcfgContainer [2025-03-08 05:52:04,964 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:52:04,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:52:04,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:52:04,969 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:52:04,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:52:04" (1/3) ... [2025-03-08 05:52:04,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50dd21f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:52:04, skipping insertion in model container [2025-03-08 05:52:04,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:04" (2/3) ... [2025-03-08 05:52:04,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50dd21f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:52:04, skipping insertion in model container [2025-03-08 05:52:04,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:52:04" (3/3) ... [2025-03-08 05:52:04,971 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_max.c [2025-03-08 05:52:04,981 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:52:04,982 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_max.c that has 4 procedures, 42 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 05:52:05,017 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:52:05,025 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;@328e59cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:52:05,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:52:05,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 05:52:05,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 05:52:05,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:05,033 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:05,033 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:05,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:05,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2011023373, now seen corresponding path program 1 times [2025-03-08 05:52:05,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:05,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492020972] [2025-03-08 05:52:05,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:05,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:05,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 05:52:05,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 05:52:05,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:05,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:05,393 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-08 05:52:05,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:05,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492020972] [2025-03-08 05:52:05,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492020972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:05,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:05,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:52:05,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220930895] [2025-03-08 05:52:05,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:05,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:52:05,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:05,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:52:05,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:52:05,418 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:52:05,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:05,500 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2025-03-08 05:52:05,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:52:05,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2025-03-08 05:52:05,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:05,506 INFO L225 Difference]: With dead ends: 70 [2025-03-08 05:52:05,506 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 05:52:05,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:52:05,512 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:05,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 284 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:05,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 05:52:05,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-08 05:52:05,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-08 05:52:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2025-03-08 05:52:05,543 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 19 [2025-03-08 05:52:05,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:05,544 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2025-03-08 05:52:05,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:52:05,544 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2025-03-08 05:52:05,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 05:52:05,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:05,547 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 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-08 05:52:05,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:52:05,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:05,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:05,548 INFO L85 PathProgramCache]: Analyzing trace with hash 962335769, now seen corresponding path program 1 times [2025-03-08 05:52:05,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:05,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245337888] [2025-03-08 05:52:05,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:05,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:05,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 05:52:05,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 05:52:05,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:05,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:05,744 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-08 05:52:05,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:05,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245337888] [2025-03-08 05:52:05,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245337888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:05,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:05,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:52:05,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613216435] [2025-03-08 05:52:05,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:05,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:52:05,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:05,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:52:05,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:52:05,747 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 05:52:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:05,794 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2025-03-08 05:52:05,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:52:05,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2025-03-08 05:52:05,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:05,797 INFO L225 Difference]: With dead ends: 49 [2025-03-08 05:52:05,797 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 05:52:05,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:52:05,798 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:05,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 243 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:05,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 05:52:05,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-08 05:52:05,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 28 states have internal predecessors, (30), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-08 05:52:05,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2025-03-08 05:52:05,803 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 31 [2025-03-08 05:52:05,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:05,803 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2025-03-08 05:52:05,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 05:52:05,803 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2025-03-08 05:52:05,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 05:52:05,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:05,808 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-08 05:52:05,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:52:05,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:05,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:05,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1054280889, now seen corresponding path program 1 times [2025-03-08 05:52:05,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:05,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382135808] [2025-03-08 05:52:05,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:05,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:05,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 05:52:05,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 05:52:05,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:05,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:52:06,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:06,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382135808] [2025-03-08 05:52:06,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382135808] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:06,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164301874] [2025-03-08 05:52:06,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:06,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:06,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:06,442 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-08 05:52:06,444 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-08 05:52:06,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 05:52:06,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 05:52:06,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:06,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:06,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-08 05:52:06,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:06,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 05:52:06,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 05:52:06,820 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:52:06,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:52:07,050 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:52:07,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164301874] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:52:07,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:52:07,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 10] total 23 [2025-03-08 05:52:07,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876463507] [2025-03-08 05:52:07,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:52:07,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 05:52:07,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:07,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 05:52:07,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2025-03-08 05:52:07,052 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 23 states, 20 states have (on average 2.1) internal successors, (42), 18 states have internal predecessors, (42), 8 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-08 05:52:07,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:07,455 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2025-03-08 05:52:07,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 05:52:07,456 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.1) internal successors, (42), 18 states have internal predecessors, (42), 8 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) Word has length 44 [2025-03-08 05:52:07,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:07,457 INFO L225 Difference]: With dead ends: 47 [2025-03-08 05:52:07,457 INFO L226 Difference]: Without dead ends: 45 [2025-03-08 05:52:07,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 79 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2025-03-08 05:52:07,458 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 42 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:07,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 184 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:52:07,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-08 05:52:07,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2025-03-08 05:52:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 30 states have internal predecessors, (33), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-08 05:52:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2025-03-08 05:52:07,467 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 44 [2025-03-08 05:52:07,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:07,468 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2025-03-08 05:52:07,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.1) internal successors, (42), 18 states have internal predecessors, (42), 8 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-08 05:52:07,468 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2025-03-08 05:52:07,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 05:52:07,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:07,469 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-08 05:52:07,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:52:07,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:07,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:07,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:07,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1494717056, now seen corresponding path program 1 times [2025-03-08 05:52:07,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:07,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786560330] [2025-03-08 05:52:07,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:07,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:07,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 05:52:07,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 05:52:07,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:07,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:08,310 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 05:52:08,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:08,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786560330] [2025-03-08 05:52:08,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786560330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:08,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479726240] [2025-03-08 05:52:08,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:08,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:08,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:08,314 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-08 05:52:08,316 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-08 05:52:08,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 05:52:08,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 05:52:08,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:08,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:08,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-08 05:52:08,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:08,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 05:52:08,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 05:52:08,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 05:52:08,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 05:52:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:52:08,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:52:09,213 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:52:09,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479726240] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:52:09,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:52:09,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 14] total 29 [2025-03-08 05:52:09,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861462603] [2025-03-08 05:52:09,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:52:09,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 05:52:09,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:09,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 05:52:09,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2025-03-08 05:52:09,215 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 29 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 22 states have internal predecessors, (62), 10 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) [2025-03-08 05:52:10,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:10,340 INFO L93 Difference]: Finished difference Result 114 states and 155 transitions. [2025-03-08 05:52:10,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 05:52:10,340 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 22 states have internal predecessors, (62), 10 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) Word has length 50 [2025-03-08 05:52:10,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:10,342 INFO L225 Difference]: With dead ends: 114 [2025-03-08 05:52:10,342 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 05:52:10,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=281, Invalid=2581, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 05:52:10,346 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 170 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:10,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 272 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:52:10,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 05:52:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2025-03-08 05:52:10,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 63 states have internal predecessors, (74), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (35), 16 states have call predecessors, (35), 13 states have call successors, (35) [2025-03-08 05:52:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 126 transitions. [2025-03-08 05:52:10,358 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 126 transitions. Word has length 50 [2025-03-08 05:52:10,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:10,358 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 126 transitions. [2025-03-08 05:52:10,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 22 states have internal predecessors, (62), 10 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) [2025-03-08 05:52:10,359 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 126 transitions. [2025-03-08 05:52:10,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 05:52:10,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:10,360 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-08 05:52:10,367 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-08 05:52:10,565 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,SelfDestructingSolverStorable3 [2025-03-08 05:52:10,565 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:10,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:10,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1406982561, now seen corresponding path program 1 times [2025-03-08 05:52:10,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:10,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205845502] [2025-03-08 05:52:10,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:10,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:10,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 05:52:10,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 05:52:10,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:10,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:52:10,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:10,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205845502] [2025-03-08 05:52:10,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205845502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:10,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108258654] [2025-03-08 05:52:10,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:10,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:10,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:10,940 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-08 05:52:10,942 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-08 05:52:10,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 05:52:11,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 05:52:11,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:11,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:11,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-08 05:52:11,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:11,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 05:52:11,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 05:52:11,295 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:52:11,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:52:11,417 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:52:11,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108258654] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:52:11,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:52:11,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 20 [2025-03-08 05:52:11,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050825579] [2025-03-08 05:52:11,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:52:11,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:52:11,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:11,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:52:11,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:52:11,420 INFO L87 Difference]: Start difference. First operand 88 states and 126 transitions. Second operand has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 13 states have internal predecessors, (47), 6 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 9 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-08 05:52:11,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:11,699 INFO L93 Difference]: Finished difference Result 150 states and 207 transitions. [2025-03-08 05:52:11,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:52:11,700 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 13 states have internal predecessors, (47), 6 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 9 states have call predecessors, (13), 5 states have call successors, (13) Word has length 50 [2025-03-08 05:52:11,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:11,701 INFO L225 Difference]: With dead ends: 150 [2025-03-08 05:52:11,701 INFO L226 Difference]: Without dead ends: 107 [2025-03-08 05:52:11,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:52:11,702 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 23 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:11,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 490 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:52:11,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-08 05:52:11,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2025-03-08 05:52:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 68 states have internal predecessors, (80), 17 states have call successors, (17), 8 states have call predecessors, (17), 11 states have return successors, (35), 18 states have call predecessors, (35), 12 states have call successors, (35) [2025-03-08 05:52:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2025-03-08 05:52:11,719 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 50 [2025-03-08 05:52:11,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:11,719 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2025-03-08 05:52:11,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 13 states have internal predecessors, (47), 6 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 9 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-08 05:52:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2025-03-08 05:52:11,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 05:52:11,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:11,721 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 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] [2025-03-08 05:52:11,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:52:11,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:11,927 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:11,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:11,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1738761835, now seen corresponding path program 2 times [2025-03-08 05:52:11,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:11,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354776162] [2025-03-08 05:52:11,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:52:11,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:11,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-08 05:52:11,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 05:52:11,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:52:11,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:12,312 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 05:52:12,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:12,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354776162] [2025-03-08 05:52:12,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354776162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:12,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444869669] [2025-03-08 05:52:12,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:52:12,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:12,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:12,315 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-08 05:52:12,316 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-08 05:52:12,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-08 05:52:12,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 05:52:12,405 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:52:12,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:12,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-08 05:52:12,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:12,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 05:52:12,605 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 05:52:12,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:52:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 05:52:12,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444869669] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:52:12,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:52:12,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 30 [2025-03-08 05:52:12,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103234984] [2025-03-08 05:52:12,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:52:12,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 05:52:12,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:12,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 05:52:12,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2025-03-08 05:52:12,876 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 30 states, 25 states have (on average 2.52) internal successors, (63), 26 states have internal predecessors, (63), 13 states have call successors, (20), 3 states have call predecessors, (20), 11 states have return successors, (19), 15 states have call predecessors, (19), 12 states have call successors, (19) [2025-03-08 05:52:16,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 05:52:20,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 05:52:24,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 05:52:29,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 05:52:33,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 05:52:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:33,374 INFO L93 Difference]: Finished difference Result 153 states and 215 transitions. [2025-03-08 05:52:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 05:52:33,374 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.52) internal successors, (63), 26 states have internal predecessors, (63), 13 states have call successors, (20), 3 states have call predecessors, (20), 11 states have return successors, (19), 15 states have call predecessors, (19), 12 states have call successors, (19) Word has length 62 [2025-03-08 05:52:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:33,376 INFO L225 Difference]: With dead ends: 153 [2025-03-08 05:52:33,376 INFO L226 Difference]: Without dead ends: 132 [2025-03-08 05:52:33,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=1250, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 05:52:33,377 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 42 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 14 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:33,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 990 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 651 Invalid, 5 Unknown, 0 Unchecked, 20.3s Time] [2025-03-08 05:52:33,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-08 05:52:33,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 106. [2025-03-08 05:52:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 76 states have internal predecessors, (91), 18 states have call successors, (18), 9 states have call predecessors, (18), 13 states have return successors, (42), 20 states have call predecessors, (42), 13 states have call successors, (42) [2025-03-08 05:52:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2025-03-08 05:52:33,395 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 62 [2025-03-08 05:52:33,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:33,395 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2025-03-08 05:52:33,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.52) internal successors, (63), 26 states have internal predecessors, (63), 13 states have call successors, (20), 3 states have call predecessors, (20), 11 states have return successors, (19), 15 states have call predecessors, (19), 12 states have call successors, (19) [2025-03-08 05:52:33,395 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2025-03-08 05:52:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 05:52:33,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:33,397 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 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] [2025-03-08 05:52:33,419 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-08 05:52:33,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:33,598 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:33,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:33,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1436131177, now seen corresponding path program 3 times [2025-03-08 05:52:33,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:33,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201583727] [2025-03-08 05:52:33,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:52:33,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:33,612 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 5 equivalence classes. [2025-03-08 05:52:33,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 05:52:33,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 05:52:33,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 25 proven. 41 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 05:52:35,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:35,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201583727] [2025-03-08 05:52:35,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201583727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:35,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532270135] [2025-03-08 05:52:35,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:52:35,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:35,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:35,229 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-08 05:52:35,230 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-08 05:52:35,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 5 equivalence classes. [2025-03-08 05:52:35,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 05:52:35,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 05:52:35,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:35,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-03-08 05:52:35,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:35,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 05:52:35,515 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 05:52:35,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 05:52:35,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 05:52:35,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 05:52:35,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 05:52:36,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 05:52:36,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 29 [2025-03-08 05:52:36,948 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 05:52:36,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 05:52:37,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 05:52:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 19 proven. 49 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:52:37,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:52:38,344 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-08 05:52:38,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532270135] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:52:38,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:52:38,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 23] total 76 [2025-03-08 05:52:38,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022921120] [2025-03-08 05:52:38,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:52:38,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-03-08 05:52:38,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:38,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-03-08 05:52:38,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=5428, Unknown=0, NotChecked=0, Total=5700 [2025-03-08 05:52:38,347 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand has 76 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 58 states have internal predecessors, (106), 23 states have call successors, (31), 9 states have call predecessors, (31), 20 states have return successors, (28), 23 states have call predecessors, (28), 18 states have call successors, (28) [2025-03-08 05:52:42,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:42,860 INFO L93 Difference]: Finished difference Result 310 states and 490 transitions. [2025-03-08 05:52:42,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-08 05:52:42,860 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 58 states have internal predecessors, (106), 23 states have call successors, (31), 9 states have call predecessors, (31), 20 states have return successors, (28), 23 states have call predecessors, (28), 18 states have call successors, (28) Word has length 75 [2025-03-08 05:52:42,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:42,863 INFO L225 Difference]: With dead ends: 310 [2025-03-08 05:52:42,863 INFO L226 Difference]: Without dead ends: 308 [2025-03-08 05:52:42,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 116 SyntacticMatches, 5 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5464 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1134, Invalid=18326, Unknown=0, NotChecked=0, Total=19460 [2025-03-08 05:52:42,868 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 149 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 5092 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 5218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 5092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:42,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 774 Invalid, 5218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 5092 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 05:52:42,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-08 05:52:42,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 213. [2025-03-08 05:52:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 150 states have (on average 1.2666666666666666) internal successors, (190), 157 states have internal predecessors, (190), 29 states have call successors, (29), 15 states have call predecessors, (29), 33 states have return successors, (133), 40 states have call predecessors, (133), 21 states have call successors, (133) [2025-03-08 05:52:42,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 352 transitions. [2025-03-08 05:52:42,897 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 352 transitions. Word has length 75 [2025-03-08 05:52:42,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:42,897 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 352 transitions. [2025-03-08 05:52:42,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 58 states have internal predecessors, (106), 23 states have call successors, (31), 9 states have call predecessors, (31), 20 states have return successors, (28), 23 states have call predecessors, (28), 18 states have call successors, (28) [2025-03-08 05:52:42,898 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 352 transitions. [2025-03-08 05:52:42,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 05:52:42,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:42,899 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 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] [2025-03-08 05:52:42,907 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-08 05:52:43,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:43,104 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:43,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:43,104 INFO L85 PathProgramCache]: Analyzing trace with hash -84939697, now seen corresponding path program 1 times [2025-03-08 05:52:43,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:43,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29035039] [2025-03-08 05:52:43,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:43,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:43,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 05:52:43,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:52:43,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:43,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:44,146 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 05:52:44,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:44,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29035039] [2025-03-08 05:52:44,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29035039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:44,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482218158] [2025-03-08 05:52:44,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:44,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:44,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:44,148 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-08 05:52:44,150 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-08 05:52:44,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 05:52:44,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:52:44,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:44,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:44,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-08 05:52:44,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:44,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 05:52:44,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 05:52:45,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 05:52:45,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 05:52:45,472 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 24 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 05:52:45,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:52:46,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 05:52:46,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 38 [2025-03-08 05:52:46,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482218158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:46,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:52:46,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30] total 53 [2025-03-08 05:52:46,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206671521] [2025-03-08 05:52:46,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:52:46,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-08 05:52:46,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:46,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-08 05:52:46,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=4207, Unknown=0, NotChecked=0, Total=4422 [2025-03-08 05:52:46,488 INFO L87 Difference]: Start difference. First operand 213 states and 352 transitions. Second operand has 53 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 38 states have internal predecessors, (72), 16 states have call successors, (19), 6 states have call predecessors, (19), 12 states have return successors, (17), 16 states have call predecessors, (17), 12 states have call successors, (17) [2025-03-08 05:52:48,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:48,176 INFO L93 Difference]: Finished difference Result 472 states and 886 transitions. [2025-03-08 05:52:48,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-08 05:52:48,177 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 38 states have internal predecessors, (72), 16 states have call successors, (19), 6 states have call predecessors, (19), 12 states have return successors, (17), 16 states have call predecessors, (17), 12 states have call successors, (17) Word has length 76 [2025-03-08 05:52:48,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:48,182 INFO L225 Difference]: With dead ends: 472 [2025-03-08 05:52:48,182 INFO L226 Difference]: Without dead ends: 316 [2025-03-08 05:52:48,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1990 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=453, Invalid=7919, Unknown=0, NotChecked=0, Total=8372 [2025-03-08 05:52:48,185 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 52 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:48,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 860 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1822 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 05:52:48,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-08 05:52:48,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 249. [2025-03-08 05:52:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 179 states have (on average 1.2569832402234637) internal successors, (225), 181 states have internal predecessors, (225), 31 states have call successors, (31), 15 states have call predecessors, (31), 38 states have return successors, (168), 52 states have call predecessors, (168), 23 states have call successors, (168) [2025-03-08 05:52:48,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 424 transitions. [2025-03-08 05:52:48,225 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 424 transitions. Word has length 76 [2025-03-08 05:52:48,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:48,226 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 424 transitions. [2025-03-08 05:52:48,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 38 states have internal predecessors, (72), 16 states have call successors, (19), 6 states have call predecessors, (19), 12 states have return successors, (17), 16 states have call predecessors, (17), 12 states have call successors, (17) [2025-03-08 05:52:48,226 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 424 transitions. [2025-03-08 05:52:48,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 05:52:48,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:48,232 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 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] [2025-03-08 05:52:48,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 05:52:48,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:48,437 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:48,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:48,437 INFO L85 PathProgramCache]: Analyzing trace with hash -553158831, now seen corresponding path program 1 times [2025-03-08 05:52:48,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:48,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827680717] [2025-03-08 05:52:48,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:48,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:48,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 05:52:48,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:52:48,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:48,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:48,520 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-08 05:52:48,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:48,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827680717] [2025-03-08 05:52:48,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827680717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:48,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:48,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:52:48,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818895383] [2025-03-08 05:52:48,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:48,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:52:48,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:48,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:52:48,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:52:48,522 INFO L87 Difference]: Start difference. First operand 249 states and 424 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:52:48,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:48,573 INFO L93 Difference]: Finished difference Result 449 states and 866 transitions. [2025-03-08 05:52:48,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:52:48,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 76 [2025-03-08 05:52:48,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:48,576 INFO L225 Difference]: With dead ends: 449 [2025-03-08 05:52:48,576 INFO L226 Difference]: Without dead ends: 257 [2025-03-08 05:52:48,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:52:48,578 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 5 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:48,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 220 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:48,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-08 05:52:48,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 249. [2025-03-08 05:52:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 179 states have (on average 1.2458100558659218) internal successors, (223), 181 states have internal predecessors, (223), 31 states have call successors, (31), 15 states have call predecessors, (31), 38 states have return successors, (168), 52 states have call predecessors, (168), 23 states have call successors, (168) [2025-03-08 05:52:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 422 transitions. [2025-03-08 05:52:48,601 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 422 transitions. Word has length 76 [2025-03-08 05:52:48,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:48,601 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 422 transitions. [2025-03-08 05:52:48,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:52:48,601 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 422 transitions. [2025-03-08 05:52:48,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 05:52:48,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:48,603 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 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] [2025-03-08 05:52:48,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:52:48,604 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:48,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:48,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2052864723, now seen corresponding path program 2 times [2025-03-08 05:52:48,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:48,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593944856] [2025-03-08 05:52:48,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:52:48,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:48,613 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-08 05:52:48,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:52:48,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:52:48,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 05:52:48,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:48,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593944856] [2025-03-08 05:52:48,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593944856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:48,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664395463] [2025-03-08 05:52:48,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:52:48,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:48,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:48,752 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:52:48,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 05:52:48,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-08 05:52:48,860 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:52:48,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:52:48,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:48,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 05:52:48,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 05:52:48,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:52:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 05:52:49,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664395463] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:52:49,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:52:49,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 20 [2025-03-08 05:52:49,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31359738] [2025-03-08 05:52:49,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:52:49,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:52:49,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:49,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:52:49,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:52:49,257 INFO L87 Difference]: Start difference. First operand 249 states and 422 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 14 states have internal predecessors, (42), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (12), 9 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:52:49,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:49,479 INFO L93 Difference]: Finished difference Result 481 states and 930 transitions. [2025-03-08 05:52:49,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 05:52:49,480 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 14 states have internal predecessors, (42), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (12), 9 states have call predecessors, (12), 3 states have call successors, (12) Word has length 76 [2025-03-08 05:52:49,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:49,482 INFO L225 Difference]: With dead ends: 481 [2025-03-08 05:52:49,482 INFO L226 Difference]: Without dead ends: 289 [2025-03-08 05:52:49,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 133 SyntacticMatches, 11 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 05:52:49,484 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 13 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:49,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 509 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:49,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-08 05:52:49,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 275. [2025-03-08 05:52:49,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 198 states have (on average 1.2222222222222223) internal successors, (242), 201 states have internal predecessors, (242), 31 states have call successors, (31), 15 states have call predecessors, (31), 45 states have return successors, (201), 58 states have call predecessors, (201), 23 states have call successors, (201) [2025-03-08 05:52:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 474 transitions. [2025-03-08 05:52:49,508 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 474 transitions. Word has length 76 [2025-03-08 05:52:49,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:49,509 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 474 transitions. [2025-03-08 05:52:49,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 14 states have internal predecessors, (42), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (12), 9 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:52:49,509 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 474 transitions. [2025-03-08 05:52:49,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:52:49,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:49,511 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 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] [2025-03-08 05:52:49,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 05:52:49,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:49,712 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:49,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:49,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1161172573, now seen corresponding path program 1 times [2025-03-08 05:52:49,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:49,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847991401] [2025-03-08 05:52:49,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:49,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:49,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:52:49,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:52:49,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:49,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 30 proven. 14 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-08 05:52:50,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:50,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847991401] [2025-03-08 05:52:50,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847991401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:50,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790291745] [2025-03-08 05:52:50,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:50,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:50,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:50,421 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:52:50,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 05:52:50,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:52:50,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:52:50,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:50,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:50,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-03-08 05:52:50,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:50,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 05:52:50,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 05:52:51,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 05:52:51,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 05:52:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 05:52:51,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:52:51,536 INFO L349 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2025-03-08 05:52:51,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2025-03-08 05:52:51,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790291745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:51,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:52:51,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 41 [2025-03-08 05:52:51,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8142255] [2025-03-08 05:52:51,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:52:51,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-08 05:52:51,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:51,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-08 05:52:51,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2690, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 05:52:51,694 INFO L87 Difference]: Start difference. First operand 275 states and 474 transitions. Second operand has 41 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 30 states have internal predecessors, (67), 14 states have call successors, (18), 5 states have call predecessors, (18), 9 states have return successors, (17), 15 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-08 05:52:52,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:52,626 INFO L93 Difference]: Finished difference Result 351 states and 590 transitions. [2025-03-08 05:52:52,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 05:52:52,627 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 30 states have internal predecessors, (67), 14 states have call successors, (18), 5 states have call predecessors, (18), 9 states have return successors, (17), 15 states have call predecessors, (17), 11 states have call successors, (17) Word has length 77 [2025-03-08 05:52:52,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:52,630 INFO L225 Difference]: With dead ends: 351 [2025-03-08 05:52:52,630 INFO L226 Difference]: Without dead ends: 349 [2025-03-08 05:52:52,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=283, Invalid=4139, Unknown=0, NotChecked=0, Total=4422 [2025-03-08 05:52:52,632 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 28 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:52,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 751 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 05:52:52,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-08 05:52:52,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 195. [2025-03-08 05:52:52,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 141 states have (on average 1.2056737588652482) internal successors, (170), 140 states have internal predecessors, (170), 26 states have call successors, (26), 14 states have call predecessors, (26), 27 states have return successors, (116), 40 states have call predecessors, (116), 18 states have call successors, (116) [2025-03-08 05:52:52,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 312 transitions. [2025-03-08 05:52:52,658 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 312 transitions. Word has length 77 [2025-03-08 05:52:52,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:52,658 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 312 transitions. [2025-03-08 05:52:52,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 30 states have internal predecessors, (67), 14 states have call successors, (18), 5 states have call predecessors, (18), 9 states have return successors, (17), 15 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-08 05:52:52,658 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 312 transitions. [2025-03-08 05:52:52,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:52:52,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:52,660 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 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] [2025-03-08 05:52:52,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 05:52:52,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 05:52:52,861 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:52,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:52,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1853931045, now seen corresponding path program 1 times [2025-03-08 05:52:52,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:52,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418164652] [2025-03-08 05:52:52,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:52,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:52,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:52:52,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:52:52,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:52,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:53,654 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 26 proven. 23 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 05:52:53,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:53,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418164652] [2025-03-08 05:52:53,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418164652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:53,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643922012] [2025-03-08 05:52:53,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:53,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:53,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:53,656 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:52:53,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 05:52:53,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:52:53,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:52:53,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:53,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:53,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-03-08 05:52:53,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:53,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 05:52:53,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 05:52:54,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 05:52:54,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 05:52:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 20 proven. 31 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-08 05:52:54,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:52:55,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 05:52:55,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2025-03-08 05:52:56,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643922012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:56,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:52:56,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 32] total 55 [2025-03-08 05:52:56,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798320969] [2025-03-08 05:52:56,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:52:56,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-08 05:52:56,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:56,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-08 05:52:56,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=4729, Unknown=0, NotChecked=0, Total=4970 [2025-03-08 05:52:56,031 INFO L87 Difference]: Start difference. First operand 195 states and 312 transitions. Second operand has 55 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 39 states have internal predecessors, (73), 16 states have call successors, (19), 6 states have call predecessors, (19), 11 states have return successors, (17), 16 states have call predecessors, (17), 12 states have call successors, (17) [2025-03-08 05:52:57,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:57,979 INFO L93 Difference]: Finished difference Result 266 states and 424 transitions. [2025-03-08 05:52:57,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-08 05:52:57,980 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 39 states have internal predecessors, (73), 16 states have call successors, (19), 6 states have call predecessors, (19), 11 states have return successors, (17), 16 states have call predecessors, (17), 12 states have call successors, (17) Word has length 77 [2025-03-08 05:52:57,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:57,981 INFO L225 Difference]: With dead ends: 266 [2025-03-08 05:52:57,982 INFO L226 Difference]: Without dead ends: 264 [2025-03-08 05:52:57,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2650 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=557, Invalid=10155, Unknown=0, NotChecked=0, Total=10712 [2025-03-08 05:52:57,984 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 59 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 2186 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:57,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 967 Invalid, 2237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2186 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 05:52:57,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-08 05:52:58,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 186. [2025-03-08 05:52:58,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 134 states have (on average 1.2164179104477613) internal successors, (163), 133 states have internal predecessors, (163), 25 states have call successors, (25), 13 states have call predecessors, (25), 26 states have return successors, (111), 39 states have call predecessors, (111), 18 states have call successors, (111) [2025-03-08 05:52:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 299 transitions. [2025-03-08 05:52:58,009 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 299 transitions. Word has length 77 [2025-03-08 05:52:58,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:58,009 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 299 transitions. [2025-03-08 05:52:58,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 39 states have internal predecessors, (73), 16 states have call successors, (19), 6 states have call predecessors, (19), 11 states have return successors, (17), 16 states have call predecessors, (17), 12 states have call successors, (17) [2025-03-08 05:52:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 299 transitions. [2025-03-08 05:52:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 05:52:58,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:58,011 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 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] [2025-03-08 05:52:58,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 05:52:58,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:58,212 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:58,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:58,212 INFO L85 PathProgramCache]: Analyzing trace with hash -574883806, now seen corresponding path program 1 times [2025-03-08 05:52:58,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:58,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728926281] [2025-03-08 05:52:58,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:58,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:58,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 05:52:58,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 05:52:58,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:58,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 31 proven. 27 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-08 05:52:58,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:58,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728926281] [2025-03-08 05:52:58,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728926281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:58,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402223260] [2025-03-08 05:52:58,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:58,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:58,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:58,944 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:52:58,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 05:52:59,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 05:52:59,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 05:52:59,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:59,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:59,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-03-08 05:52:59,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:59,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 05:52:59,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 05:52:59,550 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 21 proven. 26 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-08 05:52:59,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:53:07,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402223260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:53:07,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:53:07,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18] total 37 [2025-03-08 05:53:07,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487455000] [2025-03-08 05:53:07,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:53:07,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-08 05:53:07,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:53:07,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-08 05:53:07,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1597, Unknown=2, NotChecked=0, Total=1722 [2025-03-08 05:53:07,889 INFO L87 Difference]: Start difference. First operand 186 states and 299 transitions. Second operand has 37 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 16 states have call successors, (20), 7 states have call predecessors, (20), 9 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-08 05:53:11,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 05:53:17,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:53:17,574 INFO L93 Difference]: Finished difference Result 311 states and 518 transitions. [2025-03-08 05:53:17,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 05:53:17,575 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 16 states have call successors, (20), 7 states have call predecessors, (20), 9 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) Word has length 81 [2025-03-08 05:53:17,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:53:17,577 INFO L225 Difference]: With dead ends: 311 [2025-03-08 05:53:17,577 INFO L226 Difference]: Without dead ends: 299 [2025-03-08 05:53:17,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=268, Invalid=3270, Unknown=2, NotChecked=0, Total=3540 [2025-03-08 05:53:17,578 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 71 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:53:17,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1149 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1106 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2025-03-08 05:53:17,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-08 05:53:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 262. [2025-03-08 05:53:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 193 states have (on average 1.2124352331606219) internal successors, (234), 192 states have internal predecessors, (234), 32 states have call successors, (32), 20 states have call predecessors, (32), 36 states have return successors, (173), 49 states have call predecessors, (173), 20 states have call successors, (173) [2025-03-08 05:53:17,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 439 transitions. [2025-03-08 05:53:17,608 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 439 transitions. Word has length 81 [2025-03-08 05:53:17,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:53:17,608 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 439 transitions. [2025-03-08 05:53:17,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 16 states have call successors, (20), 7 states have call predecessors, (20), 9 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-08 05:53:17,608 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 439 transitions. [2025-03-08 05:53:17,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 05:53:17,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:53:17,610 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 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] [2025-03-08 05:53:17,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 05:53:17,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 05:53:17,811 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:53:17,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:53:17,811 INFO L85 PathProgramCache]: Analyzing trace with hash -487149311, now seen corresponding path program 4 times [2025-03-08 05:53:17,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:53:17,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931182564] [2025-03-08 05:53:17,811 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:53:17,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:53:17,822 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 81 statements into 2 equivalence classes. [2025-03-08 05:53:17,842 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 05:53:17,842 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 05:53:17,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:53:20,741 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 11 proven. 47 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:53:20,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:53:20,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931182564] [2025-03-08 05:53:20,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931182564] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:53:20,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720146227] [2025-03-08 05:53:20,742 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:53:20,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:53:20,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:53:20,744 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:53:20,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 05:53:20,826 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 81 statements into 2 equivalence classes. [2025-03-08 05:53:20,863 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 05:53:20,864 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 05:53:20,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:53:20,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-03-08 05:53:20,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:53:21,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 05:53:21,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 05:53:25,594 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 05:53:25,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:53:28,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720146227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:53:28,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:53:28,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 42 [2025-03-08 05:53:28,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744701012] [2025-03-08 05:53:28,658 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:53:28,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 05:53:28,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:53:28,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 05:53:28,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2486, Unknown=0, NotChecked=0, Total=2652 [2025-03-08 05:53:28,659 INFO L87 Difference]: Start difference. First operand 262 states and 439 transitions. Second operand has 42 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 32 states have internal predecessors, (79), 15 states have call successors, (20), 8 states have call predecessors, (20), 11 states have return successors, (18), 16 states have call predecessors, (18), 11 states have call successors, (18)