./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s3lif.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/s3lif.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 3aac75742402b60de8e734a48b2dd5180b95add96e084901e84c53f880aa300a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:49:24,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:49:24,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:49:24,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:49:24,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:49:24,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:49:24,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:49:24,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:49:24,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:49:24,773 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:49:24,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:49:24,773 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:49:24,773 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:49:24,773 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:49:24,773 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:49:24,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:49:24,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:49:24,775 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:49:24,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:49:24,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:49:24,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:49:24,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:49:24,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:49:24,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:49:24,776 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:49:24,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:49:24,776 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:49:24,776 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:49:24,776 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:49:24,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:49:24,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:49:24,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:49:24,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:49:24,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:49:24,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:49:24,777 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:49:24,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:49:24,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:49:24,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:49:24,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:49:24,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:49:24,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:49:24,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:49:24,778 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 -> 3aac75742402b60de8e734a48b2dd5180b95add96e084901e84c53f880aa300a [2025-03-08 00:49:25,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:49:25,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:49:25,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:49:25,030 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:49:25,030 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:49:25,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s3lif.c [2025-03-08 00:49:26,122 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d03fe435b/789bec851bdd43acbc61351446b1b886/FLAG82e5e2a07 [2025-03-08 00:49:26,356 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:49:26,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s3lif.c [2025-03-08 00:49:26,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d03fe435b/789bec851bdd43acbc61351446b1b886/FLAG82e5e2a07 [2025-03-08 00:49:26,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d03fe435b/789bec851bdd43acbc61351446b1b886 [2025-03-08 00:49:26,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:49:26,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:49:26,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:49:26,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:49:26,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:49:26,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:49:26" (1/1) ... [2025-03-08 00:49:26,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@741d628a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:26, skipping insertion in model container [2025-03-08 00:49:26,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:49:26" (1/1) ... [2025-03-08 00:49:26,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:49:26,525 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/s3lif.c[588,601] [2025-03-08 00:49:26,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:49:26,551 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:49:26,561 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/s3lif.c[588,601] [2025-03-08 00:49:26,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:49:26,576 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:49:26,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:26 WrapperNode [2025-03-08 00:49:26,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:49:26,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:49:26,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:49:26,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:49:26,583 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:49:26" (1/1) ... [2025-03-08 00:49:26,589 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:49:26" (1/1) ... [2025-03-08 00:49:26,600 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2025-03-08 00:49:26,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:49:26,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:49:26,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:49:26,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:49:26,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:26" (1/1) ... [2025-03-08 00:49:26,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:26" (1/1) ... [2025-03-08 00:49:26,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:26" (1/1) ... [2025-03-08 00:49:26,614 INFO L175 MemorySlicer]: Split 21 memory accesses to 4 slices as follows [2, 8, 4, 7]. 38 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0]. The 5 writes are split as follows [0, 0, 2, 3]. [2025-03-08 00:49:26,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:26" (1/1) ... [2025-03-08 00:49:26,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:26" (1/1) ... [2025-03-08 00:49:26,618 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:26" (1/1) ... [2025-03-08 00:49:26,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:26" (1/1) ... [2025-03-08 00:49:26,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:26" (1/1) ... [2025-03-08 00:49:26,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:26" (1/1) ... [2025-03-08 00:49:26,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:49:26,621 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:49:26,621 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:49:26,621 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:49:26,622 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:26" (1/1) ... [2025-03-08 00:49:26,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:49:26,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:26,646 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:49:26,648 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:49:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:49:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:49:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:49:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:49:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 00:49:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:49:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:49:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:49:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:49:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 00:49:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 00:49:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:49:26,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:49:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:49:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:49:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:49:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 00:49:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:49:26,722 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:49:26,724 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:49:26,854 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:49:26,860 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 00:49:26,860 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:49:26,868 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:49:26,869 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:49:26,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:49:26 BoogieIcfgContainer [2025-03-08 00:49:26,869 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:49:26,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:49:26,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:49:26,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:49:26,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:49:26" (1/3) ... [2025-03-08 00:49:26,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed65fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:49:26, skipping insertion in model container [2025-03-08 00:49:26,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:26" (2/3) ... [2025-03-08 00:49:26,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed65fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:49:26, skipping insertion in model container [2025-03-08 00:49:26,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:49:26" (3/3) ... [2025-03-08 00:49:26,877 INFO L128 eAbstractionObserver]: Analyzing ICFG s3lif.c [2025-03-08 00:49:26,889 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:49:26,890 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s3lif.c that has 1 procedures, 17 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 00:49:26,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:49:26,944 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;@14fc6420, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:49:26,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:49:26,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 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:49:26,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 00:49:26,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:26,952 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:26,952 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:26,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:26,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1915737109, now seen corresponding path program 1 times [2025-03-08 00:49:26,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:26,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348171570] [2025-03-08 00:49:26,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:49:26,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:27,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 00:49:27,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 00:49:27,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:27,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:27,078 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:49:27,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:27,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348171570] [2025-03-08 00:49:27,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348171570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:49:27,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:49:27,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:49:27,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267923204] [2025-03-08 00:49:27,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:49:27,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:49:27,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:27,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:49:27,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:49:27,105 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 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) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:49:27,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:27,113 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2025-03-08 00:49:27,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:49:27,115 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-03-08 00:49:27,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:27,119 INFO L225 Difference]: With dead ends: 30 [2025-03-08 00:49:27,119 INFO L226 Difference]: Without dead ends: 13 [2025-03-08 00:49:27,125 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:49:27,126 INFO L435 NwaCegarLoop]: 21 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, 21 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:49:27,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:49:27,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-08 00:49:27,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-08 00:49:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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:49:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2025-03-08 00:49:27,151 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 10 [2025-03-08 00:49:27,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:27,152 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-03-08 00:49:27,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:49:27,153 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2025-03-08 00:49:27,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 00:49:27,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:27,153 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:27,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:49:27,154 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:27,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:27,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1491726506, now seen corresponding path program 1 times [2025-03-08 00:49:27,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:27,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691612349] [2025-03-08 00:49:27,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:49:27,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:27,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 00:49:27,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 00:49:27,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:27,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:27,279 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:49:27,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:27,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691612349] [2025-03-08 00:49:27,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691612349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:49:27,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:49:27,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:49:27,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084695109] [2025-03-08 00:49:27,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:49:27,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:49:27,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:27,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:49:27,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:49:27,281 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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:49:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:27,325 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2025-03-08 00:49:27,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:49:27,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-03-08 00:49:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:27,326 INFO L225 Difference]: With dead ends: 25 [2025-03-08 00:49:27,326 INFO L226 Difference]: Without dead ends: 18 [2025-03-08 00:49:27,327 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:49:27,327 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:27,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 9 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:49:27,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-08 00:49:27,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-03-08 00:49:27,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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:49:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2025-03-08 00:49:27,330 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 10 [2025-03-08 00:49:27,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:27,331 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-03-08 00:49:27,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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:49:27,331 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2025-03-08 00:49:27,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 00:49:27,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:27,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:27,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:49:27,331 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:27,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:27,332 INFO L85 PathProgramCache]: Analyzing trace with hash 322328624, now seen corresponding path program 1 times [2025-03-08 00:49:27,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:27,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989998219] [2025-03-08 00:49:27,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:49:27,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:27,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 00:49:27,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 00:49:27,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:27,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:28,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:28,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989998219] [2025-03-08 00:49:28,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989998219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:28,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910440791] [2025-03-08 00:49:28,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:49:28,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:28,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:28,021 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:49:28,022 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:49:28,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 00:49:28,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 00:49:28,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:28,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:28,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 00:49:28,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:28,129 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:49:28,258 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:49:28,297 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:49:28,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:28,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:28,397 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 35 treesize of output 31 [2025-03-08 00:49:28,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:28,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2025-03-08 00:49:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:28,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910440791] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:28,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:28,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-08 00:49:28,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342744008] [2025-03-08 00:49:28,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:28,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 00:49:28,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:28,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 00:49:28,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:49:28,500 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 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:49:28,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:28,825 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2025-03-08 00:49:28,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 00:49:28,826 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 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 15 [2025-03-08 00:49:28,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:28,829 INFO L225 Difference]: With dead ends: 40 [2025-03-08 00:49:28,829 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 00:49:28,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2025-03-08 00:49:28,830 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 49 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:28,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 40 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:49:28,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 00:49:28,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2025-03-08 00:49:28,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 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:49:28,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-03-08 00:49:28,837 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2025-03-08 00:49:28,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:28,838 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-03-08 00:49:28,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 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:49:28,838 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2025-03-08 00:49:28,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 00:49:28,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:28,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:28,845 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:49:29,043 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:49:29,044 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:29,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:29,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1209832305, now seen corresponding path program 1 times [2025-03-08 00:49:29,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:29,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574436496] [2025-03-08 00:49:29,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:49:29,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:29,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 00:49:29,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 00:49:29,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:29,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:29,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:49:29,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:29,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574436496] [2025-03-08 00:49:29,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574436496] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:29,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432620315] [2025-03-08 00:49:29,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:49:29,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:29,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:29,168 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:49:29,170 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:49:29,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 00:49:29,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 00:49:29,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:29,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:29,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 00:49:29,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:29,230 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:49:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:49:29,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:29,263 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:49:29,265 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:49:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:49:29,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432620315] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:29,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:29,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 00:49:29,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090232240] [2025-03-08 00:49:29,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:29,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:49:29,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:29,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:49:29,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:49:29,274 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 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:49:29,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:29,316 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2025-03-08 00:49:29,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:49:29,317 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 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) Word has length 15 [2025-03-08 00:49:29,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:29,317 INFO L225 Difference]: With dead ends: 35 [2025-03-08 00:49:29,317 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 00:49:29,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 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:49:29,318 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:29,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 44 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:49:29,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 00:49:29,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-03-08 00:49:29,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 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:49:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-03-08 00:49:29,322 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2025-03-08 00:49:29,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:29,322 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-03-08 00:49:29,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 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:49:29,323 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-03-08 00:49:29,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 00:49:29,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:29,323 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:29,329 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:49:29,527 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:49:29,527 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:29,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:29,528 INFO L85 PathProgramCache]: Analyzing trace with hash -493973740, now seen corresponding path program 2 times [2025-03-08 00:49:29,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:29,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99870044] [2025-03-08 00:49:29,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:49:29,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:29,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-08 00:49:29,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:49:29,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:49:29,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:49:29,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:29,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99870044] [2025-03-08 00:49:29,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99870044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:29,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844651424] [2025-03-08 00:49:29,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:49:29,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:29,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:29,600 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:49:29,601 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:49:29,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-08 00:49:29,649 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:49:29,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:49:29,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:29,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:49:29,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:49:29,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:49:29,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844651424] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:29,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:29,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 00:49:29,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627038437] [2025-03-08 00:49:29,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:29,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:49:29,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:29,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:49:29,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:49:29,728 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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:49:29,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:29,822 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2025-03-08 00:49:29,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:49:29,823 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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:49:29,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:29,823 INFO L225 Difference]: With dead ends: 39 [2025-03-08 00:49:29,823 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 00:49:29,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:49:29,824 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:29,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 32 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 00:49:29,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 23. [2025-03-08 00:49:29,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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:49:29,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-08 00:49:29,833 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2025-03-08 00:49:29,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:29,833 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-08 00:49:29,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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:49:29,833 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-08 00:49:29,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 00:49:29,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:29,834 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:29,839 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:49:30,034 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:49:30,035 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:30,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:30,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1402284501, now seen corresponding path program 3 times [2025-03-08 00:49:30,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:30,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849344694] [2025-03-08 00:49:30,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:49:30,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:30,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-08 00:49:30,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:49:30,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:49:30,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:30,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:49:30,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:30,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849344694] [2025-03-08 00:49:30,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849344694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:30,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580815899] [2025-03-08 00:49:30,093 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:49:30,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:30,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:30,095 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:49:30,096 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:49:30,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-08 00:49:30,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:49:30,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:49:30,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:30,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:49:30,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:30,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:49:30,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:49:30,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580815899] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:30,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:30,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 00:49:30,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131134895] [2025-03-08 00:49:30,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:30,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:49:30,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:30,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:49:30,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:49:30,224 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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:49:30,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:30,281 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2025-03-08 00:49:30,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:49:30,281 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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) Word has length 16 [2025-03-08 00:49:30,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:30,281 INFO L225 Difference]: With dead ends: 38 [2025-03-08 00:49:30,281 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 00:49:30,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:49:30,282 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:30,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 32 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:49:30,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 00:49:30,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-03-08 00:49:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 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:49:30,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-08 00:49:30,286 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2025-03-08 00:49:30,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:30,286 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-08 00:49:30,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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:49:30,286 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-08 00:49:30,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 00:49:30,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:30,286 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:30,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 00:49:30,487 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:49:30,487 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:30,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:30,488 INFO L85 PathProgramCache]: Analyzing trace with hash -96415722, now seen corresponding path program 4 times [2025-03-08 00:49:30,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:30,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099534569] [2025-03-08 00:49:30,488 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:49:30,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:30,499 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-08 00:49:30,522 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:49:30,522 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:49:30,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:31,238 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:31,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:31,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099534569] [2025-03-08 00:49:31,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099534569] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:31,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100190762] [2025-03-08 00:49:31,239 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:49:31,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:31,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:31,240 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:49:31,242 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:49:31,274 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-08 00:49:31,290 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:49:31,290 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:49:31,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:31,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-08 00:49:31,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:31,298 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:49:31,423 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:49:31,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:31,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-08 00:49:31,637 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:49:31,685 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:49:31,730 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:31,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:32,050 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 78 treesize of output 70 [2025-03-08 00:49:32,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:32,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 394 treesize of output 391 [2025-03-08 00:49:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:32,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100190762] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:32,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:32,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 41 [2025-03-08 00:49:32,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143423392] [2025-03-08 00:49:32,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:32,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-08 00:49:32,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:32,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-08 00:49:32,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1408, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 00:49:32,310 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:34,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:34,084 INFO L93 Difference]: Finished difference Result 79 states and 108 transitions. [2025-03-08 00:49:34,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-08 00:49:34,085 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-08 00:49:34,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:34,085 INFO L225 Difference]: With dead ends: 79 [2025-03-08 00:49:34,086 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 00:49:34,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1779 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=811, Invalid=5195, Unknown=0, NotChecked=0, Total=6006 [2025-03-08 00:49:34,088 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 64 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:34,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 88 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:49:34,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 00:49:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 50. [2025-03-08 00:49:34,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 0 states have call successors, (0), 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:49:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2025-03-08 00:49:34,100 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 20 [2025-03-08 00:49:34,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:34,101 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2025-03-08 00:49:34,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:34,101 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2025-03-08 00:49:34,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 00:49:34,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:34,101 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:34,107 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:49:34,306 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:49:34,306 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:34,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:34,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1646394613, now seen corresponding path program 1 times [2025-03-08 00:49:34,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:34,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062320973] [2025-03-08 00:49:34,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:49:34,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:34,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 00:49:34,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:49:34,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:34,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:49:34,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:34,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062320973] [2025-03-08 00:49:34,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062320973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:34,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630124698] [2025-03-08 00:49:34,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:49:34,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:34,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:34,482 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:49:34,483 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:49:34,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 00:49:34,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:49:34,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:34,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:34,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 00:49:34,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:34,545 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:49:34,558 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:49:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:49:34,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:34,608 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:49:34,610 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:49:34,625 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:49:34,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630124698] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:34,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:34,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-08 00:49:34,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507391343] [2025-03-08 00:49:34,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:34,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 00:49:34,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:34,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 00:49:34,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:49:34,626 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 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:49:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:34,703 INFO L93 Difference]: Finished difference Result 83 states and 116 transitions. [2025-03-08 00:49:34,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:49:34,703 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 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:49:34,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:34,704 INFO L225 Difference]: With dead ends: 83 [2025-03-08 00:49:34,704 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 00:49:34,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:49:34,705 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:34,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:34,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 00:49:34,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2025-03-08 00:49:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 0 states have call successors, (0), 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:49:34,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2025-03-08 00:49:34,716 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 20 [2025-03-08 00:49:34,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:34,716 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2025-03-08 00:49:34,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 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:49:34,716 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2025-03-08 00:49:34,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 00:49:34,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:34,717 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:34,722 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:49:34,917 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:49:34,917 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:34,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:34,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1398061134, now seen corresponding path program 5 times [2025-03-08 00:49:34,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:34,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829091412] [2025-03-08 00:49:34,918 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:49:34,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:34,924 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-03-08 00:49:34,931 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:49:34,931 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 00:49:34,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:49:34,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:34,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829091412] [2025-03-08 00:49:34,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829091412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:34,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004493853] [2025-03-08 00:49:34,988 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:49:34,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:34,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:34,990 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:49:34,992 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:49:35,034 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-03-08 00:49:35,054 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:49:35,054 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 00:49:35,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:35,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:49:35,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:49:35,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:49:35,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004493853] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:35,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:35,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-08 00:49:35,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356298351] [2025-03-08 00:49:35,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:35,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 00:49:35,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:35,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 00:49:35,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:49:35,131 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 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:49:35,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:35,266 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2025-03-08 00:49:35,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:49:35,267 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 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:49:35,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:35,267 INFO L225 Difference]: With dead ends: 67 [2025-03-08 00:49:35,267 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 00:49:35,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:49:35,268 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 23 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:35,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 31 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:35,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 00:49:35,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 34. [2025-03-08 00:49:35,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:35,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-03-08 00:49:35,277 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 21 [2025-03-08 00:49:35,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:35,278 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-03-08 00:49:35,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 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:49:35,278 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-03-08 00:49:35,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 00:49:35,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:35,281 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:35,289 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:49:35,482 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:49:35,483 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:35,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:35,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1306111663, now seen corresponding path program 6 times [2025-03-08 00:49:35,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:35,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180457178] [2025-03-08 00:49:35,483 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:49:35,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:35,489 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-03-08 00:49:35,499 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:49:35,499 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-08 00:49:35,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:35,563 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:49:35,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:35,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180457178] [2025-03-08 00:49:35,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180457178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:35,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535650827] [2025-03-08 00:49:35,564 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:49:35,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:35,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:35,567 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:49:35,568 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:49:35,613 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-03-08 00:49:35,628 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:49:35,628 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-08 00:49:35,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:35,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:49:35,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:35,671 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:49:35,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:49:35,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535650827] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:35,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:35,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-08 00:49:35,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113294203] [2025-03-08 00:49:35,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:35,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:49:35,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:35,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:49:35,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:49:35,711 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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:49:35,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:35,784 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2025-03-08 00:49:35,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:49:35,784 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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 21 [2025-03-08 00:49:35,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:35,784 INFO L225 Difference]: With dead ends: 49 [2025-03-08 00:49:35,784 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 00:49:35,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:49:35,785 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:35,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 35 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:35,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 00:49:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-03-08 00:49:35,791 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:49:35,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-03-08 00:49:35,791 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 21 [2025-03-08 00:49:35,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:35,791 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-03-08 00:49:35,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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:49:35,791 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-03-08 00:49:35,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:49:35,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:35,792 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:35,797 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:49:35,992 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:49:35,992 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:35,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:35,993 INFO L85 PathProgramCache]: Analyzing trace with hash 509156976, now seen corresponding path program 7 times [2025-03-08 00:49:35,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:35,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216680329] [2025-03-08 00:49:35,993 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:49:35,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:35,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:49:36,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:49:36,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:36,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:36,908 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:36,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:36,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216680329] [2025-03-08 00:49:36,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216680329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:36,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225146164] [2025-03-08 00:49:36,909 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:49:36,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:36,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:36,911 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:49:36,913 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:49:36,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:49:36,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:49:36,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:36,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:36,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-08 00:49:36,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:36,975 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:49:37,113 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:49:37,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:37,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-08 00:49:37,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:37,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-03-08 00:49:37,381 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:49:37,424 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:49:37,459 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:49:37,484 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:37,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:37,925 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 137 treesize of output 125 [2025-03-08 00:49:37,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:37,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 13205 treesize of output 12623 [2025-03-08 00:49:38,205 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:38,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225146164] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:38,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:38,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 53 [2025-03-08 00:49:38,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340957311] [2025-03-08 00:49:38,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:38,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-08 00:49:38,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:38,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-08 00:49:38,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=2425, Unknown=0, NotChecked=0, Total=2756 [2025-03-08 00:49:38,207 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 53 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 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:49:38,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:38,794 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2025-03-08 00:49:38,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 00:49:38,794 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 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:49:38,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:38,794 INFO L225 Difference]: With dead ends: 59 [2025-03-08 00:49:38,794 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 00:49:38,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1202 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=428, Invalid=2994, Unknown=0, NotChecked=0, Total=3422 [2025-03-08 00:49:38,795 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 28 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:38,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 112 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:49:38,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 00:49:38,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2025-03-08 00:49:38,802 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:49:38,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-03-08 00:49:38,802 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25 [2025-03-08 00:49:38,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:38,802 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-03-08 00:49:38,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 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:49:38,802 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-03-08 00:49:38,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:49:38,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:38,802 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:38,808 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:49:39,003 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:49:39,003 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:39,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:39,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1298297487, now seen corresponding path program 2 times [2025-03-08 00:49:39,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:39,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165715300] [2025-03-08 00:49:39,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:49:39,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:39,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:49:39,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:49:39,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:49:39,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:49:39,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:39,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165715300] [2025-03-08 00:49:39,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165715300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:39,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871207304] [2025-03-08 00:49:39,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:49:39,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:39,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:39,198 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:49:39,200 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:49:39,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:49:39,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:49:39,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:49:39,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:39,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 00:49:39,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:39,273 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:49:39,287 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:49:39,302 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:49:39,326 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:49:39,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:39,375 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:49:39,376 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:49:39,398 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:49:39,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871207304] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:39,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:39,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2025-03-08 00:49:39,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29708629] [2025-03-08 00:49:39,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:39,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 00:49:39,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:39,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 00:49:39,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:49:39,399 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:39,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:39,488 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2025-03-08 00:49:39,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:49:39,492 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 00:49:39,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:39,492 INFO L225 Difference]: With dead ends: 51 [2025-03-08 00:49:39,492 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 00:49:39,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:49:39,493 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:39,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 97 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:39,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 00:49:39,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2025-03-08 00:49:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 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:49:39,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-03-08 00:49:39,501 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 25 [2025-03-08 00:49:39,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:39,501 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-03-08 00:49:39,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:39,502 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-03-08 00:49:39,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 00:49:39,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:39,503 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:39,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 00:49:39,707 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:49:39,707 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:39,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:39,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2031421524, now seen corresponding path program 8 times [2025-03-08 00:49:39,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:39,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257574528] [2025-03-08 00:49:39,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:49:39,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:39,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 00:49:39,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:49:39,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:49:39,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:39,807 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:49:39,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:39,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257574528] [2025-03-08 00:49:39,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257574528] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:39,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439931634] [2025-03-08 00:49:39,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:49:39,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:39,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:39,809 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:49:39,811 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:49:39,853 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 00:49:39,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:49:39,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:49:39,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:39,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 00:49:39,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:39,920 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:49:39,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:39,968 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:49:39,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439931634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:39,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:39,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-03-08 00:49:39,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550200108] [2025-03-08 00:49:39,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:39,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:49:39,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:39,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:49:39,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:49:39,969 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 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:49:40,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:40,090 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2025-03-08 00:49:40,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:49:40,090 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 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 26 [2025-03-08 00:49:40,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:40,091 INFO L225 Difference]: With dead ends: 53 [2025-03-08 00:49:40,091 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 00:49:40,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:49:40,091 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:40,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 24 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:40,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 00:49:40,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2025-03-08 00:49:40,099 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:49:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-03-08 00:49:40,099 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 26 [2025-03-08 00:49:40,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:40,099 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-03-08 00:49:40,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 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:49:40,099 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-03-08 00:49:40,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 00:49:40,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:40,100 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:40,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 00:49:40,300 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:49:40,301 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:40,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:40,301 INFO L85 PathProgramCache]: Analyzing trace with hash -433563119, now seen corresponding path program 3 times [2025-03-08 00:49:40,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:40,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509566167] [2025-03-08 00:49:40,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:49:40,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:40,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 5 equivalence classes. [2025-03-08 00:49:40,313 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 29 statements. [2025-03-08 00:49:40,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:49:40,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:40,383 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:49:40,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:40,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509566167] [2025-03-08 00:49:40,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509566167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:40,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715758804] [2025-03-08 00:49:40,383 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:49:40,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:40,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:40,385 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:49:40,387 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:49:40,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 5 equivalence classes. [2025-03-08 00:49:40,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 29 statements. [2025-03-08 00:49:40,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:49:40,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:40,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 00:49:40,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:40,508 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:49:40,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:40,546 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:49:40,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715758804] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:40,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:40,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-03-08 00:49:40,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6931579] [2025-03-08 00:49:40,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:40,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:49:40,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:40,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:49:40,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:49:40,547 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 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:49:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:40,626 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2025-03-08 00:49:40,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:49:40,627 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 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:49:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:40,627 INFO L225 Difference]: With dead ends: 57 [2025-03-08 00:49:40,627 INFO L226 Difference]: Without dead ends: 33 [2025-03-08 00:49:40,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:49:40,628 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:40,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 25 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:40,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-08 00:49:40,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-03-08 00:49:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 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:49:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2025-03-08 00:49:40,636 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 29 [2025-03-08 00:49:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:40,637 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2025-03-08 00:49:40,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 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:49:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2025-03-08 00:49:40,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 00:49:40,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:40,639 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:40,645 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:49:40,839 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:49:40,840 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:40,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:40,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1460355286, now seen corresponding path program 9 times [2025-03-08 00:49:40,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:40,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893505148] [2025-03-08 00:49:40,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:49:40,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:40,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 5 equivalence classes. [2025-03-08 00:49:40,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:49:40,864 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 00:49:40,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:42,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:42,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893505148] [2025-03-08 00:49:42,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893505148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:42,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30084994] [2025-03-08 00:49:42,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:49:42,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:42,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:42,068 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:49:42,069 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:49:42,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 5 equivalence classes. [2025-03-08 00:49:42,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:49:42,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 00:49:42,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:42,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-08 00:49:42,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:42,166 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:49:42,223 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:49:42,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:42,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-08 00:49:42,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:42,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-03-08 00:49:42,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:42,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2025-03-08 00:49:42,592 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:49:42,630 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:49:42,664 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:49:42,702 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:49:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:49:42,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:43,459 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 214 treesize of output 198 [2025-03-08 00:49:43,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:43,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1577230 treesize of output 1519999 [2025-03-08 00:49:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:49:43,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30084994] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:43,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:43,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 22] total 64 [2025-03-08 00:49:43,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076040812] [2025-03-08 00:49:43,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:43,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-08 00:49:43,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:43,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-08 00:49:43,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=3612, Unknown=0, NotChecked=0, Total=4032 [2025-03-08 00:49:43,859 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 64 states, 64 states have (on average 1.140625) internal successors, (73), 64 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:49:46,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:46,513 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2025-03-08 00:49:46,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-03-08 00:49:46,514 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.140625) internal successors, (73), 64 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 30 [2025-03-08 00:49:46,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:46,514 INFO L225 Difference]: With dead ends: 93 [2025-03-08 00:49:46,514 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 00:49:46,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3641 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1449, Invalid=10323, Unknown=0, NotChecked=0, Total=11772 [2025-03-08 00:49:46,517 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 84 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:46,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 134 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 00:49:46,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 00:49:46,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 63. [2025-03-08 00:49:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 62 states have internal predecessors, (78), 0 states have call successors, (0), 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:49:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2025-03-08 00:49:46,532 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 30 [2025-03-08 00:49:46,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:46,532 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2025-03-08 00:49:46,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.140625) internal successors, (73), 64 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:49:46,532 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2025-03-08 00:49:46,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 00:49:46,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:46,533 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:46,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 00:49:46,733 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:49:46,733 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:46,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:46,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1263841781, now seen corresponding path program 4 times [2025-03-08 00:49:46,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:46,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143374964] [2025-03-08 00:49:46,734 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:49:46,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:46,740 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-08 00:49:46,748 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 26 of 30 statements. [2025-03-08 00:49:46,752 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:49:46,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:46,901 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:49:46,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:46,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143374964] [2025-03-08 00:49:46,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143374964] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:46,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271005294] [2025-03-08 00:49:46,902 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:49:46,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:46,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:46,905 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:49:46,906 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:49:46,955 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-08 00:49:46,967 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 26 of 30 statements. [2025-03-08 00:49:46,967 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:49:46,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:46,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 00:49:46,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:46,975 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:49:47,032 INFO L349 Elim1Store]: treesize reduction 22, result has 42.1 percent of original size [2025-03-08 00:49:47,032 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 1 case distinctions, treesize of input 28 treesize of output 20 [2025-03-08 00:49:47,081 INFO L349 Elim1Store]: treesize reduction 24, result has 40.0 percent of original size [2025-03-08 00:49:47,082 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 1 case distinctions, treesize of input 36 treesize of output 24 [2025-03-08 00:49:47,141 INFO L349 Elim1Store]: treesize reduction 24, result has 40.0 percent of original size [2025-03-08 00:49:47,141 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 1 case distinctions, treesize of input 39 treesize of output 27 [2025-03-08 00:49:47,225 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 00:49:47,225 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 12 [2025-03-08 00:49:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:49:47,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:49:47,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271005294] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:47,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:47,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 10] total 23 [2025-03-08 00:49:47,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523851805] [2025-03-08 00:49:47,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:47,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 00:49:47,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:47,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 00:49:47,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:49:47,364 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 23 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:49:47,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:47,949 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2025-03-08 00:49:47,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 00:49:47,949 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 23 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 30 [2025-03-08 00:49:47,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:47,951 INFO L225 Difference]: With dead ends: 99 [2025-03-08 00:49:47,951 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 00:49:47,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=423, Invalid=1217, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 00:49:47,952 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:47,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 58 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:49:47,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 00:49:47,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2025-03-08 00:49:47,973 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:49:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2025-03-08 00:49:47,974 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 30 [2025-03-08 00:49:47,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:47,974 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2025-03-08 00:49:47,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 23 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:49:47,974 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2025-03-08 00:49:47,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 00:49:47,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:47,976 INFO L218 NwaCegarLoop]: trace histogram [7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:47,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-08 00:49:48,181 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:49:48,181 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:48,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:48,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1752110799, now seen corresponding path program 10 times [2025-03-08 00:49:48,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:48,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379033643] [2025-03-08 00:49:48,181 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:49:48,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:48,188 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-08 00:49:48,191 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 33 statements. [2025-03-08 00:49:48,191 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:49:48,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:49:48,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:48,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379033643] [2025-03-08 00:49:48,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379033643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:48,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886062345] [2025-03-08 00:49:48,286 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:49:48,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:48,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:48,288 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:49:48,290 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:49:48,343 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-08 00:49:48,356 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 33 statements. [2025-03-08 00:49:48,357 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:49:48,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:48,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:49:48,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 25 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:49:48,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 25 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:49:48,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886062345] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:48,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:48,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 19 [2025-03-08 00:49:48,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382766027] [2025-03-08 00:49:48,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:48,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 00:49:48,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:48,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 00:49:48,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:49:48,487 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:48,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:48,621 INFO L93 Difference]: Finished difference Result 89 states and 107 transitions. [2025-03-08 00:49:48,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:49:48,621 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-08 00:49:48,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:48,622 INFO L225 Difference]: With dead ends: 89 [2025-03-08 00:49:48,622 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 00:49:48,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:49:48,622 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 26 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:48,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 33 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:48,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 00:49:48,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2025-03-08 00:49:48,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-03-08 00:49:48,635 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 33 [2025-03-08 00:49:48,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:48,635 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-03-08 00:49:48,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:48,635 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-03-08 00:49:48,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:49:48,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:48,636 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:48,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 00:49:48,836 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:49:48,837 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:48,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:48,837 INFO L85 PathProgramCache]: Analyzing trace with hash -285342219, now seen corresponding path program 11 times [2025-03-08 00:49:48,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:48,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162357384] [2025-03-08 00:49:48,837 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:49:48,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:48,842 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 6 equivalence classes. [2025-03-08 00:49:48,852 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:49:48,853 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:49:48,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:48,936 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:49:48,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:48,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162357384] [2025-03-08 00:49:48,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162357384] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:48,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444928557] [2025-03-08 00:49:48,937 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:49:48,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:48,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:48,939 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:49:48,941 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:49:48,999 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 6 equivalence classes. [2025-03-08 00:49:49,102 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:49:49,102 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:49:49,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:49,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:49:49,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:49,172 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:49:49,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:49,228 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:49:49,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444928557] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:49,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:49,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2025-03-08 00:49:49,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765561480] [2025-03-08 00:49:49,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:49,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 00:49:49,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:49,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 00:49:49,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-08 00:49:49,229 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:49,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:49,341 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-03-08 00:49:49,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 00:49:49,342 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-08 00:49:49,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:49,342 INFO L225 Difference]: With dead ends: 44 [2025-03-08 00:49:49,342 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 00:49:49,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 53 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:49:49,342 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 50 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:49,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 33 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:49,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 00:49:49,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2025-03-08 00:49:49,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 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:49:49,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-03-08 00:49:49,354 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 34 [2025-03-08 00:49:49,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:49,355 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-03-08 00:49:49,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-03-08 00:49:49,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 00:49:49,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:49,355 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:49,363 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:49:49,556 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:49:49,556 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:49,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:49,556 INFO L85 PathProgramCache]: Analyzing trace with hash -255642448, now seen corresponding path program 12 times [2025-03-08 00:49:49,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:49,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259303007] [2025-03-08 00:49:49,556 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:49:49,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:49,562 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 6 equivalence classes. [2025-03-08 00:49:49,585 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:49:49,586 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:49:49,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:51,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:51,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259303007] [2025-03-08 00:49:51,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259303007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:51,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223313438] [2025-03-08 00:49:51,236 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:49:51,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:51,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:51,238 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:49:51,239 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:49:51,296 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 6 equivalence classes. [2025-03-08 00:49:51,365 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:49:51,365 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:49:51,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:51,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-03-08 00:49:51,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:51,443 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:49:51,735 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:49:51,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:51,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-08 00:49:52,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:52,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-03-08 00:49:52,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:52,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2025-03-08 00:49:52,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:52,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 51 [2025-03-08 00:49:52,522 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:49:52,585 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:49:52,650 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:49:52,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2025-03-08 00:49:52,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:49:52,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:52,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 76 treesize of output 114 [2025-03-08 00:49:52,836 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 154 treesize of output 103 [2025-03-08 00:49:52,985 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 1 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:52,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:54,270 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 212 treesize of output 196 [2025-03-08 00:49:54,399 INFO L349 Elim1Store]: treesize reduction 60, result has 67.9 percent of original size [2025-03-08 00:49:54,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 702260 treesize of output 692112 [2025-03-08 00:49:55,530 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:55,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223313438] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:55,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:55,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33, 31] total 89 [2025-03-08 00:49:55,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339887873] [2025-03-08 00:49:55,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:55,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2025-03-08 00:49:55,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:55,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2025-03-08 00:49:55,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1064, Invalid=6768, Unknown=0, NotChecked=0, Total=7832 [2025-03-08 00:49:55,533 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 89 states, 89 states have (on average 1.0674157303370786) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 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:49:58,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:58,675 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2025-03-08 00:49:58,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-08 00:49:58,676 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 1.0674157303370786) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-08 00:49:58,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:58,676 INFO L225 Difference]: With dead ends: 107 [2025-03-08 00:49:58,676 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 00:49:58,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5317 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2666, Invalid=14364, Unknown=0, NotChecked=0, Total=17030 [2025-03-08 00:49:58,679 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 117 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:58,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 82 Invalid, 1741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 00:49:58,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 00:49:58,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 67. [2025-03-08 00:49:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 66 states have internal predecessors, (75), 0 states have call successors, (0), 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:49:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2025-03-08 00:49:58,700 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 35 [2025-03-08 00:49:58,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:58,700 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2025-03-08 00:49:58,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 1.0674157303370786) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 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:49:58,700 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2025-03-08 00:49:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 00:49:58,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:58,700 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:58,707 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:49:58,902 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:49:58,902 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:58,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:58,902 INFO L85 PathProgramCache]: Analyzing trace with hash -761201073, now seen corresponding path program 5 times [2025-03-08 00:49:58,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:58,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384585243] [2025-03-08 00:49:58,902 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:49:58,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:58,908 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 6 equivalence classes. [2025-03-08 00:49:58,921 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:49:58,921 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:49:58,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:59,130 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 19 proven. 29 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 00:49:59,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:59,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384585243] [2025-03-08 00:49:59,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384585243] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:59,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339956658] [2025-03-08 00:49:59,130 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:49:59,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:59,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:59,132 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:49:59,134 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:49:59,193 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 6 equivalence classes. [2025-03-08 00:49:59,471 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:49:59,471 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:49:59,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:59,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 00:49:59,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:59,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 00:49:59,498 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2025-03-08 00:49:59,498 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 1 case distinctions, treesize of input 25 treesize of output 24 [2025-03-08 00:49:59,551 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-03-08 00:49:59,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2025-03-08 00:49:59,589 INFO L349 Elim1Store]: treesize reduction 35, result has 23.9 percent of original size [2025-03-08 00:49:59,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 27 [2025-03-08 00:49:59,638 INFO L349 Elim1Store]: treesize reduction 35, result has 23.9 percent of original size [2025-03-08 00:49:59,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 27 [2025-03-08 00:49:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 00:49:59,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:59,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-03-08 00:49:59,694 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 25 treesize of output 21 [2025-03-08 00:49:59,697 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 19 proven. 29 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 00:49:59,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339956658] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:59,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:59,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2025-03-08 00:49:59,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891053398] [2025-03-08 00:49:59,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:59,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 00:49:59,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:59,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 00:49:59,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:49:59,698 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 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:49:59,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:59,844 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2025-03-08 00:49:59,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:49:59,844 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-08 00:49:59,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:59,845 INFO L225 Difference]: With dead ends: 85 [2025-03-08 00:49:59,845 INFO L226 Difference]: Without dead ends: 66 [2025-03-08 00:49:59,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-03-08 00:49:59,845 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:59,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 70 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:59,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-08 00:49:59,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2025-03-08 00:49:59,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 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:49:59,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2025-03-08 00:49:59,864 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 35 [2025-03-08 00:49:59,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:59,864 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2025-03-08 00:49:59,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 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:49:59,864 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2025-03-08 00:49:59,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 00:49:59,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:59,865 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:59,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:00,065 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:00,065 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:00,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:00,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1537975375, now seen corresponding path program 13 times [2025-03-08 00:50:00,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:00,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960322735] [2025-03-08 00:50:00,065 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:50:00,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:00,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 00:50:00,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:50:00,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:00,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:00,197 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-08 00:50:00,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:00,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960322735] [2025-03-08 00:50:00,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960322735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:00,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870843428] [2025-03-08 00:50:00,197 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:50:00,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:00,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:00,199 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:00,201 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:00,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 00:50:00,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:50:00,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:00,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:00,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 00:50:00,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-08 00:50:00,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:00,485 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-08 00:50:00,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870843428] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:00,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:00,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2025-03-08 00:50:00,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292525340] [2025-03-08 00:50:00,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:00,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 00:50:00,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:00,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 00:50:00,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:50:00,487 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 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:00,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:00,741 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2025-03-08 00:50:00,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 00:50:00,741 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 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 39 [2025-03-08 00:50:00,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:00,742 INFO L225 Difference]: With dead ends: 86 [2025-03-08 00:50:00,742 INFO L226 Difference]: Without dead ends: 73 [2025-03-08 00:50:00,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 00:50:00,742 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 61 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:00,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 24 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:50:00,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-08 00:50:00,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 60. [2025-03-08 00:50:00,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 0 states have call successors, (0), 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:00,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2025-03-08 00:50:00,763 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 39 [2025-03-08 00:50:00,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:00,763 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2025-03-08 00:50:00,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 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:00,763 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2025-03-08 00:50:00,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 00:50:00,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:00,763 INFO L218 NwaCegarLoop]: trace histogram [9, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:00,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:00,963 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:00,964 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:00,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:00,964 INFO L85 PathProgramCache]: Analyzing trace with hash -134564368, now seen corresponding path program 14 times [2025-03-08 00:50:00,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:00,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889626507] [2025-03-08 00:50:00,964 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:00,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:00,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-08 00:50:00,975 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:50:00,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:00,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 37 proven. 23 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 00:50:01,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:01,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889626507] [2025-03-08 00:50:01,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889626507] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:01,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498423622] [2025-03-08 00:50:01,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:01,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:01,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:01,126 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:01,127 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:01,195 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-08 00:50:01,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:50:01,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:01,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:01,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 00:50:01,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 39 proven. 15 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-08 00:50:01,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 39 proven. 15 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-08 00:50:01,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498423622] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:01,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:01,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 26 [2025-03-08 00:50:01,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783348183] [2025-03-08 00:50:01,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:01,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 00:50:01,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:01,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 00:50:01,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2025-03-08 00:50:01,368 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 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:01,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:01,495 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2025-03-08 00:50:01,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 00:50:01,496 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-08 00:50:01,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:01,496 INFO L225 Difference]: With dead ends: 75 [2025-03-08 00:50:01,496 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 00:50:01,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2025-03-08 00:50:01,497 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 48 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:01,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 57 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:01,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 00:50:01,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2025-03-08 00:50:01,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 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:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2025-03-08 00:50:01,511 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 39 [2025-03-08 00:50:01,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:01,511 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2025-03-08 00:50:01,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 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:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2025-03-08 00:50:01,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 00:50:01,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:01,511 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:01,518 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:50:01,712 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:50:01,712 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:01,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:01,712 INFO L85 PathProgramCache]: Analyzing trace with hash 432628118, now seen corresponding path program 15 times [2025-03-08 00:50:01,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:01,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929826004] [2025-03-08 00:50:01,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:50:01,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:01,718 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 7 equivalence classes. [2025-03-08 00:50:01,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 00:50:01,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 00:50:01,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:03,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:03,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929826004] [2025-03-08 00:50:03,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929826004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:03,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472476114] [2025-03-08 00:50:03,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:50:03,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:03,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:03,793 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:50:03,794 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:50:03,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 7 equivalence classes. [2025-03-08 00:50:03,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 00:50:03,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 00:50:03,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:03,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-03-08 00:50:03,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:03,999 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:04,059 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:04,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:04,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-08 00:50:04,220 INFO L349 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2025-03-08 00:50:04,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 41 [2025-03-08 00:50:04,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:04,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:04,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:04,371 INFO L349 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2025-03-08 00:50:04,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 51 [2025-03-08 00:50:04,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:04,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:04,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:04,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:04,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:04,553 INFO L349 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2025-03-08 00:50:04,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 59 treesize of output 65 [2025-03-08 00:50:04,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:04,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:04,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:04,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:04,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:04,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:04,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:04,795 INFO L349 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2025-03-08 00:50:04,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 70 treesize of output 79 [2025-03-08 00:50:05,068 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:05,150 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:05,241 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 25 treesize of output 17 [2025-03-08 00:50:05,318 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 35 treesize of output 23 [2025-03-08 00:50:05,407 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 40 treesize of output 28 [2025-03-08 00:50:05,506 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 45 treesize of output 33 [2025-03-08 00:50:05,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:05,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:05,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:05,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:05,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:05,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:05,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:05,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:05,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:05,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:05,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:05,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:05,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:05,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:05,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:05,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 35 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 87 treesize of output 111 [2025-03-08 00:50:05,631 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 23 proven. 60 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:50:05,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:07,010 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 176 treesize of output 160 [2025-03-08 00:50:07,038 INFO L349 Elim1Store]: treesize reduction 72, result has 27.3 percent of original size [2025-03-08 00:50:07,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 401 treesize of output 374 [2025-03-08 00:50:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:50:07,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472476114] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:07,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:07,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 30, 29] total 87 [2025-03-08 00:50:07,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243972218] [2025-03-08 00:50:07,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:07,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2025-03-08 00:50:07,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:07,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2025-03-08 00:50:07,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1027, Invalid=6455, Unknown=0, NotChecked=0, Total=7482 [2025-03-08 00:50:07,160 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 87 states, 87 states have (on average 1.1379310344827587) internal successors, (99), 87 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:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:15,632 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2025-03-08 00:50:15,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-03-08 00:50:15,632 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 1.1379310344827587) internal successors, (99), 87 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 40 [2025-03-08 00:50:15,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:15,633 INFO L225 Difference]: With dead ends: 96 [2025-03-08 00:50:15,633 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 00:50:15,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7085 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=3269, Invalid=19081, Unknown=0, NotChecked=0, Total=22350 [2025-03-08 00:50:15,634 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 85 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:15,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 181 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 00:50:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 00:50:15,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 69. [2025-03-08 00:50:15,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 68 states have internal predecessors, (87), 0 states have call successors, (0), 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,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2025-03-08 00:50:15,665 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 40 [2025-03-08 00:50:15,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:15,665 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2025-03-08 00:50:15,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 1.1379310344827587) internal successors, (99), 87 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:15,665 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2025-03-08 00:50:15,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 00:50:15,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:15,665 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:15,672 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:50:15,865 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:50:15,866 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:15,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:15,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1940179927, now seen corresponding path program 6 times [2025-03-08 00:50:15,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:15,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782306483] [2025-03-08 00:50:15,866 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:50:15,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:15,872 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 7 equivalence classes. [2025-03-08 00:50:15,890 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 00:50:15,890 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-08 00:50:15,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:16,302 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 5 proven. 63 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:50:16,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:16,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782306483] [2025-03-08 00:50:16,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782306483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:16,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892154983] [2025-03-08 00:50:16,302 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:50:16,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:16,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:16,304 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:50:16,304 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:50:16,373 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 7 equivalence classes. [2025-03-08 00:50:16,460 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 00:50:16,460 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-08 00:50:16,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:16,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-08 00:50:16,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:16,525 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:16,541 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 19 treesize of output 18 [2025-03-08 00:50:16,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:16,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:16,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:16,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2025-03-08 00:50:16,643 INFO L349 Elim1Store]: treesize reduction 36, result has 39.0 percent of original size [2025-03-08 00:50:16,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 29 [2025-03-08 00:50:16,719 INFO L349 Elim1Store]: treesize reduction 36, result has 39.0 percent of original size [2025-03-08 00:50:16,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 37 [2025-03-08 00:50:16,808 INFO L349 Elim1Store]: treesize reduction 36, result has 39.0 percent of original size [2025-03-08 00:50:16,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 43 [2025-03-08 00:50:16,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:16,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 46 [2025-03-08 00:50:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:50:16,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:17,313 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 20 proven. 63 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:50:17,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892154983] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:17,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:17,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22, 22] total 54 [2025-03-08 00:50:17,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589240753] [2025-03-08 00:50:17,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:17,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-08 00:50:17,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:17,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-08 00:50:17,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=2474, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 00:50:17,315 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 54 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 54 states have internal predecessors, (87), 0 states have call successors, (0), 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,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:18,743 INFO L93 Difference]: Finished difference Result 148 states and 188 transitions. [2025-03-08 00:50:18,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-08 00:50:18,743 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 54 states have internal predecessors, (87), 0 states have call successors, (0), 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:50:18,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:18,744 INFO L225 Difference]: With dead ends: 148 [2025-03-08 00:50:18,744 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 00:50:18,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3331 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1879, Invalid=9463, Unknown=0, NotChecked=0, Total=11342 [2025-03-08 00:50:18,745 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 95 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:18,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 73 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:50:18,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 00:50:18,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2025-03-08 00:50:18,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 67 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:50:18,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2025-03-08 00:50:18,775 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 40 [2025-03-08 00:50:18,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:18,775 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2025-03-08 00:50:18,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 54 states have internal predecessors, (87), 0 states have call successors, (0), 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,775 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2025-03-08 00:50:18,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 00:50:18,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:18,776 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:18,782 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:50:18,976 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:50:18,976 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:18,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:18,976 INFO L85 PathProgramCache]: Analyzing trace with hash 376893203, now seen corresponding path program 16 times [2025-03-08 00:50:18,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:18,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528141861] [2025-03-08 00:50:18,977 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:50:18,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:18,984 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-08 00:50:18,988 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 42 statements. [2025-03-08 00:50:18,988 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:50:18,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 28 proven. 51 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 00:50:19,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:19,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528141861] [2025-03-08 00:50:19,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528141861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:19,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719336983] [2025-03-08 00:50:19,105 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:50:19,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:19,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:19,107 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:50:19,108 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:50:19,190 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-08 00:50:19,207 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 42 statements. [2025-03-08 00:50:19,207 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:50:19,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:19,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 00:50:19,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 28 proven. 51 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 00:50:19,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:19,408 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 28 proven. 51 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 00:50:19,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719336983] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:19,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:19,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 23 [2025-03-08 00:50:19,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431429267] [2025-03-08 00:50:19,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:19,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 00:50:19,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:19,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 00:50:19,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:50:19,409 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 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,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:19,584 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2025-03-08 00:50:19,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:50:19,585 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 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 42 [2025-03-08 00:50:19,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:19,585 INFO L225 Difference]: With dead ends: 108 [2025-03-08 00:50:19,585 INFO L226 Difference]: Without dead ends: 97 [2025-03-08 00:50:19,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 64 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2025-03-08 00:50:19,586 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:19,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 27 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:19,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-08 00:50:19,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 71. [2025-03-08 00:50:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 70 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:50:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2025-03-08 00:50:19,618 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 42 [2025-03-08 00:50:19,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:19,618 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2025-03-08 00:50:19,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 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,618 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2025-03-08 00:50:19,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 00:50:19,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:19,619 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:19,624 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:50:19,819 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:50:19,819 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:19,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:19,820 INFO L85 PathProgramCache]: Analyzing trace with hash 866163440, now seen corresponding path program 17 times [2025-03-08 00:50:19,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:19,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970075833] [2025-03-08 00:50:19,820 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:50:19,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:19,827 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 8 equivalence classes. [2025-03-08 00:50:19,846 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 00:50:19,846 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-08 00:50:19,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:21,684 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:50:21,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:21,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970075833] [2025-03-08 00:50:21,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970075833] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:21,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770108961] [2025-03-08 00:50:21,685 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:50:21,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:21,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:21,687 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:50:21,688 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:50:21,783 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 8 equivalence classes. [2025-03-08 00:50:27,131 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 00:50:27,131 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-08 00:50:27,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:27,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 112 conjuncts are in the unsatisfiable core [2025-03-08 00:50:27,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:27,148 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:27,173 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:27,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:27,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-08 00:50:27,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:27,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-03-08 00:50:27,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:27,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2025-03-08 00:50:27,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:27,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 51 [2025-03-08 00:50:27,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:27,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 61 [2025-03-08 00:50:27,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:27,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 61 treesize of output 71 [2025-03-08 00:50:28,145 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:28,213 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:28,281 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:28,347 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:28,422 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:28,504 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:28,565 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:28,636 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 00:50:28,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:31,374 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 648 treesize of output 606 [2025-03-08 00:50:31,942 INFO L349 Elim1Store]: treesize reduction 210, result has 51.7 percent of original size [2025-03-08 00:50:31,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 12707670902 treesize of output 11113835558 [2025-03-08 00:50:32,950 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 00:50:32,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770108961] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:32,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:32,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 34, 34] total 92 [2025-03-08 00:50:32,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76186025] [2025-03-08 00:50:32,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:32,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2025-03-08 00:50:32,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:32,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2025-03-08 00:50:32,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=920, Invalid=7452, Unknown=0, NotChecked=0, Total=8372 [2025-03-08 00:50:32,952 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 92 states, 92 states have (on average 1.1195652173913044) internal successors, (103), 92 states have internal predecessors, (103), 0 states have call successors, (0), 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,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:36,110 INFO L93 Difference]: Finished difference Result 110 states and 140 transitions. [2025-03-08 00:50:36,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-08 00:50:36,110 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 1.1195652173913044) internal successors, (103), 92 states have internal predecessors, (103), 0 states have call successors, (0), 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:50:36,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:36,111 INFO L225 Difference]: With dead ends: 110 [2025-03-08 00:50:36,111 INFO L226 Difference]: Without dead ends: 107 [2025-03-08 00:50:36,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3989 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1411, Invalid=11471, Unknown=0, NotChecked=0, Total=12882 [2025-03-08 00:50:36,112 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:36,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 215 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1914 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 00:50:36,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-08 00:50:36,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 82. [2025-03-08 00:50:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 81 states have internal predecessors, (101), 0 states have call successors, (0), 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,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2025-03-08 00:50:36,161 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 45 [2025-03-08 00:50:36,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:36,161 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2025-03-08 00:50:36,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 1.1195652173913044) internal successors, (103), 92 states have internal predecessors, (103), 0 states have call successors, (0), 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,161 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2025-03-08 00:50:36,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 00:50:36,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:36,162 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:36,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-08 00:50:36,362 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:50:36,362 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:36,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:36,363 INFO L85 PathProgramCache]: Analyzing trace with hash 21691569, now seen corresponding path program 7 times [2025-03-08 00:50:36,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:36,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94046346] [2025-03-08 00:50:36,363 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:50:36,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:36,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 00:50:36,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 00:50:36,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:36,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 38 proven. 53 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 00:50:36,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:36,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94046346] [2025-03-08 00:50:36,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94046346] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:36,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332700614] [2025-03-08 00:50:36,677 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:50:36,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:36,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:36,679 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:50:36,680 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:50:36,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 00:50:36,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 00:50:36,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:36,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:36,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-08 00:50:36,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:36,850 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:36,865 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 19 treesize of output 18 [2025-03-08 00:50:36,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:36,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 00:50:36,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:36,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 31 [2025-03-08 00:50:36,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:36,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 31 [2025-03-08 00:50:37,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:37,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 31 [2025-03-08 00:50:37,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:37,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 31 [2025-03-08 00:50:37,123 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 37 proven. 54 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 00:50:37,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:37,178 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 32 treesize of output 30 [2025-03-08 00:50:37,180 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 34 treesize of output 30 [2025-03-08 00:50:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 40 proven. 51 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 00:50:37,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332700614] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:37,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:37,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 37 [2025-03-08 00:50:37,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025302554] [2025-03-08 00:50:37,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:37,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-08 00:50:37,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:37,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-08 00:50:37,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1141, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 00:50:37,271 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 37 states, 37 states have (on average 1.864864864864865) internal successors, (69), 37 states have internal predecessors, (69), 0 states have call successors, (0), 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:37,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:37,627 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2025-03-08 00:50:37,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 00:50:37,628 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.864864864864865) internal successors, (69), 37 states have internal predecessors, (69), 0 states have call successors, (0), 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:50:37,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:37,628 INFO L225 Difference]: With dead ends: 128 [2025-03-08 00:50:37,628 INFO L226 Difference]: Without dead ends: 92 [2025-03-08 00:50:37,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=1563, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 00:50:37,629 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:37,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 93 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:50:37,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-08 00:50:37,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2025-03-08 00:50:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 81 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:50:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2025-03-08 00:50:37,676 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 45 [2025-03-08 00:50:37,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:37,676 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2025-03-08 00:50:37,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.864864864864865) internal successors, (69), 37 states have internal predecessors, (69), 0 states have call successors, (0), 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:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2025-03-08 00:50:37,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 00:50:37,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:37,677 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:37,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:37,877 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:50:37,877 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:37,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:37,877 INFO L85 PathProgramCache]: Analyzing trace with hash -403208717, now seen corresponding path program 18 times [2025-03-08 00:50:37,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:37,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090654919] [2025-03-08 00:50:37,878 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:50:37,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:37,886 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 9 equivalence classes. [2025-03-08 00:50:37,903 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:50:37,903 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-08 00:50:37,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:38,045 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 73 proven. 47 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 00:50:38,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:38,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090654919] [2025-03-08 00:50:38,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090654919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:38,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838220700] [2025-03-08 00:50:38,046 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:50:38,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:38,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:38,047 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:50:38,048 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:50:38,136 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 9 equivalence classes. [2025-03-08 00:50:38,457 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:50:38,457 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-08 00:50:38,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:38,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 00:50:38,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:38,582 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 92 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 00:50:38,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:38,688 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 92 proven. 35 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:50:38,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838220700] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:38,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:38,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 29 [2025-03-08 00:50:38,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003038883] [2025-03-08 00:50:38,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:38,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 00:50:38,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:38,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 00:50:38,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2025-03-08 00:50:38,689 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 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:38,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:38,998 INFO L93 Difference]: Finished difference Result 155 states and 190 transitions. [2025-03-08 00:50:38,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-08 00:50:38,999 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 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 48 [2025-03-08 00:50:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:38,999 INFO L225 Difference]: With dead ends: 155 [2025-03-08 00:50:38,999 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 00:50:39,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 71 SyntacticMatches, 14 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=550, Invalid=2000, Unknown=0, NotChecked=0, Total=2550 [2025-03-08 00:50:39,000 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 67 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:39,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 42 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:39,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 00:50:39,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2025-03-08 00:50:39,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.2162162162162162) internal successors, (90), 74 states have internal predecessors, (90), 0 states have call successors, (0), 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,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2025-03-08 00:50:39,040 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 48 [2025-03-08 00:50:39,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:39,040 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2025-03-08 00:50:39,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 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:39,040 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2025-03-08 00:50:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 00:50:39,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:39,041 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:39,048 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:50:39,241 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:50:39,242 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:39,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:39,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2025276529, now seen corresponding path program 19 times [2025-03-08 00:50:39,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:39,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137610876] [2025-03-08 00:50:39,244 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:50:39,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:39,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 00:50:39,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:50:39,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:39,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:39,427 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-08 00:50:39,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:39,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137610876] [2025-03-08 00:50:39,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137610876] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:39,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266439232] [2025-03-08 00:50:39,427 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:50:39,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:39,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:39,429 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:50:39,430 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:50:39,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 00:50:39,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:50:39,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:39,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:39,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 00:50:39,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:39,653 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-08 00:50:39,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:39,763 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-08 00:50:39,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266439232] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:39,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:39,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 29 [2025-03-08 00:50:39,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188132828] [2025-03-08 00:50:39,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:39,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 00:50:39,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:39,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 00:50:39,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2025-03-08 00:50:39,764 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 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:39,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:39,971 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2025-03-08 00:50:39,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 00:50:39,972 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 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 49 [2025-03-08 00:50:39,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:39,972 INFO L225 Difference]: With dead ends: 89 [2025-03-08 00:50:39,972 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 00:50:39,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 72 SyntacticMatches, 16 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=341, Invalid=1065, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 00:50:39,973 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 111 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:39,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 30 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:39,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 00:50:40,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 54. [2025-03-08 00:50:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 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:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2025-03-08 00:50:40,010 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 49 [2025-03-08 00:50:40,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:40,010 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2025-03-08 00:50:40,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 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:40,010 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2025-03-08 00:50:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 00:50:40,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:40,010 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:40,016 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:50:40,210 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:50:40,211 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:40,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:40,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1640968790, now seen corresponding path program 20 times [2025-03-08 00:50:40,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:40,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562526769] [2025-03-08 00:50:40,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:40,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:40,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-08 00:50:40,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 00:50:40,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:40,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:44,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:44,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562526769] [2025-03-08 00:50:44,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562526769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:44,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602301449] [2025-03-08 00:50:44,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:44,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:44,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:44,426 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:50:44,426 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:50:44,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-08 00:50:44,541 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 00:50:44,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:44,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:44,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 145 conjuncts are in the unsatisfiable core [2025-03-08 00:50:44,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:44,554 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:44,842 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:44,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:44,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-08 00:50:45,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:45,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-03-08 00:50:45,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:45,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2025-03-08 00:50:45,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:45,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 51 [2025-03-08 00:50:45,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:45,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 61 [2025-03-08 00:50:45,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:45,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 61 treesize of output 71 [2025-03-08 00:50:46,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:46,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 68 treesize of output 81 [2025-03-08 00:50:46,304 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:46,383 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:46,467 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:46,547 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:46,628 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:46,724 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:46,803 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:46,890 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:46,969 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:46,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:50,979 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 672 treesize of output 640 [2025-03-08 00:50:52,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:52,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 1703284168403583052 treesize of output -458443652734254515