./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s5if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/s5if.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 b618695aa08df106816e7defd71220f009a5c8c09539ff7c8c29235c85f2ce8d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:50:03,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:50:03,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:50:03,300 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:50:03,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:50:03,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:50:03,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:50:03,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:50:03,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:50:03,318 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:50:03,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:50:03,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:50:03,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:50:03,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:50:03,319 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:50:03,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:50:03,319 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:50:03,319 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:50:03,319 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:50:03,319 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:50:03,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:50:03,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:50:03,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:50:03,320 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:50:03,320 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:50:03,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:50:03,320 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:50:03,320 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:50:03,320 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:50:03,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:50:03,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:50:03,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:50:03,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:50:03,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:50:03,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:50:03,321 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:50:03,321 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:50:03,321 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:50:03,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:50:03,321 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:50:03,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:50:03,321 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:50:03,321 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:50:03,321 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 -> b618695aa08df106816e7defd71220f009a5c8c09539ff7c8c29235c85f2ce8d [2025-03-08 00:50:03,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:50:03,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:50:03,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:50:03,532 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:50:03,533 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:50:03,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s5if.c [2025-03-08 00:50:04,605 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a318bc89a/1f4f8c88065541d1822d84284ee941fa/FLAGb19a7d3c5 [2025-03-08 00:50:04,807 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:50:04,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s5if.c [2025-03-08 00:50:04,814 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a318bc89a/1f4f8c88065541d1822d84284ee941fa/FLAGb19a7d3c5 [2025-03-08 00:50:05,166 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a318bc89a/1f4f8c88065541d1822d84284ee941fa [2025-03-08 00:50:05,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:50:05,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:50:05,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:50:05,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:50:05,172 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:50:05,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:50:05" (1/1) ... [2025-03-08 00:50:05,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c42c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:05, skipping insertion in model container [2025-03-08 00:50:05,173 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:50:05" (1/1) ... [2025-03-08 00:50:05,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:50:05,278 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/array-fpi/s5if.c[587,600] [2025-03-08 00:50:05,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:50:05,301 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:50:05,310 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/array-fpi/s5if.c[587,600] [2025-03-08 00:50:05,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:50:05,325 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:50:05,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:05 WrapperNode [2025-03-08 00:50:05,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:50:05,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:50:05,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:50:05,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:50:05,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:05" (1/1) ... [2025-03-08 00:50:05,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:05" (1/1) ... [2025-03-08 00:50:05,350 INFO L138 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2025-03-08 00:50:05,351 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:50:05,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:50:05,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:50:05,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:50:05,356 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:05" (1/1) ... [2025-03-08 00:50:05,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:05" (1/1) ... [2025-03-08 00:50:05,358 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:05" (1/1) ... [2025-03-08 00:50:05,365 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 7, 4, 6]. 37 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 4 writes are split as follows [0, 0, 1, 3]. [2025-03-08 00:50:05,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:05" (1/1) ... [2025-03-08 00:50:05,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:05" (1/1) ... [2025-03-08 00:50:05,369 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:05" (1/1) ... [2025-03-08 00:50:05,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:05" (1/1) ... [2025-03-08 00:50:05,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:05" (1/1) ... [2025-03-08 00:50:05,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:05" (1/1) ... [2025-03-08 00:50:05,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:50:05,373 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:50:05,373 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:50:05,373 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:50:05,373 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:05" (1/1) ... [2025-03-08 00:50:05,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:50:05,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:05,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:50:05,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:50:05,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:50:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:50:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:50:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:50:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 00:50:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:50:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:50:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:50:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:50:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 00:50:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 00:50:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:50:05,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:50:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:50:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:50:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:50:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 00:50:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:50:05,500 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:50:05,501 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:50:05,608 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#sum~0#1.base, main_~#sum~0#1.offset);havoc main_~#sum~0#1.base, main_~#sum~0#1.offset; [2025-03-08 00:50:05,612 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 00:50:05,612 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:50:05,617 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:50:05,618 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:50:05,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:50:05 BoogieIcfgContainer [2025-03-08 00:50:05,618 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:50:05,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:50:05,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:50:05,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:50:05,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:50:05" (1/3) ... [2025-03-08 00:50:05,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540429a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:50:05, skipping insertion in model container [2025-03-08 00:50:05,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:05" (2/3) ... [2025-03-08 00:50:05,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540429a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:50:05, skipping insertion in model container [2025-03-08 00:50:05,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:50:05" (3/3) ... [2025-03-08 00:50:05,625 INFO L128 eAbstractionObserver]: Analyzing ICFG s5if.c [2025-03-08 00:50:05,636 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:50:05,638 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s5if.c that has 1 procedures, 16 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 00:50:05,673 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:50:05,682 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;@18026e32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:50:05,682 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:50:05,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 00:50:05,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:05,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:05,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:05,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:05,694 INFO L85 PathProgramCache]: Analyzing trace with hash -673256721, now seen corresponding path program 1 times [2025-03-08 00:50:05,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:05,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510288207] [2025-03-08 00:50:05,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:05,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:05,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 00:50:05,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 00:50:05,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:05,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:05,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:05,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510288207] [2025-03-08 00:50:05,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510288207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:50:05,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:50:05,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:50:05,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030289857] [2025-03-08 00:50:05,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:50:05,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:50:05,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:05,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:50:05,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:50:05,828 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:05,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:05,837 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2025-03-08 00:50:05,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:50:05,839 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 00:50:05,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:05,843 INFO L225 Difference]: With dead ends: 28 [2025-03-08 00:50:05,843 INFO L226 Difference]: Without dead ends: 12 [2025-03-08 00:50:05,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:50:05,849 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:05,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:50:05,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-08 00:50:05,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-08 00:50:05,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-03-08 00:50:05,883 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2025-03-08 00:50:05,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:05,883 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-03-08 00:50:05,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:05,883 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2025-03-08 00:50:05,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 00:50:05,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:05,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:05,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:50:05,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:05,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:05,886 INFO L85 PathProgramCache]: Analyzing trace with hash -644627570, now seen corresponding path program 1 times [2025-03-08 00:50:05,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:05,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568818681] [2025-03-08 00:50:05,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:05,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:05,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 00:50:05,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 00:50:05,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:05,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:06,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:06,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:06,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568818681] [2025-03-08 00:50:06,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568818681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:50:06,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:50:06,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:50:06,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882985667] [2025-03-08 00:50:06,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:50:06,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:50:06,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:06,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:50:06,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:50:06,007 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:06,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:06,047 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2025-03-08 00:50:06,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:50:06,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 00:50:06,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:06,048 INFO L225 Difference]: With dead ends: 22 [2025-03-08 00:50:06,048 INFO L226 Difference]: Without dead ends: 16 [2025-03-08 00:50:06,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:50:06,049 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:06,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 9 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:50:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-08 00:50:06,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2025-03-08 00:50:06,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:06,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2025-03-08 00:50:06,051 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2025-03-08 00:50:06,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:06,052 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-03-08 00:50:06,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:06,052 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2025-03-08 00:50:06,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 00:50:06,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:06,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:06,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:50:06,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:06,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:06,053 INFO L85 PathProgramCache]: Analyzing trace with hash 380854543, now seen corresponding path program 1 times [2025-03-08 00:50:06,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:06,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045611711] [2025-03-08 00:50:06,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:06,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:06,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 00:50:06,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:50:06,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:06,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:06,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:06,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045611711] [2025-03-08 00:50:06,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045611711] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:06,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273882198] [2025-03-08 00:50:06,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:06,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:06,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:06,502 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:06,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:50:06,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 00:50:06,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:50:06,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:06,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:06,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 00:50:06,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:06,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:50:06,737 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 19 treesize of output 11 [2025-03-08 00:50:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:06,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:06,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:06,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273882198] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:06,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:06,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-08 00:50:06,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805057806] [2025-03-08 00:50:06,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:06,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 00:50:06,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:06,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 00:50:06,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:50:06,900 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:07,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:07,142 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2025-03-08 00:50:07,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:50:07,143 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 00:50:07,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:07,144 INFO L225 Difference]: With dead ends: 26 [2025-03-08 00:50:07,144 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 00:50:07,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2025-03-08 00:50:07,145 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:07,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 40 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:07,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 00:50:07,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2025-03-08 00:50:07,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-03-08 00:50:07,149 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 13 [2025-03-08 00:50:07,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:07,150 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-08 00:50:07,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:07,150 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-03-08 00:50:07,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 00:50:07,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:07,150 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:07,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 00:50:07,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:07,351 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:07,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash 381778064, now seen corresponding path program 1 times [2025-03-08 00:50:07,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:07,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51290897] [2025-03-08 00:50:07,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:07,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:07,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 00:50:07,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:50:07,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:07,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:07,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:07,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:07,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51290897] [2025-03-08 00:50:07,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51290897] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:07,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904842923] [2025-03-08 00:50:07,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:07,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:07,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:07,503 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:07,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:50:07,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 00:50:07,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:50:07,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:07,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:07,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 00:50:07,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:07,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:50:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:07,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:07,603 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 14 treesize of output 12 [2025-03-08 00:50:07,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 12 [2025-03-08 00:50:07,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:07,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904842923] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:07,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:07,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 00:50:07,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547321224] [2025-03-08 00:50:07,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:07,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:50:07,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:07,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:50:07,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:50:07,617 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:07,651 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2025-03-08 00:50:07,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:50:07,651 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 00:50:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:07,652 INFO L225 Difference]: With dead ends: 32 [2025-03-08 00:50:07,652 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 00:50:07,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:50:07,652 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:07,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 30 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:50:07,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 00:50:07,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2025-03-08 00:50:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-08 00:50:07,658 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2025-03-08 00:50:07,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:07,658 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-08 00:50:07,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:07,659 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-03-08 00:50:07,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 00:50:07,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:07,659 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:07,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:07,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 00:50:07,859 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:07,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:07,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1610116533, now seen corresponding path program 2 times [2025-03-08 00:50:07,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:07,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746888905] [2025-03-08 00:50:07,860 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:07,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:07,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-08 00:50:07,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:50:07,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:07,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:07,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:07,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:07,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746888905] [2025-03-08 00:50:07,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746888905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:07,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252625666] [2025-03-08 00:50:07,935 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:07,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:07,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:07,938 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:07,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:50:07,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-08 00:50:07,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:50:07,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:07,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:07,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:50:07,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:08,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:08,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:08,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252625666] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:08,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:08,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 00:50:08,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917552705] [2025-03-08 00:50:08,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:08,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:50:08,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:08,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:50:08,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:50:08,097 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:08,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:08,215 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2025-03-08 00:50:08,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:50:08,215 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 00:50:08,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:08,215 INFO L225 Difference]: With dead ends: 27 [2025-03-08 00:50:08,216 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 00:50:08,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:50:08,216 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:08,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:08,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 00:50:08,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2025-03-08 00:50:08,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:08,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-03-08 00:50:08,220 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2025-03-08 00:50:08,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:08,220 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-03-08 00:50:08,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:08,221 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-03-08 00:50:08,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 00:50:08,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:08,221 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:08,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:08,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:08,421 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:08,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:08,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1147567788, now seen corresponding path program 3 times [2025-03-08 00:50:08,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:08,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956930756] [2025-03-08 00:50:08,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:50:08,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:08,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-03-08 00:50:08,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:50:08,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:50:08,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:08,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:08,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:08,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956930756] [2025-03-08 00:50:08,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956930756] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:08,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868156564] [2025-03-08 00:50:08,500 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:50:08,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:08,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:08,502 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:08,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:50:08,539 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-03-08 00:50:08,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:50:08,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:50:08,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:08,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:50:08,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:08,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:08,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:08,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868156564] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:08,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:08,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 00:50:08,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845597445] [2025-03-08 00:50:08,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:08,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:50:08,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:08,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:50:08,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:50:08,622 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:08,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:08,661 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-03-08 00:50:08,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:50:08,661 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 00:50:08,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:08,662 INFO L225 Difference]: With dead ends: 30 [2025-03-08 00:50:08,662 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 00:50:08,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:50:08,663 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:08,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 21 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:50:08,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 00:50:08,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-08 00:50:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-03-08 00:50:08,666 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2025-03-08 00:50:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:08,666 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-03-08 00:50:08,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-03-08 00:50:08,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:50:08,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:08,667 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:08,673 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-08 00:50:08,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:08,871 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:08,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:08,871 INFO L85 PathProgramCache]: Analyzing trace with hash 905210606, now seen corresponding path program 4 times [2025-03-08 00:50:08,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:08,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924236944] [2025-03-08 00:50:08,871 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:50:08,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:08,879 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-08 00:50:08,887 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:50:08,887 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:50:08,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:09,219 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:09,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:09,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924236944] [2025-03-08 00:50:09,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924236944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:09,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546747449] [2025-03-08 00:50:09,220 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:50:09,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:09,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:09,222 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:09,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:50:09,257 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-08 00:50:09,272 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:50:09,272 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:50:09,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:09,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 00:50:09,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:09,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:50:09,345 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 19 treesize of output 11 [2025-03-08 00:50:09,482 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 19 treesize of output 11 [2025-03-08 00:50:09,503 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 00:50:09,503 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 23 treesize of output 7 [2025-03-08 00:50:09,543 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:09,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:09,712 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 00:50:09,712 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 9 [2025-03-08 00:50:09,856 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:09,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546747449] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:09,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:09,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2025-03-08 00:50:09,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17707757] [2025-03-08 00:50:09,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:09,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 00:50:09,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:09,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 00:50:09,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2025-03-08 00:50:09,858 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:10,649 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2025-03-08 00:50:10,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 00:50:10,650 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 00:50:10,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:10,651 INFO L225 Difference]: With dead ends: 45 [2025-03-08 00:50:10,651 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 00:50:10,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=293, Invalid=1599, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 00:50:10,653 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:10,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 70 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:50:10,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 00:50:10,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2025-03-08 00:50:10,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:10,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-03-08 00:50:10,663 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2025-03-08 00:50:10,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:10,663 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-03-08 00:50:10,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:10,664 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-03-08 00:50:10,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:50:10,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:10,664 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:10,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:10,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:10,865 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:10,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:10,865 INFO L85 PathProgramCache]: Analyzing trace with hash 906134127, now seen corresponding path program 1 times [2025-03-08 00:50:10,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:10,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154999447] [2025-03-08 00:50:10,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:10,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:10,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:50:10,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:50:10,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:10,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:11,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:11,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:11,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154999447] [2025-03-08 00:50:11,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154999447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:11,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623492680] [2025-03-08 00:50:11,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:11,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:11,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:11,052 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:11,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:50:11,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:50:11,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:50:11,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:11,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:11,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 00:50:11,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:11,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:50:11,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:11,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:11,174 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 16 treesize of output 14 [2025-03-08 00:50:11,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 12 [2025-03-08 00:50:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:11,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623492680] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:11,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:11,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-08 00:50:11,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545257820] [2025-03-08 00:50:11,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:11,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:50:11,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:11,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:50:11,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:50:11,197 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:11,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:11,265 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2025-03-08 00:50:11,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:50:11,267 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 00:50:11,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:11,267 INFO L225 Difference]: With dead ends: 56 [2025-03-08 00:50:11,267 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 00:50:11,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:50:11,268 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:11,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 53 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:50:11,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 00:50:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-03-08 00:50:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-08 00:50:11,275 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 17 [2025-03-08 00:50:11,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:11,275 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-08 00:50:11,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:11,275 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-03-08 00:50:11,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 00:50:11,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:11,275 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:11,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:11,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:11,480 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:11,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:11,480 INFO L85 PathProgramCache]: Analyzing trace with hash 116831380, now seen corresponding path program 5 times [2025-03-08 00:50:11,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:11,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047294026] [2025-03-08 00:50:11,480 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:50:11,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:11,486 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 3 equivalence classes. [2025-03-08 00:50:11,496 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 00:50:11,496 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 00:50:11,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:11,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:11,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047294026] [2025-03-08 00:50:11,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047294026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:11,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508484771] [2025-03-08 00:50:11,557 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:50:11,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:11,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:11,559 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:11,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:50:11,603 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 3 equivalence classes. [2025-03-08 00:50:11,617 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 00:50:11,617 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 00:50:11,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:11,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:50:11,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:11,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:11,702 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:11,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508484771] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:11,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:11,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-08 00:50:11,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451825378] [2025-03-08 00:50:11,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:11,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 00:50:11,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:11,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 00:50:11,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:50:11,703 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:11,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:11,832 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2025-03-08 00:50:11,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:50:11,834 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 00:50:11,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:11,834 INFO L225 Difference]: With dead ends: 47 [2025-03-08 00:50:11,834 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 00:50:11,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:50:11,836 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 18 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:11,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 29 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 00:50:11,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2025-03-08 00:50:11,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-08 00:50:11,846 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 18 [2025-03-08 00:50:11,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:11,846 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-08 00:50:11,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:11,847 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-03-08 00:50:11,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 00:50:11,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:11,847 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:11,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:12,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:12,048 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:12,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:12,048 INFO L85 PathProgramCache]: Analyzing trace with hash -851226986, now seen corresponding path program 2 times [2025-03-08 00:50:12,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:12,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9401665] [2025-03-08 00:50:12,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:12,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:12,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 00:50:12,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:50:12,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:12,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:12,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:12,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9401665] [2025-03-08 00:50:12,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9401665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:12,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860069943] [2025-03-08 00:50:12,122 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:12,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:12,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:12,124 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:12,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 00:50:12,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 00:50:12,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:50:12,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:12,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:12,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:50:12,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:12,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:12,278 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:12,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860069943] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:12,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:12,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-08 00:50:12,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703384423] [2025-03-08 00:50:12,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:12,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:50:12,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:12,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:50:12,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:50:12,279 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:12,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:12,341 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2025-03-08 00:50:12,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:50:12,341 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-08 00:50:12,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:12,341 INFO L225 Difference]: With dead ends: 50 [2025-03-08 00:50:12,341 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 00:50:12,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:50:12,342 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:12,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 22 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:50:12,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 00:50:12,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-03-08 00:50:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:12,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-03-08 00:50:12,345 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2025-03-08 00:50:12,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:12,345 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-03-08 00:50:12,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:12,345 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-03-08 00:50:12,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 00:50:12,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:12,345 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:12,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 00:50:12,549 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,SelfDestructingSolverStorable9 [2025-03-08 00:50:12,549 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:12,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:12,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1718469551, now seen corresponding path program 6 times [2025-03-08 00:50:12,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:12,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217851419] [2025-03-08 00:50:12,550 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:50:12,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:12,555 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 4 equivalence classes. [2025-03-08 00:50:12,574 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:50:12,574 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-08 00:50:12,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:12,995 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:12,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:12,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217851419] [2025-03-08 00:50:12,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217851419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:12,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620712301] [2025-03-08 00:50:12,995 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:50:12,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:12,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:12,997 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:12,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 00:50:13,046 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 4 equivalence classes. [2025-03-08 00:50:13,064 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:50:13,065 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-08 00:50:13,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:13,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 00:50:13,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:13,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:50:13,177 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 19 treesize of output 11 [2025-03-08 00:50:13,299 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 19 treesize of output 11 [2025-03-08 00:50:13,461 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-03-08 00:50:13,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 10 [2025-03-08 00:50:13,469 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 19 treesize of output 11 [2025-03-08 00:50:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:13,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:14,004 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-03-08 00:50:14,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 13 [2025-03-08 00:50:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:14,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620712301] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:14,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:14,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 45 [2025-03-08 00:50:14,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43049392] [2025-03-08 00:50:14,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:14,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-08 00:50:14,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:14,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-08 00:50:14,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1776, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 00:50:14,192 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 45 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:14,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:14,871 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-03-08 00:50:14,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 00:50:14,872 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 00:50:14,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:14,872 INFO L225 Difference]: With dead ends: 43 [2025-03-08 00:50:14,872 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 00:50:14,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=397, Invalid=3143, Unknown=0, NotChecked=0, Total=3540 [2025-03-08 00:50:14,874 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:14,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 91 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:50:14,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 00:50:14,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2025-03-08 00:50:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-08 00:50:14,877 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2025-03-08 00:50:14,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:14,877 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-08 00:50:14,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:14,877 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-08 00:50:14,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 00:50:14,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:14,878 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:14,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:15,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:15,079 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:15,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:15,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1719393072, now seen corresponding path program 3 times [2025-03-08 00:50:15,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:15,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603544037] [2025-03-08 00:50:15,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:50:15,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:15,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-03-08 00:50:15,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 21 statements. [2025-03-08 00:50:15,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:50:15,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:50:15,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:15,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603544037] [2025-03-08 00:50:15,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603544037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:15,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771966187] [2025-03-08 00:50:15,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:50:15,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:15,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:15,269 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:15,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 00:50:15,319 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-03-08 00:50:15,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 21 statements. [2025-03-08 00:50:15,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:50:15,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:15,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 00:50:15,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:15,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 15 treesize of output 11 [2025-03-08 00:50:15,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:15,392 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 24 treesize of output 17 [2025-03-08 00:50:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:50:15,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:15,459 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:50:15,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771966187] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:15,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:15,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2025-03-08 00:50:15,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656565381] [2025-03-08 00:50:15,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:15,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 00:50:15,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:15,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 00:50:15,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:50:15,460 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:15,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:15,667 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2025-03-08 00:50:15,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:50:15,667 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 00:50:15,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:15,669 INFO L225 Difference]: With dead ends: 30 [2025-03-08 00:50:15,669 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 00:50:15,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:50:15,669 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 29 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:15,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 30 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:15,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 00:50:15,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-03-08 00:50:15,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-08 00:50:15,677 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2025-03-08 00:50:15,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:15,678 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-08 00:50:15,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:15,678 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-08 00:50:15,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:50:15,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:15,678 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:15,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 00:50:15,878 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,SelfDestructingSolverStorable11 [2025-03-08 00:50:15,879 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:15,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:15,879 INFO L85 PathProgramCache]: Analyzing trace with hash -965436748, now seen corresponding path program 7 times [2025-03-08 00:50:15,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:15,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079565039] [2025-03-08 00:50:15,879 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:50:15,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:15,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:50:15,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:50:15,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:15,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:15,959 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:15,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:15,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079565039] [2025-03-08 00:50:15,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079565039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:15,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205733077] [2025-03-08 00:50:15,960 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:50:15,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:15,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:15,962 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:15,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 00:50:16,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:50:16,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:50:16,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:16,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:16,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 00:50:16,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:16,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:16,121 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:16,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205733077] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:16,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:16,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2025-03-08 00:50:16,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403213698] [2025-03-08 00:50:16,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:16,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:50:16,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:16,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:50:16,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:50:16,123 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:16,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:16,209 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2025-03-08 00:50:16,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:50:16,209 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 00:50:16,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:16,210 INFO L225 Difference]: With dead ends: 49 [2025-03-08 00:50:16,210 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 00:50:16,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:50:16,210 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 24 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:16,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 38 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:16,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 00:50:16,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2025-03-08 00:50:16,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:16,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-03-08 00:50:16,214 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 24 [2025-03-08 00:50:16,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:16,214 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-03-08 00:50:16,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:16,214 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-03-08 00:50:16,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:50:16,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:16,214 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:16,220 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-08 00:50:16,415 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,SelfDestructingSolverStorable12 [2025-03-08 00:50:16,415 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:16,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:16,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1056880050, now seen corresponding path program 8 times [2025-03-08 00:50:16,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:16,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246959760] [2025-03-08 00:50:16,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:16,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:16,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:50:16,425 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:50:16,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:16,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:16,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:16,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246959760] [2025-03-08 00:50:16,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246959760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:16,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281364535] [2025-03-08 00:50:16,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:16,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:16,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:16,879 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-08 00:50:16,880 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-08 00:50:16,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:50:16,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:50:16,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:16,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:16,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-08 00:50:16,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:16,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:50:17,004 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 19 treesize of output 11 [2025-03-08 00:50:17,075 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 19 treesize of output 11 [2025-03-08 00:50:17,157 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 19 treesize of output 11 [2025-03-08 00:50:17,243 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 19 treesize of output 11 [2025-03-08 00:50:17,290 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:17,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:17,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281364535] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:17,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:17,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 43 [2025-03-08 00:50:17,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651127771] [2025-03-08 00:50:17,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:17,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-08 00:50:17,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:17,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-08 00:50:17,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1662, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 00:50:17,744 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 43 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:18,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:18,263 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2025-03-08 00:50:18,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 00:50:18,264 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 00:50:18,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:18,264 INFO L225 Difference]: With dead ends: 47 [2025-03-08 00:50:18,264 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 00:50:18,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=232, Invalid=2524, Unknown=0, NotChecked=0, Total=2756 [2025-03-08 00:50:18,265 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:18,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 97 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:50:18,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 00:50:18,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2025-03-08 00:50:18,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-03-08 00:50:18,282 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25 [2025-03-08 00:50:18,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:18,282 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-03-08 00:50:18,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-03-08 00:50:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:50:18,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:18,283 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:18,289 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-08 00:50:18,487 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,SelfDestructingSolverStorable13 [2025-03-08 00:50:18,487 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:18,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:18,487 INFO L85 PathProgramCache]: Analyzing trace with hash 685930285, now seen corresponding path program 4 times [2025-03-08 00:50:18,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:18,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884284027] [2025-03-08 00:50:18,488 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:50:18,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:18,494 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:50:18,502 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 25 statements. [2025-03-08 00:50:18,503 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:50:18,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:50:18,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:18,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884284027] [2025-03-08 00:50:18,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884284027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:18,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951420572] [2025-03-08 00:50:18,642 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:50:18,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:18,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:18,645 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-08 00:50:18,646 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-08 00:50:18,694 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:50:18,702 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 25 statements. [2025-03-08 00:50:18,703 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:50:18,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:18,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 00:50:18,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:18,710 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 16 treesize of output 12 [2025-03-08 00:50:18,717 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 36 treesize of output 16 [2025-03-08 00:50:18,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:18,753 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 24 treesize of output 17 [2025-03-08 00:50:18,771 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:50:18,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:50:18,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951420572] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:18,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:18,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2025-03-08 00:50:18,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576095464] [2025-03-08 00:50:18,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:18,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:50:18,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:18,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:50:18,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:50:18,817 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:18,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:18,978 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-03-08 00:50:18,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:50:18,978 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 00:50:18,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:18,979 INFO L225 Difference]: With dead ends: 45 [2025-03-08 00:50:18,979 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 00:50:18,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2025-03-08 00:50:18,979 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:18,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 30 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:18,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 00:50:18,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2025-03-08 00:50:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:18,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-03-08 00:50:18,989 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25 [2025-03-08 00:50:18,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:18,989 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-03-08 00:50:18,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:18,989 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-03-08 00:50:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 00:50:18,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:18,990 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:18,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:19,194 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,SelfDestructingSolverStorable14 [2025-03-08 00:50:19,194 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:19,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:19,194 INFO L85 PathProgramCache]: Analyzing trace with hash 403344884, now seen corresponding path program 9 times [2025-03-08 00:50:19,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:19,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976417496] [2025-03-08 00:50:19,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:50:19,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:19,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 5 equivalence classes. [2025-03-08 00:50:19,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:50:19,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 00:50:19,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:19,335 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:19,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:19,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976417496] [2025-03-08 00:50:19,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976417496] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:19,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969890284] [2025-03-08 00:50:19,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:50:19,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:19,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:19,341 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-08 00:50:19,342 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-08 00:50:19,389 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 5 equivalence classes. [2025-03-08 00:50:19,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:50:19,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 00:50:19,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:19,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:50:19,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:19,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:19,565 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:19,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969890284] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:19,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:19,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-03-08 00:50:19,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91991057] [2025-03-08 00:50:19,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:19,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 00:50:19,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:19,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 00:50:19,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:50:19,566 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:19,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:19,757 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2025-03-08 00:50:19,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 00:50:19,757 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 00:50:19,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:19,757 INFO L225 Difference]: With dead ends: 65 [2025-03-08 00:50:19,757 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 00:50:19,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2025-03-08 00:50:19,758 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 31 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:19,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 42 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:19,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 00:50:19,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 29. [2025-03-08 00:50:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-03-08 00:50:19,771 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 26 [2025-03-08 00:50:19,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:19,771 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-03-08 00:50:19,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:19,771 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-03-08 00:50:19,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 00:50:19,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:19,772 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:19,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:19,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:19,972 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:19,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:19,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1010015157, now seen corresponding path program 10 times [2025-03-08 00:50:19,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:19,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335408549] [2025-03-08 00:50:19,973 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:50:19,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:19,979 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-08 00:50:19,983 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:50:19,983 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:50:19,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:20,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:20,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335408549] [2025-03-08 00:50:20,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335408549] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:20,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065625756] [2025-03-08 00:50:20,057 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:50:20,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:20,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:20,059 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-08 00:50:20,060 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-08 00:50:20,106 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-08 00:50:20,128 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:50:20,128 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:50:20,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:20,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:50:20,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:20,207 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:20,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:20,259 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:20,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065625756] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:20,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:20,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2025-03-08 00:50:20,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357219568] [2025-03-08 00:50:20,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:20,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:50:20,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:20,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:50:20,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:50:20,260 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:20,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:20,359 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2025-03-08 00:50:20,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:50:20,359 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-08 00:50:20,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:20,360 INFO L225 Difference]: With dead ends: 68 [2025-03-08 00:50:20,360 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 00:50:20,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-08 00:50:20,360 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 51 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:20,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 27 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 00:50:20,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2025-03-08 00:50:20,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-03-08 00:50:20,368 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 28 [2025-03-08 00:50:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:20,368 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-08 00:50:20,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-03-08 00:50:20,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 00:50:20,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:20,369 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:20,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:20,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 00:50:20,570 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:20,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:20,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1152717233, now seen corresponding path program 11 times [2025-03-08 00:50:20,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:20,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306734278] [2025-03-08 00:50:20,571 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:50:20,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:20,582 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 6 equivalence classes. [2025-03-08 00:50:20,593 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:50:20,593 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:50:20,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:21,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:21,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306734278] [2025-03-08 00:50:21,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306734278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:21,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800630435] [2025-03-08 00:50:21,178 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:50:21,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:21,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:21,180 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:21,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 00:50:21,230 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 6 equivalence classes. [2025-03-08 00:50:21,273 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:50:21,273 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:50:21,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:21,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-08 00:50:21,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:21,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:50:21,313 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 19 treesize of output 11 [2025-03-08 00:50:21,434 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 19 treesize of output 11 [2025-03-08 00:50:21,611 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 19 treesize of output 11 [2025-03-08 00:50:21,838 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 19 treesize of output 11 [2025-03-08 00:50:26,098 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2025-03-08 00:50:26,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 16 [2025-03-08 00:50:26,107 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 19 treesize of output 11 [2025-03-08 00:50:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:26,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:27,061 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2025-03-08 00:50:27,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 21 [2025-03-08 00:50:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:27,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800630435] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:27,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:27,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 57 [2025-03-08 00:50:27,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315973812] [2025-03-08 00:50:27,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:27,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-08 00:50:27,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:27,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-08 00:50:27,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=2822, Unknown=1, NotChecked=0, Total=3192 [2025-03-08 00:50:27,403 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 57 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 57 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:34,134 INFO L93 Difference]: Finished difference Result 111 states and 142 transitions. [2025-03-08 00:50:34,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-08 00:50:34,134 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 57 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-08 00:50:34,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:34,135 INFO L225 Difference]: With dead ends: 111 [2025-03-08 00:50:34,135 INFO L226 Difference]: Without dead ends: 97 [2025-03-08 00:50:34,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3763 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=1654, Invalid=10117, Unknown=1, NotChecked=0, Total=11772 [2025-03-08 00:50:34,137 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 53 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:34,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 98 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 00:50:34,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-08 00:50:34,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 64. [2025-03-08 00:50:34,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.253968253968254) internal successors, (79), 63 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2025-03-08 00:50:34,154 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 29 [2025-03-08 00:50:34,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:34,154 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2025-03-08 00:50:34,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 57 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:34,154 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2025-03-08 00:50:34,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 00:50:34,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:34,155 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:34,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:34,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 00:50:34,356 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:34,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:34,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1345298704, now seen corresponding path program 5 times [2025-03-08 00:50:34,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:34,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542573398] [2025-03-08 00:50:34,357 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:50:34,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:34,362 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 6 equivalence classes. [2025-03-08 00:50:34,373 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:50:34,373 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:50:34,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:34,650 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:50:34,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:34,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542573398] [2025-03-08 00:50:34,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542573398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:34,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629422289] [2025-03-08 00:50:34,651 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:50:34,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:34,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:34,653 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:34,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 00:50:34,713 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 6 equivalence classes. [2025-03-08 00:50:34,742 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:50:34,742 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:50:34,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:34,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 00:50:34,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:34,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:50:34,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:34,778 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 27 treesize of output 11 [2025-03-08 00:50:34,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:34,799 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 27 treesize of output 11 [2025-03-08 00:50:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:50:34,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:35,139 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 30 treesize of output 28 [2025-03-08 00:50:35,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 198 treesize of output 190 [2025-03-08 00:50:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:50:35,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629422289] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:35,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:35,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2025-03-08 00:50:35,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155005582] [2025-03-08 00:50:35,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:35,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 00:50:35,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:35,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 00:50:35,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2025-03-08 00:50:35,213 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:35,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:35,399 INFO L93 Difference]: Finished difference Result 116 states and 146 transitions. [2025-03-08 00:50:35,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:50:35,400 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-08 00:50:35,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:35,400 INFO L225 Difference]: With dead ends: 116 [2025-03-08 00:50:35,400 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 00:50:35,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2025-03-08 00:50:35,401 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:35,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 86 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 00:50:35,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2025-03-08 00:50:35,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:35,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2025-03-08 00:50:35,426 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 29 [2025-03-08 00:50:35,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:35,426 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2025-03-08 00:50:35,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:35,426 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2025-03-08 00:50:35,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 00:50:35,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:35,427 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:35,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 00:50:35,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:35,631 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:35,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:35,631 INFO L85 PathProgramCache]: Analyzing trace with hash 522055413, now seen corresponding path program 12 times [2025-03-08 00:50:35,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:35,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637528113] [2025-03-08 00:50:35,631 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:50:35,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:35,636 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 6 equivalence classes. [2025-03-08 00:50:35,644 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:50:35,644 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:50:35,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:35,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:35,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637528113] [2025-03-08 00:50:35,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637528113] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:35,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173275213] [2025-03-08 00:50:35,772 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:50:35,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:35,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:35,774 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:35,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 00:50:35,829 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 6 equivalence classes. [2025-03-08 00:50:35,860 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:50:35,860 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:50:35,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:35,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 00:50:35,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:35,961 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:35,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:36,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173275213] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:36,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:36,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2025-03-08 00:50:36,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865792323] [2025-03-08 00:50:36,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:36,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 00:50:36,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:36,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 00:50:36,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:50:36,038 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:36,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:36,272 INFO L93 Difference]: Finished difference Result 103 states and 124 transitions. [2025-03-08 00:50:36,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 00:50:36,275 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-08 00:50:36,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:36,276 INFO L225 Difference]: With dead ends: 103 [2025-03-08 00:50:36,276 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 00:50:36,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 00:50:36,276 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 36 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:36,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 29 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:36,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 00:50:36,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 70. [2025-03-08 00:50:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 69 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:36,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2025-03-08 00:50:36,306 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 30 [2025-03-08 00:50:36,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:36,306 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2025-03-08 00:50:36,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:36,307 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2025-03-08 00:50:36,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 00:50:36,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:36,307 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:36,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-08 00:50:36,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:36,508 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:36,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:36,508 INFO L85 PathProgramCache]: Analyzing trace with hash 594567598, now seen corresponding path program 13 times [2025-03-08 00:50:36,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:36,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697933017] [2025-03-08 00:50:36,508 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:50:36,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:36,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 00:50:36,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:50:36,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:36,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:37,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:37,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697933017] [2025-03-08 00:50:37,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697933017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:37,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58008526] [2025-03-08 00:50:37,245 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:50:37,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:37,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:37,247 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:37,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 00:50:37,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 00:50:37,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:50:37,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:37,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:37,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-03-08 00:50:37,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:37,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:50:37,386 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 19 treesize of output 11 [2025-03-08 00:50:37,448 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 19 treesize of output 11 [2025-03-08 00:50:37,539 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 19 treesize of output 11 [2025-03-08 00:50:37,647 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 19 treesize of output 11 [2025-03-08 00:50:37,771 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 19 treesize of output 11 [2025-03-08 00:50:37,915 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 19 treesize of output 11 [2025-03-08 00:50:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:37,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:38,837 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:38,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58008526] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:38,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:38,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23, 23] total 61 [2025-03-08 00:50:38,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413875559] [2025-03-08 00:50:38,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:38,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-08 00:50:38,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:38,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-08 00:50:38,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=3450, Unknown=0, NotChecked=0, Total=3660 [2025-03-08 00:50:38,840 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 61 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:39,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:39,956 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2025-03-08 00:50:39,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 00:50:39,956 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-08 00:50:39,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:39,957 INFO L225 Difference]: With dead ends: 97 [2025-03-08 00:50:39,957 INFO L226 Difference]: Without dead ends: 94 [2025-03-08 00:50:39,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1638 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=342, Invalid=5358, Unknown=0, NotChecked=0, Total=5700 [2025-03-08 00:50:39,958 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:39,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 133 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:50:39,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-08 00:50:39,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2025-03-08 00:50:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 81 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2025-03-08 00:50:39,980 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 33 [2025-03-08 00:50:39,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:39,980 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2025-03-08 00:50:39,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:39,983 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2025-03-08 00:50:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 00:50:39,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:39,983 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:39,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-08 00:50:40,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:40,183 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:40,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:40,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1202383761, now seen corresponding path program 6 times [2025-03-08 00:50:40,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:40,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137351481] [2025-03-08 00:50:40,184 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:50:40,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:40,192 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 7 equivalence classes. [2025-03-08 00:50:40,209 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:50:40,209 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-08 00:50:40,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:40,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:40,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137351481] [2025-03-08 00:50:40,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137351481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:40,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819497667] [2025-03-08 00:50:40,506 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:50:40,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:40,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:40,508 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:40,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 00:50:40,571 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 7 equivalence classes. [2025-03-08 00:50:40,624 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:50:40,624 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-08 00:50:40,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:40,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 00:50:40,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:40,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:50:40,662 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 23 treesize of output 11 [2025-03-08 00:50:40,687 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 23 treesize of output 11 [2025-03-08 00:50:44,892 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-03-08 00:50:44,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 26 [2025-03-08 00:50:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 62 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:50:45,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 42 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:50:45,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819497667] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:45,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:45,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 14] total 41 [2025-03-08 00:50:45,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274152198] [2025-03-08 00:50:45,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:45,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-08 00:50:45,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:45,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-08 00:50:45,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1461, Unknown=1, NotChecked=0, Total=1640 [2025-03-08 00:50:45,348 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand has 41 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 41 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:54,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 00:50:58,611 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 [1] [2025-03-08 00:51:06,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:51:06,520 INFO L93 Difference]: Finished difference Result 189 states and 230 transitions. [2025-03-08 00:51:06,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-03-08 00:51:06,521 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 41 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-08 00:51:06,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:51:06,522 INFO L225 Difference]: With dead ends: 189 [2025-03-08 00:51:06,522 INFO L226 Difference]: Without dead ends: 125 [2025-03-08 00:51:06,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3210 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=1415, Invalid=9090, Unknown=1, NotChecked=0, Total=10506 [2025-03-08 00:51:06,525 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 91 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 54 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:51:06,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 69 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 879 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2025-03-08 00:51:06,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-08 00:51:06,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 72. [2025-03-08 00:51:06,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 71 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2025-03-08 00:51:06,552 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 33 [2025-03-08 00:51:06,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:51:06,552 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2025-03-08 00:51:06,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 41 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:06,553 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2025-03-08 00:51:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:51:06,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:51:06,553 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:51:06,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-08 00:51:06,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-08 00:51:06,754 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:51:06,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:51:06,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1860607828, now seen corresponding path program 14 times [2025-03-08 00:51:06,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:51:06,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148882675] [2025-03-08 00:51:06,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:51:06,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:51:06,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-08 00:51:06,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:51:06,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:51:06,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:06,946 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 15 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:06,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:51:06,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148882675] [2025-03-08 00:51:06,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148882675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:51:06,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108106465] [2025-03-08 00:51:06,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:51:06,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:06,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:51:06,948 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:51:06,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 00:51:07,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-08 00:51:07,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:51:07,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:51:07,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:07,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 00:51:07,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:51:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:07,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:51:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:07,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108106465] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:51:07,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:51:07,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2025-03-08 00:51:07,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802965435] [2025-03-08 00:51:07,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:51:07,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 00:51:07,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:51:07,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 00:51:07,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2025-03-08 00:51:07,258 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:07,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:51:07,620 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2025-03-08 00:51:07,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 00:51:07,621 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-08 00:51:07,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:51:07,621 INFO L225 Difference]: With dead ends: 107 [2025-03-08 00:51:07,621 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 00:51:07,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 14 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 00:51:07,622 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 35 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:51:07,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 56 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:51:07,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 00:51:07,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 72. [2025-03-08 00:51:07,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 71 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:07,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2025-03-08 00:51:07,644 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 34 [2025-03-08 00:51:07,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:51:07,644 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2025-03-08 00:51:07,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:07,644 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2025-03-08 00:51:07,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 00:51:07,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:51:07,644 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:51:07,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-08 00:51:07,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-08 00:51:07,845 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:51:07,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:51:07,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1361780497, now seen corresponding path program 15 times [2025-03-08 00:51:07,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:51:07,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390238709] [2025-03-08 00:51:07,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:51:07,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:51:07,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 8 equivalence classes. [2025-03-08 00:51:07,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:51:07,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-08 00:51:07,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:08,819 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 15 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:08,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:51:08,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390238709] [2025-03-08 00:51:08,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390238709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:51:08,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146677697] [2025-03-08 00:51:08,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:51:08,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:08,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:51:08,821 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:51:08,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-08 00:51:08,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 8 equivalence classes. [2025-03-08 00:51:08,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:51:08,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-08 00:51:08,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:08,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-03-08 00:51:08,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:51:08,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:51:09,151 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 19 treesize of output 11 [2025-03-08 00:51:09,215 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 19 treesize of output 11 [2025-03-08 00:51:09,293 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 19 treesize of output 11 [2025-03-08 00:51:09,393 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 19 treesize of output 11 [2025-03-08 00:51:09,514 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 19 treesize of output 11 [2025-03-08 00:51:09,638 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 19 treesize of output 11 [2025-03-08 00:51:09,850 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 19 treesize of output 11 [2025-03-08 00:51:09,858 INFO L349 Elim1Store]: treesize reduction 170, result has 0.6 percent of original size [2025-03-08 00:51:09,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 79 treesize of output 22 [2025-03-08 00:51:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:09,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:51:11,113 INFO L349 Elim1Store]: treesize reduction 180, result has 0.6 percent of original size [2025-03-08 00:51:11,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 87 treesize of output 29 [2025-03-08 00:51:11,558 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:11,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146677697] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:51:11,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:51:11,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 28, 28] total 83 [2025-03-08 00:51:11,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96277821] [2025-03-08 00:51:11,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:51:11,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2025-03-08 00:51:11,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:51:11,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2025-03-08 00:51:11,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=6333, Unknown=0, NotChecked=0, Total=6806 [2025-03-08 00:51:11,560 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 83 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 83 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:15,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:51:15,190 INFO L93 Difference]: Finished difference Result 120 states and 143 transitions. [2025-03-08 00:51:15,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-08 00:51:15,190 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 83 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-08 00:51:15,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:51:15,190 INFO L225 Difference]: With dead ends: 120 [2025-03-08 00:51:15,190 INFO L226 Difference]: Without dead ends: 117 [2025-03-08 00:51:15,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5248 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1838, Invalid=15192, Unknown=0, NotChecked=0, Total=17030 [2025-03-08 00:51:15,192 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 40 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 00:51:15,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 134 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 00:51:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-08 00:51:15,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 75. [2025-03-08 00:51:15,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.1891891891891893) internal successors, (88), 74 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2025-03-08 00:51:15,216 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 37 [2025-03-08 00:51:15,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:51:15,216 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2025-03-08 00:51:15,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 83 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2025-03-08 00:51:15,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 00:51:15,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:51:15,216 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:51:15,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-08 00:51:15,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:15,417 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:51:15,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:51:15,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1576629620, now seen corresponding path program 16 times [2025-03-08 00:51:15,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:51:15,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338745897] [2025-03-08 00:51:15,417 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:51:15,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:51:15,424 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-08 00:51:15,441 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 00:51:15,441 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:51:15,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 92 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:15,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:51:15,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338745897] [2025-03-08 00:51:15,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338745897] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:51:15,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474825689] [2025-03-08 00:51:15,611 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:51:15,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:15,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:51:15,614 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:51:15,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-08 00:51:15,686 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-08 00:51:15,752 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 00:51:15,752 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:51:15,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:15,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 00:51:15,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:51:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 92 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:15,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:51:16,022 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 92 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:16,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474825689] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:51:16,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:51:16,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 26 [2025-03-08 00:51:16,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714065258] [2025-03-08 00:51:16,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:51:16,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 00:51:16,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:51:16,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 00:51:16,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2025-03-08 00:51:16,023 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:16,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:51:16,240 INFO L93 Difference]: Finished difference Result 146 states and 173 transitions. [2025-03-08 00:51:16,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:51:16,241 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-08 00:51:16,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:51:16,241 INFO L225 Difference]: With dead ends: 146 [2025-03-08 00:51:16,241 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 00:51:16,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 57 SyntacticMatches, 15 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=398, Invalid=1162, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 00:51:16,242 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 107 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:51:16,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 43 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:51:16,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 00:51:16,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 42. [2025-03-08 00:51:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-03-08 00:51:16,255 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 40 [2025-03-08 00:51:16,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:51:16,255 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-03-08 00:51:16,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-03-08 00:51:16,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 00:51:16,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:51:16,255 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:51:16,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-08 00:51:16,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:16,456 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:51:16,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:51:16,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1702342926, now seen corresponding path program 17 times [2025-03-08 00:51:16,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:51:16,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935974122] [2025-03-08 00:51:16,456 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:51:16,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:51:16,465 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 9 equivalence classes. [2025-03-08 00:51:16,474 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:51:16,474 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-08 00:51:16,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 1 proven. 68 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-08 00:51:16,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:51:16,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935974122] [2025-03-08 00:51:16,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935974122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:51:16,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629403830] [2025-03-08 00:51:16,986 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:51:16,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:16,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:51:16,987 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:51:16,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-08 00:51:17,061 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 9 equivalence classes. [2025-03-08 00:51:17,342 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:51:17,343 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-08 00:51:17,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:17,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-03-08 00:51:17,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:51:17,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:51:17,365 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 19 treesize of output 11 [2025-03-08 00:51:17,421 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 19 treesize of output 11 [2025-03-08 00:51:17,512 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 19 treesize of output 11 [2025-03-08 00:51:17,611 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 19 treesize of output 11 [2025-03-08 00:51:17,725 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 19 treesize of output 11 [2025-03-08 00:51:17,849 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 19 treesize of output 11 [2025-03-08 00:51:18,016 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 19 treesize of output 11 [2025-03-08 00:51:18,181 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 19 treesize of output 11 [2025-03-08 00:51:18,248 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 00:51:18,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:51:19,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:51:19,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 104 treesize of output 33 [2025-03-08 00:51:19,273 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 63 proven. 29 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 00:51:19,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629403830] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:51:19,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:51:19,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 29, 29] total 62 [2025-03-08 00:51:19,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745706612] [2025-03-08 00:51:19,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:51:19,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-08 00:51:19,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:51:19,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-08 00:51:19,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=3221, Unknown=0, NotChecked=0, Total=3782 [2025-03-08 00:51:19,274 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 62 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 62 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:20,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:51:20,494 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2025-03-08 00:51:20,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-08 00:51:20,494 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 62 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-08 00:51:20,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:51:20,495 INFO L225 Difference]: With dead ends: 62 [2025-03-08 00:51:20,495 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 00:51:20,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2586 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1098, Invalid=6912, Unknown=0, NotChecked=0, Total=8010 [2025-03-08 00:51:20,496 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:51:20,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 89 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:51:20,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 00:51:20,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2025-03-08 00:51:20,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-03-08 00:51:20,510 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 41 [2025-03-08 00:51:20,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:51:20,510 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-03-08 00:51:20,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 62 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:20,510 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-03-08 00:51:20,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 00:51:20,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:51:20,510 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:51:20,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-08 00:51:20,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 00:51:20,711 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:51:20,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:51:20,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1196784301, now seen corresponding path program 7 times [2025-03-08 00:51:20,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:51:20,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804120641] [2025-03-08 00:51:20,711 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:51:20,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:51:20,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 00:51:20,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:51:20,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:51:20,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:21,108 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 21 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:21,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:51:21,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804120641] [2025-03-08 00:51:21,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804120641] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:51:21,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301340060] [2025-03-08 00:51:21,108 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:51:21,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:21,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:51:21,110 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:51:21,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-08 00:51:21,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 00:51:21,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:51:21,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:51:21,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:21,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 00:51:21,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:51:21,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:51:21,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:51:21,293 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 27 treesize of output 11 [2025-03-08 00:51:21,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:51:21,317 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 27 treesize of output 11 [2025-03-08 00:51:21,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:51:21,342 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 27 treesize of output 11 [2025-03-08 00:51:21,506 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 54 proven. 59 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:51:21,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:51:23,888 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1260 Int) (v_ArrVal_1262 Int) (v_ArrVal_1257 Int) (|v_ULTIMATE.start_main_~i~0#1_437| Int) (|v_ULTIMATE.start_main_~i~0#1_438| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_437| (+ |v_ULTIMATE.start_main_~i~0#1_438| 1)) (< |v_ULTIMATE.start_main_~i~0#1_438| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 5 (select (store (store (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1257) (+ (* |v_ULTIMATE.start_main_~i~0#1_438| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1260) (+ (* |v_ULTIMATE.start_main_~i~0#1_437| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1262) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2025-03-08 00:51:23,894 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 37 treesize of output 35 [2025-03-08 00:51:23,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1654 treesize of output 1622 [2025-03-08 00:51:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 51 proven. 54 refuted. 0 times theorem prover too weak. 15 trivial. 8 not checked. [2025-03-08 00:51:24,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301340060] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:51:24,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:51:24,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 17] total 50 [2025-03-08 00:51:24,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375238444] [2025-03-08 00:51:24,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:51:24,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-08 00:51:24,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:51:24,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-08 00:51:24,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=2080, Unknown=1, NotChecked=94, Total=2450 [2025-03-08 00:51:24,007 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 50 states, 50 states have (on average 1.82) internal successors, (91), 50 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:24,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:51:24,517 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2025-03-08 00:51:24,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 00:51:24,517 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.82) internal successors, (91), 50 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-08 00:51:24,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:51:24,518 INFO L225 Difference]: With dead ends: 74 [2025-03-08 00:51:24,518 INFO L226 Difference]: Without dead ends: 60 [2025-03-08 00:51:24,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=482, Invalid=3061, Unknown=1, NotChecked=116, Total=3660 [2025-03-08 00:51:24,518 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 62 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:51:24,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 119 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 757 Invalid, 0 Unknown, 42 Unchecked, 0.3s Time] [2025-03-08 00:51:24,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-08 00:51:24,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 45. [2025-03-08 00:51:24,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:24,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-03-08 00:51:24,540 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 41 [2025-03-08 00:51:24,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:51:24,540 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-03-08 00:51:24,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.82) internal successors, (91), 50 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:24,540 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-03-08 00:51:24,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:51:24,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:51:24,540 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:51:24,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-08 00:51:24,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 00:51:24,741 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:51:24,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:51:24,741 INFO L85 PathProgramCache]: Analyzing trace with hash -862943596, now seen corresponding path program 8 times [2025-03-08 00:51:24,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:51:24,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667129497] [2025-03-08 00:51:24,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:51:24,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:51:24,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-08 00:51:24,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:51:24,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:51:24,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:24,939 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 95 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:24,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:51:24,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667129497] [2025-03-08 00:51:24,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667129497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:51:24,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54938720] [2025-03-08 00:51:24,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:51:24,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:24,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:51:24,942 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:51:24,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-08 00:51:25,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-08 00:51:25,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:51:25,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:51:25,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:25,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 00:51:25,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:51:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 117 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:25,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:51:25,313 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 117 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:25,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54938720] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:51:25,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:51:25,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 31 [2025-03-08 00:51:25,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631395332] [2025-03-08 00:51:25,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:51:25,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 00:51:25,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:51:25,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 00:51:25,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=697, Unknown=0, NotChecked=0, Total=930 [2025-03-08 00:51:25,314 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 31 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 31 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:25,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:51:25,494 INFO L93 Difference]: Finished difference Result 138 states and 164 transitions. [2025-03-08 00:51:25,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 00:51:25,495 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 31 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-08 00:51:25,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:51:25,495 INFO L225 Difference]: With dead ends: 138 [2025-03-08 00:51:25,495 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 00:51:25,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 61 SyntacticMatches, 16 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=373, Invalid=1109, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 00:51:25,496 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 92 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:51:25,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 24 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:51:25,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 00:51:25,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 46. [2025-03-08 00:51:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:25,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2025-03-08 00:51:25,512 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 44 [2025-03-08 00:51:25,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:51:25,512 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2025-03-08 00:51:25,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 31 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:25,512 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2025-03-08 00:51:25,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 00:51:25,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:51:25,512 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:51:25,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-08 00:51:25,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-08 00:51:25,713 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:51:25,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:51:25,713 INFO L85 PathProgramCache]: Analyzing trace with hash 754148654, now seen corresponding path program 9 times [2025-03-08 00:51:25,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:51:25,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789990630] [2025-03-08 00:51:25,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:51:25,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:51:25,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 10 equivalence classes. [2025-03-08 00:51:25,736 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 36 of 45 statements. [2025-03-08 00:51:25,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 00:51:25,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 24 proven. 88 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 00:51:25,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:51:25,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789990630] [2025-03-08 00:51:25,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789990630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:51:25,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263807904] [2025-03-08 00:51:25,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:51:25,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:25,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:51:25,947 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:51:25,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-08 00:51:26,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 10 equivalence classes. [2025-03-08 00:51:26,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 36 of 45 statements. [2025-03-08 00:51:26,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 00:51:26,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:26,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 00:51:26,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:51:26,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:51:26,216 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 23 treesize of output 11 [2025-03-08 00:51:26,238 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 23 treesize of output 11 [2025-03-08 00:51:26,263 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 23 treesize of output 11 [2025-03-08 00:51:26,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:51:26,370 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 17 treesize of output 15 [2025-03-08 00:51:26,513 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 00:51:26,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:51:26,583 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 24 proven. 88 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 00:51:26,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263807904] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:51:26,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:51:26,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 14] total 33 [2025-03-08 00:51:26,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524296841] [2025-03-08 00:51:26,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:51:26,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 00:51:26,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:51:26,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 00:51:26,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=960, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 00:51:26,584 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 33 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:51:28,547 INFO L93 Difference]: Finished difference Result 209 states and 254 transitions. [2025-03-08 00:51:28,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-08 00:51:28,547 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 33 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-08 00:51:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:51:28,548 INFO L225 Difference]: With dead ends: 209 [2025-03-08 00:51:28,548 INFO L226 Difference]: Without dead ends: 195 [2025-03-08 00:51:28,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4080 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2371, Invalid=11435, Unknown=0, NotChecked=0, Total=13806 [2025-03-08 00:51:28,550 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 148 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:51:28,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 115 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:51:28,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-08 00:51:28,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 85. [2025-03-08 00:51:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.1666666666666667) internal successors, (98), 84 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2025-03-08 00:51:28,594 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 45 [2025-03-08 00:51:28,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:51:28,595 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2025-03-08 00:51:28,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 33 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2025-03-08 00:51:28,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 00:51:28,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:51:28,595 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:51:28,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-03-08 00:51:28,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 00:51:28,795 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:51:28,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:51:28,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1619585425, now seen corresponding path program 10 times [2025-03-08 00:51:28,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:51:28,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160669963] [2025-03-08 00:51:28,796 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:51:28,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:51:28,806 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-03-08 00:51:28,814 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 45 of 49 statements. [2025-03-08 00:51:28,814 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:51:28,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:29,082 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 30 proven. 125 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 00:51:29,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:51:29,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160669963] [2025-03-08 00:51:29,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160669963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:51:29,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463230569] [2025-03-08 00:51:29,083 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:51:29,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:29,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:51:29,084 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:51:29,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-08 00:51:29,163 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-03-08 00:51:29,183 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 45 of 49 statements. [2025-03-08 00:51:29,183 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:51:29,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:29,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-08 00:51:29,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:51:29,190 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 16 treesize of output 12 [2025-03-08 00:51:29,194 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 38 treesize of output 16 [2025-03-08 00:51:29,197 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 38 treesize of output 16 [2025-03-08 00:51:29,200 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 38 treesize of output 16 [2025-03-08 00:51:29,205 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 36 treesize of output 16 [2025-03-08 00:51:29,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:51:29,361 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 22 treesize of output 15 [2025-03-08 00:51:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 30 proven. 155 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:51:29,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:51:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 30 proven. 155 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:51:29,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463230569] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:51:29,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:51:29,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 21] total 42 [2025-03-08 00:51:29,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842229201] [2025-03-08 00:51:29,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:51:29,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 00:51:29,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:51:29,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 00:51:29,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1499, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 00:51:29,783 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 42 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)