./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/ps5-ll.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/ps5-ll.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 1d0411df2a3b388d2db53c57aaa1f7219c19c9d74992ef1ed00eab4b9b56cbed --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:43:37,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:43:38,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:43:38,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:43:38,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:43:38,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:43:38,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:43:38,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:43:38,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:43:38,049 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:43:38,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:43:38,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:43:38,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:43:38,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:43:38,050 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:43:38,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:43:38,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:43:38,050 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:43:38,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:43:38,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:43:38,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:43:38,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:43:38,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:43:38,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:43:38,050 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:43:38,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:43:38,050 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:43:38,050 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:43:38,050 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:43:38,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:43:38,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:43:38,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:43:38,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:43:38,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:43:38,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:43:38,051 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:43:38,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:43:38,051 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:43:38,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:43:38,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:43:38,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:43:38,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:43:38,051 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:43:38,051 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 -> 1d0411df2a3b388d2db53c57aaa1f7219c19c9d74992ef1ed00eab4b9b56cbed [2025-03-03 13:43:38,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:43:38,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:43:38,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:43:38,288 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:43:38,288 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:43:38,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/ps5-ll.c [2025-03-03 13:43:39,348 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/999fdee79/3b4368cde1ba4ec29c3297cb1a2b6524/FLAG8e6a8bff6 [2025-03-03 13:43:39,561 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:43:39,562 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/ps5-ll.c [2025-03-03 13:43:39,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/999fdee79/3b4368cde1ba4ec29c3297cb1a2b6524/FLAG8e6a8bff6 [2025-03-03 13:43:39,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/999fdee79/3b4368cde1ba4ec29c3297cb1a2b6524 [2025-03-03 13:43:39,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:43:39,580 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:43:39,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:43:39,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:43:39,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:43:39,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:43:39" (1/1) ... [2025-03-03 13:43:39,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7da8b367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:39, skipping insertion in model container [2025-03-03 13:43:39,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:43:39" (1/1) ... [2025-03-03 13:43:39,594 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:43:39,682 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/ps5-ll.c[458,471] [2025-03-03 13:43:39,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:43:39,699 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:43:39,705 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/ps5-ll.c[458,471] [2025-03-03 13:43:39,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:43:39,717 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:43:39,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:39 WrapperNode [2025-03-03 13:43:39,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:43:39,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:43:39,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:43:39,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:43:39,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:39" (1/1) ... [2025-03-03 13:43:39,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:39" (1/1) ... [2025-03-03 13:43:39,742 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 35 [2025-03-03 13:43:39,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:43:39,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:43:39,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:43:39,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:43:39,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:39" (1/1) ... [2025-03-03 13:43:39,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:39" (1/1) ... [2025-03-03 13:43:39,751 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:39" (1/1) ... [2025-03-03 13:43:39,763 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 13:43:39,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:39" (1/1) ... [2025-03-03 13:43:39,763 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:39" (1/1) ... [2025-03-03 13:43:39,764 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:39" (1/1) ... [2025-03-03 13:43:39,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:39" (1/1) ... [2025-03-03 13:43:39,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:39" (1/1) ... [2025-03-03 13:43:39,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:39" (1/1) ... [2025-03-03 13:43:39,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:43:39,770 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:43:39,770 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:43:39,770 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:43:39,771 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:39" (1/1) ... [2025-03-03 13:43:39,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:43:39,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:43:39,794 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 13:43:39,797 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 13:43:39,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:43:39,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:43:39,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:43:39,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:43:39,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 13:43:39,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 13:43:39,855 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:43:39,856 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:43:39,974 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-03-03 13:43:39,974 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:43:39,983 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:43:39,986 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:43:39,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:43:39 BoogieIcfgContainer [2025-03-03 13:43:39,986 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:43:39,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:43:39,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:43:39,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:43:39,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:43:39" (1/3) ... [2025-03-03 13:43:39,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321c3477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:43:39, skipping insertion in model container [2025-03-03 13:43:39,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:43:39" (2/3) ... [2025-03-03 13:43:39,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321c3477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:43:39, skipping insertion in model container [2025-03-03 13:43:39,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:43:39" (3/3) ... [2025-03-03 13:43:39,993 INFO L128 eAbstractionObserver]: Analyzing ICFG ps5-ll.c [2025-03-03 13:43:40,005 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:43:40,007 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps5-ll.c that has 2 procedures, 18 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 13:43:40,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:43:40,062 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;@20d42c31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:43:40,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:43:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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 13:43:40,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 13:43:40,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:43:40,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:43:40,074 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:43:40,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:43:40,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1540419880, now seen corresponding path program 1 times [2025-03-03 13:43:40,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:43:40,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302251079] [2025-03-03 13:43:40,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:40,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:43:40,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:43:40,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:43:40,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:40,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:43:40,168 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 13:43:40,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:43:40,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302251079] [2025-03-03 13:43:40,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302251079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:43:40,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:43:40,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 13:43:40,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583705072] [2025-03-03 13:43:40,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:43:40,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:43:40,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:43:40,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:43:40,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:43:40,188 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 13:43:40,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:43:40,197 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2025-03-03 13:43:40,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:43:40,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 8 [2025-03-03 13:43:40,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:43:40,202 INFO L225 Difference]: With dead ends: 33 [2025-03-03 13:43:40,202 INFO L226 Difference]: Without dead ends: 14 [2025-03-03 13:43:40,203 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 13:43:40,205 INFO L435 NwaCegarLoop]: 20 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, 20 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 13:43:40,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:43:40,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-03 13:43:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-03 13:43:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 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 13:43:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2025-03-03 13:43:40,225 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2025-03-03 13:43:40,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:43:40,226 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-03-03 13:43:40,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 13:43:40,226 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2025-03-03 13:43:40,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 13:43:40,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:43:40,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:43:40,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:43:40,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:43:40,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:43:40,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1511790729, now seen corresponding path program 1 times [2025-03-03 13:43:40,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:43:40,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447068452] [2025-03-03 13:43:40,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:40,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:43:40,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:43:40,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:43:40,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:40,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:43:40,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [813547590] [2025-03-03 13:43:40,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:40,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:43:40,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:43:40,247 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 13:43:40,248 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 13:43:40,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:43:40,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:43:40,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:40,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:43:40,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:43:40,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:43:40,346 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 13:43:40,346 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:43:40,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:43:40,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447068452] [2025-03-03 13:43:40,346 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:43:40,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813547590] [2025-03-03 13:43:40,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813547590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:43:40,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:43:40,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:43:40,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705632937] [2025-03-03 13:43:40,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:43:40,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:43:40,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:43:40,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:43:40,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:43:40,348 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 13:43:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:43:40,385 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-03-03 13:43:40,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:43:40,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2025-03-03 13:43:40,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:43:40,386 INFO L225 Difference]: With dead ends: 24 [2025-03-03 13:43:40,386 INFO L226 Difference]: Without dead ends: 20 [2025-03-03 13:43:40,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 13:43:40,387 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 41 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 13:43:40,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 41 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:43:40,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-03 13:43:40,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-03 13:43:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 13:43:40,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-03-03 13:43:40,393 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 8 [2025-03-03 13:43:40,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:43:40,393 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-03-03 13:43:40,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 13:43:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-03-03 13:43:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 13:43:40,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:43:40,394 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:43:40,402 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 13:43:40,594 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 13:43:40,595 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:43:40,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:43:40,595 INFO L85 PathProgramCache]: Analyzing trace with hash 836718783, now seen corresponding path program 1 times [2025-03-03 13:43:40,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:43:40,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667144019] [2025-03-03 13:43:40,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:40,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:43:40,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 13:43:40,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 13:43:40,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:40,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:43:40,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1592454967] [2025-03-03 13:43:40,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:40,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:43:40,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:43:40,618 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 13:43:40,618 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 13:43:40,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 13:43:40,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 13:43:40,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:40,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:43:40,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 13:43:40,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:43:40,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:43:40,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:43:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:43:40,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:43:40,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667144019] [2025-03-03 13:43:40,792 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:43:40,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592454967] [2025-03-03 13:43:40,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592454967] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 13:43:40,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:43:40,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-03-03 13:43:40,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494817823] [2025-03-03 13:43:40,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:43:40,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:43:40,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:43:40,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:43:40,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:43:40,795 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 13:43:40,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:43:40,840 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2025-03-03 13:43:40,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:43:40,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 14 [2025-03-03 13:43:40,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:43:40,841 INFO L225 Difference]: With dead ends: 26 [2025-03-03 13:43:40,841 INFO L226 Difference]: Without dead ends: 22 [2025-03-03 13:43:40,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 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 13:43:40,842 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 38 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 13:43:40,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 38 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:43:40,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-03 13:43:40,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-03 13:43:40,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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 13:43:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2025-03-03 13:43:40,850 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 14 [2025-03-03 13:43:40,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:43:40,850 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2025-03-03 13:43:40,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 13:43:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2025-03-03 13:43:40,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 13:43:40,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:43:40,850 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:43:40,856 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 13:43:41,051 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 13:43:41,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:43:41,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:43:41,052 INFO L85 PathProgramCache]: Analyzing trace with hash -685322579, now seen corresponding path program 1 times [2025-03-03 13:43:41,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:43:41,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353245309] [2025-03-03 13:43:41,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:41,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:43:41,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 13:43:41,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:43:41,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:41,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:43:41,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [978148368] [2025-03-03 13:43:41,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:43:41,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:43:41,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:43:41,087 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 13:43:41,089 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 13:43:41,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 13:43:41,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:43:41,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:43:41,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:43:41,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 13:43:41,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:43:41,206 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:43:41,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:43:41,296 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:43:41,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:43:41,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353245309] [2025-03-03 13:43:41,296 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:43:41,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978148368] [2025-03-03 13:43:41,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978148368] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:43:41,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:43:41,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-03-03 13:43:41,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336368998] [2025-03-03 13:43:41,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:43:41,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 13:43:41,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:43:41,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 13:43:41,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:43:41,297 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 10 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 6 states have call successors, (8), 2 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 13:43:41,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:43:41,394 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2025-03-03 13:43:41,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:43:41,395 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 6 states have call successors, (8), 2 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 25 [2025-03-03 13:43:41,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:43:41,396 INFO L225 Difference]: With dead ends: 36 [2025-03-03 13:43:41,396 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 13:43:41,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:43:41,396 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:43:41,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:43:41,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 13:43:41,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-03 13:43:41,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:43:41,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-03 13:43:41,403 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2025-03-03 13:43:41,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:43:41,403 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-03 13:43:41,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 6 states have call successors, (8), 2 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 13:43:41,404 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-03-03 13:43:41,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 13:43:41,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:43:41,404 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:43:41,410 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 13:43:41,609 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 13:43:41,609 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:43:41,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:43:41,609 INFO L85 PathProgramCache]: Analyzing trace with hash -908443691, now seen corresponding path program 2 times [2025-03-03 13:43:41,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:43:41,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994539299] [2025-03-03 13:43:41,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:43:41,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:43:41,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-03 13:43:41,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 13:43:41,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:43:41,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:43:41,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072464294] [2025-03-03 13:43:41,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:43:41,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:43:41,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:43:41,671 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 13:43:41,672 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 13:43:41,696 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-03 13:43:41,713 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 13:43:41,713 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:43:41,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:43:41,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 13:43:41,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:43:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 13:43:41,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:43:42,125 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 13:43:42,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:43:42,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994539299] [2025-03-03 13:43:42,126 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:43:42,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072464294] [2025-03-03 13:43:42,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072464294] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:43:42,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:43:42,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2025-03-03 13:43:42,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980085980] [2025-03-03 13:43:42,126 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:43:42,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 13:43:42,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:43:42,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 13:43:42,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-03-03 13:43:42,129 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 20 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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 13:43:42,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:43:42,529 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2025-03-03 13:43:42,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 13:43:42,529 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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 43 [2025-03-03 13:43:42,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:43:42,530 INFO L225 Difference]: With dead ends: 46 [2025-03-03 13:43:42,530 INFO L226 Difference]: Without dead ends: 38 [2025-03-03 13:43:42,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 66 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 13:43:42,531 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:43:42,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 200 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:43:42,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-03 13:43:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-03 13:43:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 12 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 13:43:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2025-03-03 13:43:42,560 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 43 [2025-03-03 13:43:42,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:43:42,560 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2025-03-03 13:43:42,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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 13:43:42,561 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2025-03-03 13:43:42,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 13:43:42,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:43:42,562 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:43:42,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 13:43:42,762 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 13:43:42,762 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:43:42,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:43:42,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1103279213, now seen corresponding path program 3 times [2025-03-03 13:43:42,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:43:42,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134230806] [2025-03-03 13:43:42,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:43:42,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:43:42,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 10 equivalence classes. [2025-03-03 13:43:42,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 13:43:42,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-03 13:43:42,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:43:42,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1505713514] [2025-03-03 13:43:42,915 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:43:42,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:43:42,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:43:42,917 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 13:43:42,918 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 13:43:42,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 10 equivalence classes. [2025-03-03 13:43:42,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 13:43:42,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-03 13:43:42,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:43:43,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-03 13:43:43,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:43:43,207 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 39 proven. 103 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-03 13:43:43,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:43:49,345 WARN L286 SmtUtils]: Spent 5.96s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 13:43:53,347 WARN L851 $PredicateComparison]: unable to prove that (or (= (+ (* |c_ULTIMATE.start_main_~c~0#1| 3) (* |c_ULTIMATE.start_main_~c~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| 3))) (not (= (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| 15) (* |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| 29) (* |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)) 30) 0))) is different from false [2025-03-03 13:44:01,375 WARN L286 SmtUtils]: Spent 8.00s 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 13:44:13,401 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 13:44:29,434 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 13:44:33,447 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_28| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| Int)) (or (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| 29) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| 15) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| 6) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| 10)) 30) 0) (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_28|) (* |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_28| 3)) (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| 3)))))) is different from true [2025-03-03 13:44:49,480 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 13:45:05,505 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 13:45:09,510 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_28| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| Int)) (or (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| 29) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| 15) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| 6) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| 10)) 30) 0) (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_28|) (* |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_28| 3)) (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_41| 3))))) (= c___VERIFIER_assert_~cond 0)) is different from true