./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound20.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 946e199240c0e980bd422384e40e4d2247ef6b3560471b18ba5a354c3628dba9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:09:40,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:09:40,280 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:09:40,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:09:40,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:09:40,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:09:40,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:09:40,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:09:40,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:09:40,300 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:09:40,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:09:40,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:09:40,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:09:40,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:09:40,302 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:09:40,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:09:40,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:09:40,302 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:09:40,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:09:40,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:09:40,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:09:40,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:09:40,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:09:40,303 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:09:40,303 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:09:40,303 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:09:40,303 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:09:40,303 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:09:40,303 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:09:40,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:09:40,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:09:40,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:09:40,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:09:40,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:09:40,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:09:40,304 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:09:40,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:09:40,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:09:40,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:09:40,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:09:40,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:09:40,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:09:40,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:09:40,304 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 -> 946e199240c0e980bd422384e40e4d2247ef6b3560471b18ba5a354c3628dba9 [2025-03-03 14:09:40,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:09:40,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:09:40,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:09:40,522 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:09:40,522 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:09:40,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound20.c [2025-03-03 14:09:41,603 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/547572736/ca468fe5bb31488bb21f23a130f8af33/FLAGf6ae7ee99 [2025-03-03 14:09:41,778 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:09:41,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound20.c [2025-03-03 14:09:41,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/547572736/ca468fe5bb31488bb21f23a130f8af33/FLAGf6ae7ee99 [2025-03-03 14:09:42,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/547572736/ca468fe5bb31488bb21f23a130f8af33 [2025-03-03 14:09:42,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:09:42,159 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:09:42,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:09:42,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:09:42,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:09:42,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:09:42" (1/1) ... [2025-03-03 14:09:42,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e7e717a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:09:42, skipping insertion in model container [2025-03-03 14:09:42,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:09:42" (1/1) ... [2025-03-03 14:09:42,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:09:42,252 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/nla-digbench-scaling/ps6-ll_unwindbound20.c[458,471] [2025-03-03 14:09:42,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:09:42,268 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:09:42,274 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/nla-digbench-scaling/ps6-ll_unwindbound20.c[458,471] [2025-03-03 14:09:42,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:09:42,286 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:09:42,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:09:42 WrapperNode [2025-03-03 14:09:42,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:09:42,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:09:42,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:09:42,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:09:42,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:09:42" (1/1) ... [2025-03-03 14:09:42,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:09:42" (1/1) ... [2025-03-03 14:09:42,307 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42 [2025-03-03 14:09:42,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:09:42,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:09:42,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:09:42,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:09:42,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:09:42" (1/1) ... [2025-03-03 14:09:42,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:09:42" (1/1) ... [2025-03-03 14:09:42,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:09:42" (1/1) ... [2025-03-03 14:09:42,326 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 14:09:42,326 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:09:42" (1/1) ... [2025-03-03 14:09:42,326 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:09:42" (1/1) ... [2025-03-03 14:09:42,331 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:09:42" (1/1) ... [2025-03-03 14:09:42,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:09:42" (1/1) ... [2025-03-03 14:09:42,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:09:42" (1/1) ... [2025-03-03 14:09:42,332 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:09:42" (1/1) ... [2025-03-03 14:09:42,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:09:42,334 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:09:42,335 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:09:42,335 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:09:42,336 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:09:42" (1/1) ... [2025-03-03 14:09:42,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:09:42,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:09:42,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:09:42,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:09:42,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:09:42,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:09:42,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:09:42,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:09:42,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 14:09:42,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 14:09:42,413 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:09:42,414 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:09:42,497 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-03-03 14:09:42,497 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:09:42,502 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:09:42,502 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:09:42,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:09:42 BoogieIcfgContainer [2025-03-03 14:09:42,503 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:09:42,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:09:42,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:09:42,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:09:42,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:09:42" (1/3) ... [2025-03-03 14:09:42,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@633a209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:09:42, skipping insertion in model container [2025-03-03 14:09:42,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:09:42" (2/3) ... [2025-03-03 14:09:42,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@633a209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:09:42, skipping insertion in model container [2025-03-03 14:09:42,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:09:42" (3/3) ... [2025-03-03 14:09:42,509 INFO L128 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound20.c [2025-03-03 14:09:42,520 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:09:42,521 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps6-ll_unwindbound20.c that has 2 procedures, 20 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:09:42,560 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:09:42,570 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;@5936b8c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:09:42,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:09:42,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 14:09:42,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 14:09:42,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:09:42,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:09:42,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:09:42,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:09:42,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1374089334, now seen corresponding path program 1 times [2025-03-03 14:09:42,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:09:42,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697035435] [2025-03-03 14:09:42,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:09:42,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:09:42,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 14:09:42,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 14:09:42,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:09:42,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:09:42,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:09:42,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:09:42,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697035435] [2025-03-03 14:09:42,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697035435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:09:42,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:09:42,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:09:42,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44225957] [2025-03-03 14:09:42,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:09:42,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:09:42,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:09:42,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:09:42,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:09:42,682 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:09:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:09:42,691 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2025-03-03 14:09:42,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:09:42,692 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-03 14:09:42,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:09:42,695 INFO L225 Difference]: With dead ends: 37 [2025-03-03 14:09:42,695 INFO L226 Difference]: Without dead ends: 16 [2025-03-03 14:09:42,696 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-03 14:09:42,698 INFO L435 NwaCegarLoop]: 23 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, 23 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-03 14:09:42,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:09:42,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-03 14:09:42,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-03 14:09:42,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:09:42,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2025-03-03 14:09:42,715 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2025-03-03 14:09:42,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:09:42,716 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-03-03 14:09:42,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:09:42,716 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2025-03-03 14:09:42,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 14:09:42,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:09:42,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:09:42,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:09:42,716 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:09:42,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:09:42,717 INFO L85 PathProgramCache]: Analyzing trace with hash 307831797, now seen corresponding path program 1 times [2025-03-03 14:09:42,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:09:42,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527327011] [2025-03-03 14:09:42,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:09:42,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:09:42,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 14:09:42,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 14:09:42,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:09:42,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:09:42,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [564489791] [2025-03-03 14:09:42,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:09:42,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:09:42,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:09:42,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:09:42,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:09:42,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 14:09:42,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 14:09:42,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:09:42,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:09:42,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 14:09:42,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:09:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:09:42,861 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:09:42,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:09:42,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527327011] [2025-03-03 14:09:42,862 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:09:42,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564489791] [2025-03-03 14:09:42,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564489791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:09:42,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:09:42,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:09:42,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62807777] [2025-03-03 14:09:42,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:09:42,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:09:42,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:09:42,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:09:42,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:09:42,863 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:09:42,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:09:42,897 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2025-03-03 14:09:42,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:09:42,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-03 14:09:42,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:09:42,898 INFO L225 Difference]: With dead ends: 28 [2025-03-03 14:09:42,899 INFO L226 Difference]: Without dead ends: 24 [2025-03-03 14:09:42,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:09:42,899 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:09:42,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 53 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:09:42,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-03 14:09:42,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-03 14:09:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 14:09:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-03-03 14:09:42,904 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2025-03-03 14:09:42,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:09:42,904 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-03-03 14:09:42,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:09:42,904 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-03-03 14:09:42,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 14:09:42,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:09:42,904 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:09:42,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:09:43,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:09:43,105 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:09:43,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:09:43,106 INFO L85 PathProgramCache]: Analyzing trace with hash 2146101144, now seen corresponding path program 1 times [2025-03-03 14:09:43,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:09:43,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255256379] [2025-03-03 14:09:43,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:09:43,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:09:43,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 14:09:43,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 14:09:43,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:09:43,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:09:43,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [864424987] [2025-03-03 14:09:43,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:09:43,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:09:43,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:09:43,135 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:09:43,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:09:43,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 14:09:43,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 14:09:43,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:09:43,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:09:43,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:09:43,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:09:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:09:43,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:09:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:09:43,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:09:43,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255256379] [2025-03-03 14:09:43,330 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:09:43,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864424987] [2025-03-03 14:09:43,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864424987] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 14:09:43,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:09:43,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-03-03 14:09:43,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040315148] [2025-03-03 14:09:43,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:09:43,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:09:43,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:09:43,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:09:43,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:09:43,331 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:09:43,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:09:43,369 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-03-03 14:09:43,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:09:43,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-03 14:09:43,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:09:43,370 INFO L225 Difference]: With dead ends: 30 [2025-03-03 14:09:43,370 INFO L226 Difference]: Without dead ends: 26 [2025-03-03 14:09:43,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:09:43,371 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:09:43,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 47 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:09:43,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-03 14:09:43,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-03 14:09:43,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 14:09:43,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-03-03 14:09:43,380 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2025-03-03 14:09:43,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:09:43,380 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-03-03 14:09:43,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:09:43,381 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-03-03 14:09:43,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 14:09:43,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:09:43,381 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:09:43,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:09:43,582 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,SelfDestructingSolverStorable2 [2025-03-03 14:09:43,582 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:09:43,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:09:43,583 INFO L85 PathProgramCache]: Analyzing trace with hash 508371036, now seen corresponding path program 1 times [2025-03-03 14:09:43,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:09:43,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965589314] [2025-03-03 14:09:43,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:09:43,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:09:43,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 14:09:43,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 14:09:43,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:09:43,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:09:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:09:43,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:09:43,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965589314] [2025-03-03 14:09:43,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965589314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:09:43,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554880027] [2025-03-03 14:09:43,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:09:43,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:09:43,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:09:43,724 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:09:43,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:09:43,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 14:09:43,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 14:09:43,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:09:43,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:09:43,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:09:43,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:09:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:09:43,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:09:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:09:43,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554880027] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:09:43,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:09:43,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2025-03-03 14:09:43,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545185783] [2025-03-03 14:09:43,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:09:43,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:09:43,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:09:43,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:09:43,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:09:43,830 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 14:09:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:09:43,894 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2025-03-03 14:09:43,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:09:43,895 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 23 [2025-03-03 14:09:43,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:09:43,895 INFO L225 Difference]: With dead ends: 66 [2025-03-03 14:09:43,895 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 14:09:43,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:09:43,896 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:09:43,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 73 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:09:43,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 14:09:43,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2025-03-03 14:09:43,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 14:09:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2025-03-03 14:09:43,911 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 23 [2025-03-03 14:09:43,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:09:43,912 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2025-03-03 14:09:43,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 14:09:43,912 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2025-03-03 14:09:43,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 14:09:43,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:09:43,913 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:09:43,919 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-03 14:09:44,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:09:44,118 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:09:44,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:09:44,118 INFO L85 PathProgramCache]: Analyzing trace with hash -674071302, now seen corresponding path program 1 times [2025-03-03 14:09:44,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:09:44,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681148353] [2025-03-03 14:09:44,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:09:44,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:09:44,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 14:09:44,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 14:09:44,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:09:44,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:09:44,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1181341590] [2025-03-03 14:09:44,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:09:44,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:09:44,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:09:44,144 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:09:44,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:09:44,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 14:09:44,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 14:09:44,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:09:44,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:09:44,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:09:44,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:09:44,246 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:09:44,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:09:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:09:44,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:09:44,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681148353] [2025-03-03 14:09:44,334 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:09:44,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181341590] [2025-03-03 14:09:44,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181341590] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:09:44,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:09:44,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-03 14:09:44,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330318861] [2025-03-03 14:09:44,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:09:44,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:09:44,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:09:44,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:09:44,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:09:44,335 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 14:09:44,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:09:44,420 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2025-03-03 14:09:44,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:09:44,420 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2025-03-03 14:09:44,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:09:44,421 INFO L225 Difference]: With dead ends: 55 [2025-03-03 14:09:44,421 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 14:09:44,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:09:44,422 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:09:44,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 139 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:09:44,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 14:09:44,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-03 14:09:44,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 14:09:44,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2025-03-03 14:09:44,431 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 29 [2025-03-03 14:09:44,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:09:44,432 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2025-03-03 14:09:44,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 14:09:44,432 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2025-03-03 14:09:44,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 14:09:44,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:09:44,433 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:09:44,438 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-03 14:09:44,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:09:44,633 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:09:44,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:09:44,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1925320429, now seen corresponding path program 2 times [2025-03-03 14:09:44,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:09:44,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967839201] [2025-03-03 14:09:44,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:09:44,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:09:44,643 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-03 14:09:44,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 14:09:44,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:09:44,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:09:44,809 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 14:09:44,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:09:44,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967839201] [2025-03-03 14:09:44,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967839201] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:09:44,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346560223] [2025-03-03 14:09:44,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:09:44,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:09:44,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:09:44,812 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:09:44,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:09:44,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-03 14:09:44,853 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 14:09:44,853 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:09:44,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:09:44,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:09:44,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:09:44,905 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:09:44,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:09:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 14:09:45,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346560223] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:09:45,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:09:45,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 16 [2025-03-03 14:09:45,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967557406] [2025-03-03 14:09:45,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:09:45,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 14:09:45,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:09:45,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 14:09:45,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:09:45,010 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 9 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2025-03-03 14:09:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:09:45,198 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2025-03-03 14:09:45,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 14:09:45,199 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 9 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) Word has length 47 [2025-03-03 14:09:45,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:09:45,200 INFO L225 Difference]: With dead ends: 132 [2025-03-03 14:09:45,200 INFO L226 Difference]: Without dead ends: 122 [2025-03-03 14:09:45,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2025-03-03 14:09:45,201 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 77 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:09:45,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 128 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:09:45,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-03 14:09:45,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 97. [2025-03-03 14:09:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 14:09:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2025-03-03 14:09:45,224 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 47 [2025-03-03 14:09:45,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:09:45,224 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2025-03-03 14:09:45,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 9 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2025-03-03 14:09:45,224 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2025-03-03 14:09:45,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 14:09:45,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:09:45,226 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:09:45,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:09:45,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:09:45,427 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:09:45,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:09:45,427 INFO L85 PathProgramCache]: Analyzing trace with hash 863742065, now seen corresponding path program 2 times [2025-03-03 14:09:45,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:09:45,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935692595] [2025-03-03 14:09:45,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:09:45,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:09:45,432 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-03 14:09:45,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 14:09:45,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:09:45,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:09:45,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1119718996] [2025-03-03 14:09:45,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:09:45,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:09:45,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:09:45,454 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:09:45,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:09:45,477 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-03 14:09:45,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 14:09:45,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:09:45,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:09:45,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 14:09:45,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:09:45,685 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 14:09:45,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:09:45,911 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 14:09:45,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:09:45,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935692595] [2025-03-03 14:09:45,912 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:09:45,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119718996] [2025-03-03 14:09:45,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119718996] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:09:45,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:09:45,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2025-03-03 14:09:45,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491652454] [2025-03-03 14:09:45,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:09:45,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 14:09:45,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:09:45,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 14:09:45,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:09:45,913 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand has 20 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 14:09:46,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:09:46,256 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2025-03-03 14:09:46,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 14:09:46,257 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 53 [2025-03-03 14:09:46,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:09:46,257 INFO L225 Difference]: With dead ends: 103 [2025-03-03 14:09:46,257 INFO L226 Difference]: Without dead ends: 92 [2025-03-03 14:09:46,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2025-03-03 14:09:46,258 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:09:46,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 325 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:09:46,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-03 14:09:46,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-03 14:09:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 14:09:46,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2025-03-03 14:09:46,280 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 53 [2025-03-03 14:09:46,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:09:46,280 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2025-03-03 14:09:46,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 14:09:46,280 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2025-03-03 14:09:46,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 14:09:46,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:09:46,281 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:09:46,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 14:09:46,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:09:46,486 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:09:46,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:09:46,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1682248478, now seen corresponding path program 3 times [2025-03-03 14:09:46,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:09:46,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914193976] [2025-03-03 14:09:46,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:09:46,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:09:46,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 93 statements into 10 equivalence classes. [2025-03-03 14:09:46,541 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:09:46,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-03 14:09:46,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:09:46,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [164255631] [2025-03-03 14:09:46,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:09:46,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:09:46,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:09:46,544 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:09:46,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:09:46,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 93 statements into 10 equivalence classes. [2025-03-03 14:09:46,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:09:46,655 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-03 14:09:46,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:09:46,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-03 14:09:46,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:09:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 45 proven. 187 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-03 14:09:46,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:09:55,004 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (+ |c_ULTIMATE.start_main_~y~0#1| .cse0) (+ |c_ULTIMATE.start_main_~c~0#1| (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false [2025-03-03 14:10:07,054 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 14:10:19,070 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 14:10:27,100 WARN L873 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39|))) (or (= (+ |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_26| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_26|)) (+ |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| .cse0)) (= (mod (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| 7) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| 10) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| 6)) 12) 0))))) is different from true [2025-03-03 14:10:39,120 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 14:10:55,151 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 14:11:03,172 WARN L873 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (= c___VERIFIER_assert_~cond 0) (forall ((|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39|))) (or (= (+ |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_26| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_26|)) (+ |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| .cse0)) (= (mod (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| 7) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| 10) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| 6)) 12) 0))))) is different from true [2025-03-03 14:11:19,217 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))) (= (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (+ (* |c_ULTIMATE.start_main_~c~0#1| 2) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|))))) is different from false