./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-798a7b3-m [2025-03-03 14:42:03,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:42:03,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:42:03,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:42:03,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:42:03,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:42:03,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:42:03,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:42:03,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:42:03,136 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:42:03,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:42:03,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:42:03,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:42:03,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:42:03,137 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:42:03,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:42:03,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:42:03,137 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:42:03,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:42:03,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:42:03,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:42:03,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:42:03,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:42:03,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:42:03,138 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:42:03,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:42:03,138 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:42:03,138 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:42:03,138 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:42:03,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:42:03,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:42:03,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:42:03,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:42:03,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:42:03,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:42:03,138 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:42:03,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:42:03,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:42:03,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:42:03,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:42:03,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:42:03,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:42:03,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:42:03,140 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-03 14:42:03,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:42:03,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:42:03,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:42:03,348 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:42:03,349 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:42:03,350 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-03 14:42:04,456 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/934444e29/ed25a92dd5134cfba5e3552dbd38dbb5/FLAG0bac38eec [2025-03-03 14:42:04,690 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:42:04,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c [2025-03-03 14:42:04,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/934444e29/ed25a92dd5134cfba5e3552dbd38dbb5/FLAG0bac38eec [2025-03-03 14:42:05,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/934444e29/ed25a92dd5134cfba5e3552dbd38dbb5 [2025-03-03 14:42:05,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:42:05,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:42:05,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:42:05,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:42:05,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:42:05,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:42:05" (1/1) ... [2025-03-03 14:42:05,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@758a5265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:05, skipping insertion in model container [2025-03-03 14:42:05,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:42:05" (1/1) ... [2025-03-03 14:42:05,044 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:42:05,142 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-03 14:42:05,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:42:05,166 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:42:05,174 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-03 14:42:05,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:42:05,194 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:42:05,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:05 WrapperNode [2025-03-03 14:42:05,196 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:42:05,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:42:05,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:42:05,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:42:05,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:05" (1/1) ... [2025-03-03 14:42:05,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:05" (1/1) ... [2025-03-03 14:42:05,218 INFO L138 Inliner]: procedures = 24, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 39 [2025-03-03 14:42:05,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:42:05,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:42:05,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:42:05,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:42:05,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:05" (1/1) ... [2025-03-03 14:42:05,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:05" (1/1) ... [2025-03-03 14:42:05,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:05" (1/1) ... [2025-03-03 14:42:05,243 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-03 14:42:05,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:05" (1/1) ... [2025-03-03 14:42:05,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:05" (1/1) ... [2025-03-03 14:42:05,250 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:05" (1/1) ... [2025-03-03 14:42:05,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:05" (1/1) ... [2025-03-03 14:42:05,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:05" (1/1) ... [2025-03-03 14:42:05,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:05" (1/1) ... [2025-03-03 14:42:05,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:42:05,261 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:42:05,261 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:42:05,261 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:42:05,262 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:05" (1/1) ... [2025-03-03 14:42:05,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:42:05,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:42:05,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:42:05,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:42:05,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 14:42:05,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 14:42:05,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:42:05,307 INFO L130 BoogieDeclarations]: Found specification of procedure max [2025-03-03 14:42:05,307 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2025-03-03 14:42:05,307 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2025-03-03 14:42:05,307 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2025-03-03 14:42:05,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:42:05,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:42:05,307 INFO L130 BoogieDeclarations]: Found specification of procedure check [2025-03-03 14:42:05,307 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2025-03-03 14:42:05,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 14:42:05,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 14:42:05,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 14:42:05,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 14:42:05,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 14:42:05,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:42:05,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:42:05,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 14:42:05,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 14:42:05,367 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:42:05,369 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:42:05,429 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L38: havoc ~a~0, ~b~0, ~c~0; [2025-03-03 14:42:05,458 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26: havoc ~n~0.base, ~n~0.offset; [2025-03-03 14:42:05,523 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-03 14:42:05,523 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:42:05,531 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:42:05,532 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:42:05,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:42:05 BoogieIcfgContainer [2025-03-03 14:42:05,532 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:42:05,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:42:05,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:42:05,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:42:05,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:42:05" (1/3) ... [2025-03-03 14:42:05,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7edef683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:42:05, skipping insertion in model container [2025-03-03 14:42:05,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:42:05" (2/3) ... [2025-03-03 14:42:05,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7edef683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:42:05, skipping insertion in model container [2025-03-03 14:42:05,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:42:05" (3/3) ... [2025-03-03 14:42:05,540 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_max.c [2025-03-03 14:42:05,550 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:42:05,552 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-03 14:42:05,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:42:05,600 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;@7269abc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:42:05,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:42:05,603 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-03 14:42:05,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 14:42:05,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:05,609 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-03 14:42:05,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:05,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:05,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2011023373, now seen corresponding path program 1 times [2025-03-03 14:42:05,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:05,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945330383] [2025-03-03 14:42:05,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:05,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:05,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 14:42:05,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 14:42:05,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:05,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:42:05,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:05,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945330383] [2025-03-03 14:42:05,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945330383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:05,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:05,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:42:05,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717577082] [2025-03-03 14:42:05,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:05,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:42:05,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:05,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:42:05,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:42:05,962 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-03 14:42:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:06,029 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2025-03-03 14:42:06,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:42:06,030 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-03 14:42:06,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:06,035 INFO L225 Difference]: With dead ends: 70 [2025-03-03 14:42:06,035 INFO L226 Difference]: Without dead ends: 36 [2025-03-03 14:42:06,037 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-03 14:42:06,039 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-03 14:42:06,039 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-03 14:42:06,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-03 14:42:06,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-03 14:42:06,059 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-03 14:42:06,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2025-03-03 14:42:06,064 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 19 [2025-03-03 14:42:06,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:06,065 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2025-03-03 14:42:06,065 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-03 14:42:06,065 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2025-03-03 14:42:06,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 14:42:06,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:06,066 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-03 14:42:06,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:42:06,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:06,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:06,067 INFO L85 PathProgramCache]: Analyzing trace with hash 962335769, now seen corresponding path program 1 times [2025-03-03 14:42:06,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:06,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714258674] [2025-03-03 14:42:06,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:06,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:06,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 14:42:06,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 14:42:06,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:06,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:06,264 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-03 14:42:06,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:06,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714258674] [2025-03-03 14:42:06,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714258674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:06,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:06,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:42:06,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26363660] [2025-03-03 14:42:06,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:06,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:42:06,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:06,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:42:06,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:42:06,266 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-03 14:42:06,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:06,339 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2025-03-03 14:42:06,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:42:06,342 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-03 14:42:06,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:06,343 INFO L225 Difference]: With dead ends: 49 [2025-03-03 14:42:06,343 INFO L226 Difference]: Without dead ends: 38 [2025-03-03 14:42:06,343 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-03 14:42:06,343 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:06,343 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.1s Time] [2025-03-03 14:42:06,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-03 14:42:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-03 14:42:06,350 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-03 14:42:06,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2025-03-03 14:42:06,353 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 31 [2025-03-03 14:42:06,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:06,353 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2025-03-03 14:42:06,353 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-03 14:42:06,353 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2025-03-03 14:42:06,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 14:42:06,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:06,355 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-03 14:42:06,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:42:06,355 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:06,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:06,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1054280889, now seen corresponding path program 1 times [2025-03-03 14:42:06,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:06,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330263321] [2025-03-03 14:42:06,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:06,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:06,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 14:42:06,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 14:42:06,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:06,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:06,906 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-03 14:42:06,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:06,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330263321] [2025-03-03 14:42:06,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330263321] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:42:06,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789567046] [2025-03-03 14:42:06,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:06,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:42:06,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:42:06,910 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:42:06,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:42:06,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 14:42:06,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 14:42:06,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:06,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:06,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-03 14:42:07,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:42:07,062 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-03 14:42:07,264 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-03 14:42:07,286 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-03 14:42:07,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:42:07,501 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-03 14:42:07,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789567046] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:42:07,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:42:07,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 10] total 23 [2025-03-03 14:42:07,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359950877] [2025-03-03 14:42:07,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:42:07,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 14:42:07,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:07,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 14:42:07,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2025-03-03 14:42:07,503 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-03 14:42:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:07,890 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2025-03-03 14:42:07,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 14:42:07,891 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-03 14:42:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:07,892 INFO L225 Difference]: With dead ends: 47 [2025-03-03 14:42:07,892 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 14:42:07,893 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-03 14:42:07,893 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-03 14:42:07,893 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-03 14:42:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 14:42:07,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2025-03-03 14:42:07,900 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-03 14:42:07,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2025-03-03 14:42:07,901 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 44 [2025-03-03 14:42:07,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:07,901 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2025-03-03 14:42:07,902 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-03 14:42:07,902 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2025-03-03 14:42:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 14:42:07,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:07,905 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-03 14:42:07,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:42:08,105 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-03 14:42:08,106 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:08,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:08,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1494717056, now seen corresponding path program 1 times [2025-03-03 14:42:08,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:08,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384656096] [2025-03-03 14:42:08,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:08,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:08,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 14:42:08,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 14:42:08,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:08,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:08,711 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-03 14:42:08,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:08,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384656096] [2025-03-03 14:42:08,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384656096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:42:08,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227008170] [2025-03-03 14:42:08,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:08,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:42:08,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:42:08,714 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:42:08,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:42:08,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 14:42:08,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 14:42:08,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:08,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:08,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-03 14:42:08,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:42:08,834 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-03 14:42:08,837 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-03 14:42:08,898 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-03 14:42:08,905 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-03 14:42:09,246 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-03 14:42:09,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:42:09,527 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-03 14:42:09,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227008170] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:42:09,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:42:09,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 14] total 29 [2025-03-03 14:42:09,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030071091] [2025-03-03 14:42:09,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:42:09,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 14:42:09,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:09,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 14:42:09,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2025-03-03 14:42:09,529 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-03 14:42:10,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:10,569 INFO L93 Difference]: Finished difference Result 114 states and 155 transitions. [2025-03-03 14:42:10,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 14:42:10,570 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-03 14:42:10,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:10,571 INFO L225 Difference]: With dead ends: 114 [2025-03-03 14:42:10,571 INFO L226 Difference]: Without dead ends: 100 [2025-03-03 14:42:10,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=281, Invalid=2581, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 14:42:10,573 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 170 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:10,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 272 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:42:10,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-03 14:42:10,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2025-03-03 14:42:10,591 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-03 14:42:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 126 transitions. [2025-03-03 14:42:10,594 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 126 transitions. Word has length 50 [2025-03-03 14:42:10,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:10,595 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 126 transitions. [2025-03-03 14:42:10,595 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-03 14:42:10,595 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 126 transitions. [2025-03-03 14:42:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 14:42:10,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:10,598 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-03 14:42:10,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:42:10,798 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-03 14:42:10,799 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:10,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:10,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1406982561, now seen corresponding path program 1 times [2025-03-03 14:42:10,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:10,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451944116] [2025-03-03 14:42:10,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:10,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:10,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 14:42:10,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 14:42:10,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:10,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:11,162 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-03 14:42:11,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:11,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451944116] [2025-03-03 14:42:11,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451944116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:42:11,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014777790] [2025-03-03 14:42:11,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:11,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:42:11,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:42:11,165 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:42:11,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:42:11,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 14:42:11,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 14:42:11,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:11,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:11,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-03 14:42:11,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:42:11,259 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-03 14:42:11,264 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-03 14:42:11,506 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-03 14:42:11,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:42:11,616 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-03 14:42:11,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014777790] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:42:11,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:42:11,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 20 [2025-03-03 14:42:11,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328116105] [2025-03-03 14:42:11,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:42:11,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 14:42:11,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:11,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 14:42:11,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:42:11,618 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-03 14:42:11,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:11,915 INFO L93 Difference]: Finished difference Result 150 states and 207 transitions. [2025-03-03 14:42:11,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:42:11,916 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-03 14:42:11,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:11,917 INFO L225 Difference]: With dead ends: 150 [2025-03-03 14:42:11,917 INFO L226 Difference]: Without dead ends: 107 [2025-03-03 14:42:11,918 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-03 14:42:11,918 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-03 14:42:11,918 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-03 14:42:11,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-03 14:42:11,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2025-03-03 14:42:11,928 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-03 14:42:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2025-03-03 14:42:11,929 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 50 [2025-03-03 14:42:11,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:11,929 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2025-03-03 14:42:11,929 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-03 14:42:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2025-03-03 14:42:11,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 14:42:11,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:11,933 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-03 14:42:11,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:42:12,135 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-03 14:42:12,135 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:12,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:12,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1738761835, now seen corresponding path program 2 times [2025-03-03 14:42:12,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:12,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316500441] [2025-03-03 14:42:12,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:42:12,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:12,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-03 14:42:12,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 14:42:12,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:42:12,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:12,539 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-03 14:42:12,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:12,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316500441] [2025-03-03 14:42:12,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316500441] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:42:12,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031127132] [2025-03-03 14:42:12,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:42:12,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:42:12,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:42:12,542 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:42:12,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:42:12,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-03 14:42:12,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 14:42:12,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:42:12,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:12,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-03 14:42:12,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:42:12,667 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-03 14:42:12,828 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-03 14:42:12,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:42:13,119 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-03 14:42:13,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031127132] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:42:13,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:42:13,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 30 [2025-03-03 14:42:13,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474717111] [2025-03-03 14:42:13,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:42:13,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 14:42:13,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:13,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 14:42:13,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2025-03-03 14:42:13,122 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-03 14:42:17,134 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-03 14:42:21,152 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-03 14:42:25,166 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-03 14:42:29,349 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-03 14:42:33,372 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-03 14:42:33,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:33,593 INFO L93 Difference]: Finished difference Result 153 states and 215 transitions. [2025-03-03 14:42:33,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 14:42:33,595 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-03 14:42:33,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:33,596 INFO L225 Difference]: With dead ends: 153 [2025-03-03 14:42:33,598 INFO L226 Difference]: Without dead ends: 132 [2025-03-03 14:42:33,599 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-03 14:42:33,599 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-03 14:42:33,599 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-03 14:42:33,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-03 14:42:33,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 106. [2025-03-03 14:42:33,615 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-03 14:42:33,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2025-03-03 14:42:33,617 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 62 [2025-03-03 14:42:33,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:33,619 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2025-03-03 14:42:33,619 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-03 14:42:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2025-03-03 14:42:33,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 14:42:33,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:33,621 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-03 14:42:33,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:42:33,821 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-03 14:42:33,821 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:33,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:33,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1436131177, now seen corresponding path program 3 times [2025-03-03 14:42:33,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:33,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114786492] [2025-03-03 14:42:33,822 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:42:33,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:33,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 5 equivalence classes. [2025-03-03 14:42:33,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:42:33,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 14:42:33,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:35,245 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-03 14:42:35,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:35,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114786492] [2025-03-03 14:42:35,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114786492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:42:35,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609941432] [2025-03-03 14:42:35,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:42:35,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:42:35,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:42:35,249 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:42:35,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:42:35,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 5 equivalence classes. [2025-03-03 14:42:35,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:42:35,365 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 14:42:35,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:35,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-03-03 14:42:35,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:42:35,375 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-03 14:42:35,517 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-03 14:42:35,517 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-03 14:42:35,550 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-03 14:42:35,554 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-03 14:42:35,556 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-03 14:42:36,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 14:42:36,755 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-03 14:42:36,764 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 14:42:36,764 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-03 14:42:36,897 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-03 14:42:36,931 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-03 14:42:36,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:42:38,028 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-03 14:42:38,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609941432] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:42:38,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:42:38,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 23] total 76 [2025-03-03 14:42:38,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744563772] [2025-03-03 14:42:38,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:42:38,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-03-03 14:42:38,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:38,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-03-03 14:42:38,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=5428, Unknown=0, NotChecked=0, Total=5700 [2025-03-03 14:42:38,031 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-03 14:42:42,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:42,255 INFO L93 Difference]: Finished difference Result 310 states and 490 transitions. [2025-03-03 14:42:42,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-03 14:42:42,256 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-03 14:42:42,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:42,258 INFO L225 Difference]: With dead ends: 310 [2025-03-03 14:42:42,258 INFO L226 Difference]: Without dead ends: 308 [2025-03-03 14:42:42,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 116 SyntacticMatches, 5 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5464 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1134, Invalid=18326, Unknown=0, NotChecked=0, Total=19460 [2025-03-03 14:42:42,264 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 149 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 5092 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:42,264 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.3s Time] [2025-03-03 14:42:42,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-03 14:42:42,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 213. [2025-03-03 14:42:42,297 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-03 14:42:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 352 transitions. [2025-03-03 14:42:42,298 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 352 transitions. Word has length 75 [2025-03-03 14:42:42,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:42,299 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 352 transitions. [2025-03-03 14:42:42,299 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-03 14:42:42,299 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 352 transitions. [2025-03-03 14:42:42,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:42:42,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:42,301 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-03 14:42:42,307 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-03 14:42:42,501 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-03 14:42:42,501 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:42,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:42,501 INFO L85 PathProgramCache]: Analyzing trace with hash -84939697, now seen corresponding path program 1 times [2025-03-03 14:42:42,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:42,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086264910] [2025-03-03 14:42:42,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:42,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:42,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:42:42,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:42:42,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:42,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:43,412 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-03 14:42:43,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:43,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086264910] [2025-03-03 14:42:43,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086264910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:42:43,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768561344] [2025-03-03 14:42:43,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:43,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:42:43,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:42:43,414 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:42:43,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:42:43,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:42:43,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:42:43,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:43,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:43,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-03 14:42:43,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:42:43,548 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-03 14:42:43,551 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-03 14:42:44,358 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-03 14:42:44,471 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-03 14:42:44,505 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-03 14:42:44,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:42:45,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 14:42:45,147 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-03 14:42:45,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768561344] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:42:45,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:42:45,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30] total 53 [2025-03-03 14:42:45,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619935635] [2025-03-03 14:42:45,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:42:45,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-03 14:42:45,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:45,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-03 14:42:45,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=4207, Unknown=0, NotChecked=0, Total=4422 [2025-03-03 14:42:45,414 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-03 14:42:47,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:47,008 INFO L93 Difference]: Finished difference Result 472 states and 886 transitions. [2025-03-03 14:42:47,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-03 14:42:47,008 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-03 14:42:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:47,010 INFO L225 Difference]: With dead ends: 472 [2025-03-03 14:42:47,010 INFO L226 Difference]: Without dead ends: 316 [2025-03-03 14:42:47,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1990 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=453, Invalid=7919, Unknown=0, NotChecked=0, Total=8372 [2025-03-03 14:42:47,014 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 52 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:47,014 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.8s Time] [2025-03-03 14:42:47,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-03 14:42:47,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 249. [2025-03-03 14:42:47,044 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-03 14:42:47,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 424 transitions. [2025-03-03 14:42:47,046 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 424 transitions. Word has length 76 [2025-03-03 14:42:47,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:47,046 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 424 transitions. [2025-03-03 14:42:47,046 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-03 14:42:47,047 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 424 transitions. [2025-03-03 14:42:47,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:42:47,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:47,049 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-03 14:42:47,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:42:47,253 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-03 14:42:47,253 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:47,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:47,253 INFO L85 PathProgramCache]: Analyzing trace with hash -553158831, now seen corresponding path program 1 times [2025-03-03 14:42:47,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:47,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812628698] [2025-03-03 14:42:47,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:47,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:47,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:42:47,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:42:47,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:47,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:47,325 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-03 14:42:47,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:47,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812628698] [2025-03-03 14:42:47,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812628698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:47,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:47,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:42:47,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627907404] [2025-03-03 14:42:47,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:47,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:42:47,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:47,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:42:47,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:42:47,327 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-03 14:42:47,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:47,377 INFO L93 Difference]: Finished difference Result 449 states and 866 transitions. [2025-03-03 14:42:47,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:42:47,378 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-03 14:42:47,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:47,380 INFO L225 Difference]: With dead ends: 449 [2025-03-03 14:42:47,380 INFO L226 Difference]: Without dead ends: 257 [2025-03-03 14:42:47,381 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-03 14:42:47,381 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-03 14:42:47,382 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-03 14:42:47,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-03 14:42:47,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 249. [2025-03-03 14:42:47,405 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-03 14:42:47,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 422 transitions. [2025-03-03 14:42:47,407 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 422 transitions. Word has length 76 [2025-03-03 14:42:47,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:47,408 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 422 transitions. [2025-03-03 14:42:47,408 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-03 14:42:47,408 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 422 transitions. [2025-03-03 14:42:47,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:42:47,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:47,417 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-03 14:42:47,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:42:47,418 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:47,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:47,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2052864723, now seen corresponding path program 2 times [2025-03-03 14:42:47,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:47,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84840223] [2025-03-03 14:42:47,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:42:47,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:47,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-03 14:42:47,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:42:47,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:42:47,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:47,553 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-03 14:42:47,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:47,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84840223] [2025-03-03 14:42:47,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84840223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:42:47,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750398585] [2025-03-03 14:42:47,553 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:42:47,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:42:47,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:42:47,556 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:42:47,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:42:47,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-03 14:42:47,656 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:42:47,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:42:47,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:47,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 14:42:47,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:42:47,782 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-03 14:42:47,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:42:48,020 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-03 14:42:48,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750398585] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:42:48,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:42:48,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 20 [2025-03-03 14:42:48,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722174008] [2025-03-03 14:42:48,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:42:48,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 14:42:48,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:48,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 14:42:48,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:42:48,021 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-03 14:42:48,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:48,203 INFO L93 Difference]: Finished difference Result 481 states and 930 transitions. [2025-03-03 14:42:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 14:42:48,204 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-03 14:42:48,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:48,206 INFO L225 Difference]: With dead ends: 481 [2025-03-03 14:42:48,207 INFO L226 Difference]: Without dead ends: 289 [2025-03-03 14:42:48,208 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-03 14:42:48,208 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-03 14:42:48,209 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-03 14:42:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-03 14:42:48,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 275. [2025-03-03 14:42:48,233 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-03 14:42:48,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 474 transitions. [2025-03-03 14:42:48,234 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 474 transitions. Word has length 76 [2025-03-03 14:42:48,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:48,234 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 474 transitions. [2025-03-03 14:42:48,234 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-03 14:42:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 474 transitions. [2025-03-03 14:42:48,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 14:42:48,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:48,237 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-03 14:42:48,244 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-03 14:42:48,437 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-03 14:42:48,438 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:48,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:48,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1161172573, now seen corresponding path program 1 times [2025-03-03 14:42:48,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:48,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939809359] [2025-03-03 14:42:48,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:48,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:48,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 14:42:48,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 14:42:48,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:48,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:49,218 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-03 14:42:49,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:49,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939809359] [2025-03-03 14:42:49,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939809359] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:42:49,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681978457] [2025-03-03 14:42:49,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:49,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:42:49,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:42:49,220 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:42:49,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:42:49,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 14:42:49,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 14:42:49,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:49,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:49,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-03-03 14:42:49,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:42:49,352 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-03 14:42:49,357 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-03 14:42:49,855 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-03 14:42:49,868 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-03 14:42:49,894 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-03 14:42:49,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:42:50,275 INFO L349 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2025-03-03 14:42:50,275 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-03 14:42:50,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681978457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:42:50,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:42:50,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 41 [2025-03-03 14:42:50,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036645050] [2025-03-03 14:42:50,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:42:50,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-03 14:42:50,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:50,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-03 14:42:50,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2690, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 14:42:50,433 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-03 14:42:51,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:51,416 INFO L93 Difference]: Finished difference Result 351 states and 590 transitions. [2025-03-03 14:42:51,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-03 14:42:51,416 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-03 14:42:51,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:51,419 INFO L225 Difference]: With dead ends: 351 [2025-03-03 14:42:51,419 INFO L226 Difference]: Without dead ends: 349 [2025-03-03 14:42:51,420 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-03 14:42:51,420 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 28 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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-03 14:42:51,420 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-03 14:42:51,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-03 14:42:51,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 195. [2025-03-03 14:42:51,458 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-03 14:42:51,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 312 transitions. [2025-03-03 14:42:51,459 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 312 transitions. Word has length 77 [2025-03-03 14:42:51,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:51,459 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 312 transitions. [2025-03-03 14:42:51,460 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-03 14:42:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 312 transitions. [2025-03-03 14:42:51,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 14:42:51,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:51,461 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-03 14:42:51,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 14:42:51,661 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-03 14:42:51,662 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:51,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:51,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1853931045, now seen corresponding path program 1 times [2025-03-03 14:42:51,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:51,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156631621] [2025-03-03 14:42:51,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:51,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:51,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 14:42:51,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 14:42:51,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:51,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:52,434 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-03 14:42:52,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:52,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156631621] [2025-03-03 14:42:52,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156631621] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:42:52,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785409412] [2025-03-03 14:42:52,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:52,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:42:52,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:42:52,437 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-03 14:42:52,437 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-03 14:42:52,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 14:42:52,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 14:42:52,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:52,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:52,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-03-03 14:42:52,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:42:52,568 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-03 14:42:52,570 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-03 14:42:53,465 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-03 14:42:53,569 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-03 14:42:53,596 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-03 14:42:53,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:42:54,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 14:42:54,288 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-03 14:42:54,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785409412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:42:54,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:42:54,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 32] total 55 [2025-03-03 14:42:54,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154439492] [2025-03-03 14:42:54,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:42:54,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-03 14:42:54,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:54,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-03 14:42:54,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=4729, Unknown=0, NotChecked=0, Total=4970 [2025-03-03 14:42:54,778 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-03 14:42:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:56,705 INFO L93 Difference]: Finished difference Result 266 states and 424 transitions. [2025-03-03 14:42:56,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-03 14:42:56,705 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-03 14:42:56,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:56,707 INFO L225 Difference]: With dead ends: 266 [2025-03-03 14:42:56,707 INFO L226 Difference]: Without dead ends: 264 [2025-03-03 14:42:56,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2650 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=557, Invalid=10155, Unknown=0, NotChecked=0, Total=10712 [2025-03-03 14:42:56,710 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-03 14:42:56,710 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-03 14:42:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-03 14:42:56,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 186. [2025-03-03 14:42:56,741 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-03 14:42:56,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 299 transitions. [2025-03-03 14:42:56,742 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 299 transitions. Word has length 77 [2025-03-03 14:42:56,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:56,743 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 299 transitions. [2025-03-03 14:42:56,743 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-03 14:42:56,743 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 299 transitions. [2025-03-03 14:42:56,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 14:42:56,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:56,744 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-03 14:42:56,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 14:42:56,945 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-03 14:42:56,945 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:56,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:56,946 INFO L85 PathProgramCache]: Analyzing trace with hash -574883806, now seen corresponding path program 1 times [2025-03-03 14:42:56,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:56,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402690392] [2025-03-03 14:42:56,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:56,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:56,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 14:42:56,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 14:42:56,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:56,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:57,750 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-03 14:42:57,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:57,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402690392] [2025-03-03 14:42:57,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402690392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:42:57,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18338139] [2025-03-03 14:42:57,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:57,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:42:57,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:42:57,752 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-03 14:42:57,755 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-03 14:42:57,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 14:42:57,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 14:42:57,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:57,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:57,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-03-03 14:42:57,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:42:57,876 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-03 14:42:57,877 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-03 14:42:58,341 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-03 14:42:58,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:43:06,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18338139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:43:06,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:43:06,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18] total 37 [2025-03-03 14:43:06,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046806685] [2025-03-03 14:43:06,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:43:06,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-03 14:43:06,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:06,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-03 14:43:06,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1597, Unknown=2, NotChecked=0, Total=1722 [2025-03-03 14:43:06,675 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-03 14:43:07,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:07,813 INFO L93 Difference]: Finished difference Result 311 states and 518 transitions. [2025-03-03 14:43:07,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 14:43:07,813 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-03 14:43:07,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:07,816 INFO L225 Difference]: With dead ends: 311 [2025-03-03 14:43:07,816 INFO L226 Difference]: Without dead ends: 299 [2025-03-03 14:43:07,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=268, Invalid=3270, Unknown=2, NotChecked=0, Total=3540 [2025-03-03 14:43:07,817 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 71 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:07,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1149 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 14:43:07,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-03 14:43:07,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 262. [2025-03-03 14:43:07,844 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-03 14:43:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 439 transitions. [2025-03-03 14:43:07,845 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 439 transitions. Word has length 81 [2025-03-03 14:43:07,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:07,846 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 439 transitions. [2025-03-03 14:43:07,846 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-03 14:43:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 439 transitions. [2025-03-03 14:43:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 14:43:07,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:07,848 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-03 14:43:07,854 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-03 14:43:08,048 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-03 14:43:08,048 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:08,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:08,048 INFO L85 PathProgramCache]: Analyzing trace with hash -487149311, now seen corresponding path program 4 times [2025-03-03 14:43:08,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:08,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504948578] [2025-03-03 14:43:08,049 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:43:08,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:08,058 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 81 statements into 2 equivalence classes. [2025-03-03 14:43:08,074 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 14:43:08,074 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 14:43:08,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:08,857 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-03 14:43:08,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:08,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504948578] [2025-03-03 14:43:08,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504948578] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:43:08,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81197676] [2025-03-03 14:43:08,857 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:43:08,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:43:08,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:43:08,859 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-03 14:43:08,860 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-03 14:43:08,941 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 81 statements into 2 equivalence classes. [2025-03-03 14:43:08,984 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 14:43:08,984 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 14:43:08,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:08,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-03-03 14:43:08,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:43:09,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 15 treesize of output 1 [2025-03-03 14:43:09,045 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-03 14:43:09,707 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-03 14:43:09,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:43:10,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81197676] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:43:10,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:43:10,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 42 [2025-03-03 14:43:10,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639594073] [2025-03-03 14:43:10,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:43:10,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-03 14:43:10,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:10,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-03 14:43:10,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2486, Unknown=0, NotChecked=0, Total=2652 [2025-03-03 14:43:10,213 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) [2025-03-03 14:43:12,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:12,190 INFO L93 Difference]: Finished difference Result 654 states and 1255 transitions. [2025-03-03 14:43:12,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-03 14:43:12,190 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 81 [2025-03-03 14:43:12,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:12,194 INFO L225 Difference]: With dead ends: 654 [2025-03-03 14:43:12,194 INFO L226 Difference]: Without dead ends: 467 [2025-03-03 14:43:12,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=497, Invalid=6985, Unknown=0, NotChecked=0, Total=7482 [2025-03-03 14:43:12,197 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 115 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 2541 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 2613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:12,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 452 Invalid, 2613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2541 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 14:43:12,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-03 14:43:12,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 384. [2025-03-03 14:43:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 286 states have (on average 1.2062937062937062) internal successors, (345), 279 states have internal predecessors, (345), 48 states have call successors, (48), 29 states have call predecessors, (48), 49 states have return successors, (337), 75 states have call predecessors, (337), 29 states have call successors, (337) [2025-03-03 14:43:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 730 transitions. [2025-03-03 14:43:12,249 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 730 transitions. Word has length 81 [2025-03-03 14:43:12,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:12,249 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 730 transitions. [2025-03-03 14:43:12,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2025-03-03 14:43:12,249 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 730 transitions. [2025-03-03 14:43:12,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 14:43:12,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:12,253 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-03 14:43:12,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 14:43:12,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 14:43:12,454 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:12,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:12,455 INFO L85 PathProgramCache]: Analyzing trace with hash -732111670, now seen corresponding path program 2 times [2025-03-03 14:43:12,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:12,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683595193] [2025-03-03 14:43:12,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:43:12,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:12,465 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-03 14:43:12,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:43:12,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:43:12,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:12,968 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 14:43:12,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:12,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683595193] [2025-03-03 14:43:12,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683595193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:43:12,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799680556] [2025-03-03 14:43:12,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:43:12,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:43:12,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:43:12,970 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:43:12,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 14:43:13,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-03 14:43:13,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:43:13,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:43:13,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:13,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-03-03 14:43:13,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:43:13,269 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 29 treesize of output 17 [2025-03-03 14:43:13,271 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-03 14:43:13,279 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-03 14:43:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-03 14:43:13,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:43:13,620 INFO L349 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2025-03-03 14:43:13,620 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-03 14:43:13,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799680556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:43:13,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:43:13,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 32 [2025-03-03 14:43:13,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609044419] [2025-03-03 14:43:13,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:43:13,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 14:43:13,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:13,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 14:43:13,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 14:43:13,712 INFO L87 Difference]: Start difference. First operand 384 states and 730 transitions. Second operand has 32 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 24 states have internal predecessors, (53), 13 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-03 14:43:14,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:14,235 INFO L93 Difference]: Finished difference Result 435 states and 820 transitions. [2025-03-03 14:43:14,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 14:43:14,235 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 24 states have internal predecessors, (53), 13 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) Word has length 75 [2025-03-03 14:43:14,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:14,238 INFO L225 Difference]: With dead ends: 435 [2025-03-03 14:43:14,238 INFO L226 Difference]: Without dead ends: 433 [2025-03-03 14:43:14,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 88 SyntacticMatches, 10 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=1580, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 14:43:14,239 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 24 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:14,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 572 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:43:14,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-03 14:43:14,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 423. [2025-03-03 14:43:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 315 states have (on average 1.1968253968253968) internal successors, (377), 310 states have internal predecessors, (377), 53 states have call successors, (53), 33 states have call predecessors, (53), 54 states have return successors, (377), 79 states have call predecessors, (377), 29 states have call successors, (377) [2025-03-03 14:43:14,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 807 transitions. [2025-03-03 14:43:14,295 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 807 transitions. Word has length 75 [2025-03-03 14:43:14,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:14,296 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 807 transitions. [2025-03-03 14:43:14,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 24 states have internal predecessors, (53), 13 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-03 14:43:14,296 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 807 transitions. [2025-03-03 14:43:14,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:43:14,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:14,298 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-03 14:43:14,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-03 14:43:14,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 14:43:14,499 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:14,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:14,499 INFO L85 PathProgramCache]: Analyzing trace with hash -243923664, now seen corresponding path program 1 times [2025-03-03 14:43:14,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:14,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270863398] [2025-03-03 14:43:14,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:14,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:14,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:43:14,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:43:14,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:14,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 17 proven. 24 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-03 14:43:15,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:15,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270863398] [2025-03-03 14:43:15,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270863398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:43:15,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288932950] [2025-03-03 14:43:15,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:15,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:43:15,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:43:15,132 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:43:15,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 14:43:15,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:43:15,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:43:15,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:15,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:15,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-03-03 14:43:15,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:43:15,296 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-03 14:43:15,297 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-03 14:43:15,340 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-03 14:43:15,342 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-03 14:43:16,241 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-03 14:43:16,346 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-03 14:43:16,373 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 31 proven. 33 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:43:16,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:43:17,163 INFO L349 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2025-03-03 14:43:17,164 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 47 treesize of output 30 [2025-03-03 14:43:17,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288932950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:43:17,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:43:17,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 33] total 55 [2025-03-03 14:43:17,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498749302] [2025-03-03 14:43:17,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:43:17,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-03 14:43:17,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:17,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-03 14:43:17,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=4894, Unknown=0, NotChecked=0, Total=5112 [2025-03-03 14:43:17,417 INFO L87 Difference]: Start difference. First operand 423 states and 807 transitions. Second operand has 55 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 41 states have internal predecessors, (75), 17 states have call successors, (19), 7 states have call predecessors, (19), 12 states have return successors, (16), 15 states have call predecessors, (16), 13 states have call successors, (16) [2025-03-03 14:43:20,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:20,979 INFO L93 Difference]: Finished difference Result 601 states and 1099 transitions. [2025-03-03 14:43:20,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-03-03 14:43:20,980 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 41 states have internal predecessors, (75), 17 states have call successors, (19), 7 states have call predecessors, (19), 12 states have return successors, (16), 15 states have call predecessors, (16), 13 states have call successors, (16) Word has length 76 [2025-03-03 14:43:20,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:20,983 INFO L225 Difference]: With dead ends: 601 [2025-03-03 14:43:20,983 INFO L226 Difference]: Without dead ends: 599 [2025-03-03 14:43:20,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4457 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=907, Invalid=17183, Unknown=0, NotChecked=0, Total=18090 [2025-03-03 14:43:20,986 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 139 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 3307 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 3307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:20,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 543 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 3307 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 14:43:20,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-03 14:43:21,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 455. [2025-03-03 14:43:21,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 344 states have (on average 1.2005813953488371) internal successors, (413), 339 states have internal predecessors, (413), 54 states have call successors, (54), 34 states have call predecessors, (54), 56 states have return successors, (403), 81 states have call predecessors, (403), 26 states have call successors, (403) [2025-03-03 14:43:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 870 transitions. [2025-03-03 14:43:21,055 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 870 transitions. Word has length 76 [2025-03-03 14:43:21,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:21,056 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 870 transitions. [2025-03-03 14:43:21,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 41 states have internal predecessors, (75), 17 states have call successors, (19), 7 states have call predecessors, (19), 12 states have return successors, (16), 15 states have call predecessors, (16), 13 states have call successors, (16) [2025-03-03 14:43:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 870 transitions. [2025-03-03 14:43:21,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 14:43:21,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:21,060 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-03 14:43:21,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 14:43:21,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 14:43:21,264 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:21,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:21,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1973733958, now seen corresponding path program 1 times [2025-03-03 14:43:21,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:21,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189580140] [2025-03-03 14:43:21,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:21,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:21,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 14:43:21,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 14:43:21,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:21,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:21,784 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 19 proven. 19 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 14:43:21,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:21,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189580140] [2025-03-03 14:43:21,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189580140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:43:21,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247264359] [2025-03-03 14:43:21,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:21,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:43:21,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:43:21,797 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:43:21,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 14:43:21,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 14:43:21,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 14:43:21,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:21,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:21,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-03-03 14:43:21,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:43:21,945 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-03 14:43:21,981 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-03 14:43:23,018 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-03 14:43:23,131 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-03 14:43:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 25 proven. 38 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:43:23,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:43:24,073 INFO L349 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2025-03-03 14:43:24,074 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 47 treesize of output 30 [2025-03-03 14:43:24,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247264359] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:43:24,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:43:24,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 36] total 56 [2025-03-03 14:43:24,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528666655] [2025-03-03 14:43:24,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:43:24,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-03 14:43:24,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:24,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-03 14:43:24,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=5456, Unknown=0, NotChecked=0, Total=5700 [2025-03-03 14:43:24,661 INFO L87 Difference]: Start difference. First operand 455 states and 870 transitions. Second operand has 56 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 42 states have internal predecessors, (73), 17 states have call successors, (19), 7 states have call predecessors, (19), 10 states have return successors, (16), 15 states have call predecessors, (16), 13 states have call successors, (16) [2025-03-03 14:43:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:28,458 INFO L93 Difference]: Finished difference Result 630 states and 1138 transitions. [2025-03-03 14:43:28,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-03-03 14:43:28,458 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 42 states have internal predecessors, (73), 17 states have call successors, (19), 7 states have call predecessors, (19), 10 states have return successors, (16), 15 states have call predecessors, (16), 13 states have call successors, (16) Word has length 77 [2025-03-03 14:43:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:28,462 INFO L225 Difference]: With dead ends: 630 [2025-03-03 14:43:28,462 INFO L226 Difference]: Without dead ends: 628 [2025-03-03 14:43:28,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5114 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1063, Invalid=19529, Unknown=0, NotChecked=0, Total=20592 [2025-03-03 14:43:28,464 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 130 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 3322 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 3391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:28,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 513 Invalid, 3391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3322 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 14:43:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-03-03 14:43:28,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 373. [2025-03-03 14:43:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 282 states have (on average 1.202127659574468) internal successors, (339), 273 states have internal predecessors, (339), 45 states have call successors, (45), 28 states have call predecessors, (45), 45 states have return successors, (309), 71 states have call predecessors, (309), 25 states have call successors, (309) [2025-03-03 14:43:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 693 transitions. [2025-03-03 14:43:28,524 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 693 transitions. Word has length 77 [2025-03-03 14:43:28,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:28,525 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 693 transitions. [2025-03-03 14:43:28,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 42 states have internal predecessors, (73), 17 states have call successors, (19), 7 states have call predecessors, (19), 10 states have return successors, (16), 15 states have call predecessors, (16), 13 states have call successors, (16) [2025-03-03 14:43:28,525 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 693 transitions. [2025-03-03 14:43:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:43:28,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:28,527 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:43:28,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-03 14:43:28,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:43:28,728 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:28,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:28,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1323041419, now seen corresponding path program 3 times [2025-03-03 14:43:28,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:28,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623157153] [2025-03-03 14:43:28,728 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:43:28,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:28,741 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 115 statements into 8 equivalence classes. [2025-03-03 14:43:28,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 105 of 115 statements. [2025-03-03 14:43:28,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 14:43:28,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 41 proven. 117 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 14:43:31,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:31,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623157153] [2025-03-03 14:43:31,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623157153] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:43:31,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833919490] [2025-03-03 14:43:31,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:43:31,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:43:31,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:43:31,795 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:43:31,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 14:43:31,909 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 115 statements into 8 equivalence classes.