./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound5.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 5f094e7ea34d2025ab25ab51a4a0b06d8f845826c76dbd06e91f3d4a761fa19b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:11:58,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:11:58,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:11:58,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:11:58,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:11:58,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:11:58,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:11:58,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:11:58,328 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:11:58,329 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:11:58,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:11:58,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:11:58,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:11:58,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:11:58,330 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:11:58,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:11:58,330 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:11:58,330 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:11:58,330 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:11:58,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:11:58,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:11:58,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:11:58,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:11:58,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:11:58,331 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:11:58,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:11:58,331 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:11:58,331 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:11:58,331 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:11:58,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:11:58,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:11:58,331 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:11:58,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:11:58,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:11:58,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:11:58,332 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:11:58,332 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:11:58,332 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:11:58,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:11:58,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:11:58,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:11:58,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:11:58,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:11:58,332 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 -> 5f094e7ea34d2025ab25ab51a4a0b06d8f845826c76dbd06e91f3d4a761fa19b [2025-03-08 05:11:58,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:11:58,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:11:58,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:11:58,534 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:11:58,534 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:11:58,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound5.c [2025-03-08 05:11:59,629 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47402298/abe4068721b24149a003d9dd0be76f93/FLAG503ef980b [2025-03-08 05:11:59,835 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:11:59,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound5.c [2025-03-08 05:11:59,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47402298/abe4068721b24149a003d9dd0be76f93/FLAG503ef980b [2025-03-08 05:12:00,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47402298/abe4068721b24149a003d9dd0be76f93 [2025-03-08 05:12:00,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:12:00,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:12:00,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:12:00,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:12:00,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:12:00,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:12:00" (1/1) ... [2025-03-08 05:12:00,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7744d15f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:12:00, skipping insertion in model container [2025-03-08 05:12:00,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:12:00" (1/1) ... [2025-03-08 05:12:00,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:12:00,306 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/hard2_unwindbound5.c[526,539] [2025-03-08 05:12:00,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:12:00,322 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:12:00,328 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/hard2_unwindbound5.c[526,539] [2025-03-08 05:12:00,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:12:00,340 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:12:00,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:12:00 WrapperNode [2025-03-08 05:12:00,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:12:00,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:12:00,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:12:00,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:12:00,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:12:00" (1/1) ... [2025-03-08 05:12:00,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:12:00" (1/1) ... [2025-03-08 05:12:00,362 INFO L138 Inliner]: procedures = 14, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2025-03-08 05:12:00,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:12:00,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:12:00,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:12:00,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:12:00,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:12:00" (1/1) ... [2025-03-08 05:12:00,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:12:00" (1/1) ... [2025-03-08 05:12:00,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:12:00" (1/1) ... [2025-03-08 05:12:00,375 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-08 05:12:00,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:12:00" (1/1) ... [2025-03-08 05:12:00,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:12:00" (1/1) ... [2025-03-08 05:12:00,377 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:12:00" (1/1) ... [2025-03-08 05:12:00,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:12:00" (1/1) ... [2025-03-08 05:12:00,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:12:00" (1/1) ... [2025-03-08 05:12:00,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:12:00" (1/1) ... [2025-03-08 05:12:00,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:12:00,383 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:12:00,383 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:12:00,383 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:12:00,384 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:12:00" (1/1) ... [2025-03-08 05:12:00,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:12:00,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:12:00,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:12:00,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:12:00,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:12:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:12:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:12:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:12:00,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:12:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 05:12:00,427 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 05:12:00,467 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:12:00,468 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:12:00,599 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-03-08 05:12:00,600 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:12:00,607 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:12:00,607 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:12:00,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:12:00 BoogieIcfgContainer [2025-03-08 05:12:00,607 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:12:00,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:12:00,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:12:00,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:12:00,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:12:00" (1/3) ... [2025-03-08 05:12:00,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b1cc94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:12:00, skipping insertion in model container [2025-03-08 05:12:00,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:12:00" (2/3) ... [2025-03-08 05:12:00,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b1cc94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:12:00, skipping insertion in model container [2025-03-08 05:12:00,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:12:00" (3/3) ... [2025-03-08 05:12:00,615 INFO L128 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound5.c [2025-03-08 05:12:00,627 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:12:00,630 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard2_unwindbound5.c that has 2 procedures, 26 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 05:12:00,675 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:12:00,683 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;@58917bc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:12:00,684 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:12:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 05:12:00,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 05:12:00,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:12:00,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:12:00,691 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:12:00,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:12:00,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1337721167, now seen corresponding path program 1 times [2025-03-08 05:12:00,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:12:00,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489984229] [2025-03-08 05:12:00,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:00,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:12:00,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 05:12:00,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 05:12:00,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:00,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:12:00,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:12:00,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:12:00,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489984229] [2025-03-08 05:12:00,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489984229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:12:00,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:12:00,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:12:00,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405999553] [2025-03-08 05:12:00,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:12:00,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:12:00,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:12:00,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:12:00,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:12:00,946 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 5 states, 5 states have (on average 1.4) 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-08 05:12:01,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:12:01,013 INFO L93 Difference]: Finished difference Result 64 states and 109 transitions. [2025-03-08 05:12:01,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:12:01,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) 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-08 05:12:01,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:12:01,018 INFO L225 Difference]: With dead ends: 64 [2025-03-08 05:12:01,018 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 05:12:01,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-08 05:12:01,023 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 13 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:12:01,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 112 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:12:01,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 05:12:01,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2025-03-08 05:12:01,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 2 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-08 05:12:01,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-03-08 05:12:01,051 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 8 [2025-03-08 05:12:01,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:12:01,052 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-03-08 05:12:01,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) 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-08 05:12:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2025-03-08 05:12:01,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 05:12:01,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:12:01,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:12:01,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:12:01,054 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:12:01,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:12:01,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1248916916, now seen corresponding path program 1 times [2025-03-08 05:12:01,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:12:01,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960791016] [2025-03-08 05:12:01,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:01,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:12:01,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 05:12:01,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 05:12:01,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:01,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:12:01,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:12:01,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:12:01,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960791016] [2025-03-08 05:12:01,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960791016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:12:01,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:12:01,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:12:01,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070551394] [2025-03-08 05:12:01,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:12:01,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:12:01,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:12:01,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:12:01,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:12:01,114 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-08 05:12:01,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:12:01,130 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2025-03-08 05:12:01,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:12:01,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-08 05:12:01,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:12:01,131 INFO L225 Difference]: With dead ends: 42 [2025-03-08 05:12:01,132 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 05:12:01,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:12:01,132 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:12:01,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:12:01,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 05:12:01,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-08 05:12:01,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 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-08 05:12:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-03-08 05:12:01,139 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 10 [2025-03-08 05:12:01,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:12:01,139 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-03-08 05:12:01,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-08 05:12:01,140 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-03-08 05:12:01,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 05:12:01,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:12:01,140 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:12:01,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:12:01,140 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:12:01,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:12:01,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1610903053, now seen corresponding path program 1 times [2025-03-08 05:12:01,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:12:01,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109431018] [2025-03-08 05:12:01,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:01,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:12:01,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 05:12:01,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 05:12:01,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:01,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:12:01,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:12:01,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:12:01,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109431018] [2025-03-08 05:12:01,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109431018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:12:01,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:12:01,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:12:01,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55566718] [2025-03-08 05:12:01,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:12:01,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:12:01,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:12:01,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:12:01,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:12:01,228 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-08 05:12:01,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:12:01,279 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2025-03-08 05:12:01,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:12:01,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 13 [2025-03-08 05:12:01,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:12:01,280 INFO L225 Difference]: With dead ends: 42 [2025-03-08 05:12:01,283 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 05:12:01,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-08 05:12:01,284 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:12:01,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 94 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:12:01,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 05:12:01,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2025-03-08 05:12:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 05:12:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-03-08 05:12:01,292 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2025-03-08 05:12:01,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:12:01,292 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-03-08 05:12:01,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-08 05:12:01,292 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-03-08 05:12:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 05:12:01,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:12:01,292 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:12:01,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:12:01,293 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:12:01,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:12:01,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1890824207, now seen corresponding path program 1 times [2025-03-08 05:12:01,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:12:01,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047260934] [2025-03-08 05:12:01,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:01,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:12:01,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 05:12:01,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 05:12:01,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:01,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:12:01,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [746166663] [2025-03-08 05:12:01,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:01,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:12:01,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:12:01,305 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:12:01,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:12:01,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 05:12:01,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 05:12:01,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:01,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:12:01,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 05:12:01,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:12:01,464 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:12:01,465 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:12:01,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:12:01,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047260934] [2025-03-08 05:12:01,466 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:12:01,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746166663] [2025-03-08 05:12:01,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746166663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:12:01,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:12:01,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:12:01,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107207756] [2025-03-08 05:12:01,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:12:01,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:12:01,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:12:01,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:12:01,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:12:01,468 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:12:01,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:12:01,539 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2025-03-08 05:12:01,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:12:01,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-08 05:12:01,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:12:01,540 INFO L225 Difference]: With dead ends: 61 [2025-03-08 05:12:01,540 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 05:12:01,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-08 05:12:01,541 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:12:01,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 98 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:12:01,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 05:12:01,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-08 05:12:01,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 05:12:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2025-03-08 05:12:01,554 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 18 [2025-03-08 05:12:01,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:12:01,554 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2025-03-08 05:12:01,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:12:01,554 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2025-03-08 05:12:01,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 05:12:01,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:12:01,555 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:12:01,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:12:01,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:12:01,759 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:12:01,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:12:01,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1939108053, now seen corresponding path program 1 times [2025-03-08 05:12:01,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:12:01,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614867663] [2025-03-08 05:12:01,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:01,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:12:01,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 05:12:01,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 05:12:01,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:01,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:12:01,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [397139160] [2025-03-08 05:12:01,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:01,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:12:01,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:12:01,773 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:12:01,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:12:01,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 05:12:01,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 05:12:01,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:01,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:12:01,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 05:12:01,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:12:01,883 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:12:01,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:12:02,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:12:02,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:12:02,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614867663] [2025-03-08 05:12:02,018 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:12:02,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397139160] [2025-03-08 05:12:02,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397139160] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:12:02,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:12:02,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-03-08 05:12:02,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282681033] [2025-03-08 05:12:02,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:12:02,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:12:02,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:12:02,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:12:02,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:12:02,019 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 05:12:02,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:12:02,097 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2025-03-08 05:12:02,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:12:02,098 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2025-03-08 05:12:02,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:12:02,099 INFO L225 Difference]: With dead ends: 64 [2025-03-08 05:12:02,099 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 05:12:02,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:12:02,100 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 22 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:12:02,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 80 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:12:02,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 05:12:02,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2025-03-08 05:12:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 05:12:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2025-03-08 05:12:02,108 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 26 [2025-03-08 05:12:02,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:12:02,108 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2025-03-08 05:12:02,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 05:12:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2025-03-08 05:12:02,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 05:12:02,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:12:02,109 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:12:02,115 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-08 05:12:02,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:12:02,309 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:12:02,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:12:02,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1363596918, now seen corresponding path program 1 times [2025-03-08 05:12:02,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:12:02,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437328887] [2025-03-08 05:12:02,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:02,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:12:02,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 05:12:02,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 05:12:02,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:02,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:12:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:12:02,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:12:02,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437328887] [2025-03-08 05:12:02,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437328887] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:12:02,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354374563] [2025-03-08 05:12:02,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:02,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:12:02,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:12:02,405 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:12:02,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:12:02,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 05:12:02,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 05:12:02,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:02,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:12:02,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 05:12:02,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:12:02,473 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:12:02,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:12:02,519 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:12:02,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354374563] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:12:02,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:12:02,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2025-03-08 05:12:02,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554609298] [2025-03-08 05:12:02,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:12:02,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:12:02,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:12:02,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:12:02,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:12:02,520 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:12:02,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:12:02,619 INFO L93 Difference]: Finished difference Result 155 states and 190 transitions. [2025-03-08 05:12:02,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:12:02,619 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 33 [2025-03-08 05:12:02,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:12:02,620 INFO L225 Difference]: With dead ends: 155 [2025-03-08 05:12:02,620 INFO L226 Difference]: Without dead ends: 130 [2025-03-08 05:12:02,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:12:02,621 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 47 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:12:02,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 144 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:12:02,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-08 05:12:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 123. [2025-03-08 05:12:02,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 83 states have internal predecessors, (95), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 05:12:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 146 transitions. [2025-03-08 05:12:02,638 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 146 transitions. Word has length 33 [2025-03-08 05:12:02,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:12:02,638 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 146 transitions. [2025-03-08 05:12:02,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:12:02,638 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 146 transitions. [2025-03-08 05:12:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 05:12:02,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:12:02,639 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-08 05:12:02,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:12:02,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:12:02,843 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:12:02,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:12:02,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1138305543, now seen corresponding path program 1 times [2025-03-08 05:12:02,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:12:02,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854394929] [2025-03-08 05:12:02,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:02,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:12:02,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 05:12:02,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 05:12:02,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:02,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:12:02,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1381889974] [2025-03-08 05:12:02,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:02,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:12:02,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:12:02,860 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:12:02,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:12:02,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 05:12:02,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 05:12:02,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:02,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:12:02,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 05:12:02,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:12:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 05:12:02,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:12:03,038 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 05:12:03,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:12:03,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854394929] [2025-03-08 05:12:03,039 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:12:03,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381889974] [2025-03-08 05:12:03,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381889974] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 05:12:03,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:12:03,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-03-08 05:12:03,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593710526] [2025-03-08 05:12:03,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:12:03,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:12:03,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:12:03,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:12:03,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:12:03,040 INFO L87 Difference]: Start difference. First operand 123 states and 146 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 05:12:03,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:12:03,617 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2025-03-08 05:12:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:12:03,617 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2025-03-08 05:12:03,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:12:03,618 INFO L225 Difference]: With dead ends: 146 [2025-03-08 05:12:03,618 INFO L226 Difference]: Without dead ends: 140 [2025-03-08 05:12:03,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:12:03,619 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 05:12:03,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 92 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 05:12:03,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-08 05:12:03,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2025-03-08 05:12:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 86 states have (on average 1.1744186046511629) internal successors, (101), 90 states have internal predecessors, (101), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 05:12:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 155 transitions. [2025-03-08 05:12:03,643 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 155 transitions. Word has length 36 [2025-03-08 05:12:03,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:12:03,643 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 155 transitions. [2025-03-08 05:12:03,643 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 05:12:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 155 transitions. [2025-03-08 05:12:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 05:12:03,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:12:03,644 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:12:03,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:12:03,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:12:03,845 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:12:03,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:12:03,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1167569937, now seen corresponding path program 1 times [2025-03-08 05:12:03,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:12:03,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382830017] [2025-03-08 05:12:03,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:03,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:12:03,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 05:12:03,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 05:12:03,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:03,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:12:03,931 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 05:12:03,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:12:03,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382830017] [2025-03-08 05:12:03,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382830017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:12:03,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:12:03,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:12:03,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798239064] [2025-03-08 05:12:03,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:12:03,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:12:03,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:12:03,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:12:03,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:12:03,933 INFO L87 Difference]: Start difference. First operand 132 states and 155 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 05:12:03,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:12:03,964 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2025-03-08 05:12:03,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:12:03,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2025-03-08 05:12:03,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:12:03,965 INFO L225 Difference]: With dead ends: 137 [2025-03-08 05:12:03,965 INFO L226 Difference]: Without dead ends: 118 [2025-03-08 05:12:03,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-08 05:12:03,966 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:12:03,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 111 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:12:03,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-08 05:12:03,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-08 05:12:03,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 80 states have internal predecessors, (91), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 05:12:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2025-03-08 05:12:03,981 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 42 [2025-03-08 05:12:03,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:12:03,981 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2025-03-08 05:12:03,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 05:12:03,981 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2025-03-08 05:12:03,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 05:12:03,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:12:03,982 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:12:03,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:12:03,982 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:12:03,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:12:03,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2110847750, now seen corresponding path program 1 times [2025-03-08 05:12:03,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:12:03,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301973743] [2025-03-08 05:12:03,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:03,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:12:03,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 05:12:03,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 05:12:03,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:03,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:12:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 05:12:04,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:12:04,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301973743] [2025-03-08 05:12:04,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301973743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:12:04,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074345866] [2025-03-08 05:12:04,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:04,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:12:04,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:12:04,056 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:12:04,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:12:04,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 05:12:04,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 05:12:04,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:04,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:12:04,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 05:12:04,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:12:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 05:12:04,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:12:04,200 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 05:12:04,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074345866] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:12:04,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:12:04,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 9 [2025-03-08 05:12:04,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882239134] [2025-03-08 05:12:04,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:12:04,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:12:04,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:12:04,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:12:04,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:12:04,202 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-08 05:12:04,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:12:04,307 INFO L93 Difference]: Finished difference Result 194 states and 232 transitions. [2025-03-08 05:12:04,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:12:04,308 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 49 [2025-03-08 05:12:04,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:12:04,309 INFO L225 Difference]: With dead ends: 194 [2025-03-08 05:12:04,309 INFO L226 Difference]: Without dead ends: 173 [2025-03-08 05:12:04,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:12:04,309 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 51 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:12:04,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 182 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:12:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-08 05:12:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 168. [2025-03-08 05:12:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 110 states have (on average 1.1818181818181819) internal successors, (130), 116 states have internal predecessors, (130), 37 states have call successors, (37), 21 states have call predecessors, (37), 20 states have return successors, (34), 30 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 05:12:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 201 transitions. [2025-03-08 05:12:04,332 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 201 transitions. Word has length 49 [2025-03-08 05:12:04,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:12:04,333 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 201 transitions. [2025-03-08 05:12:04,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-08 05:12:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 201 transitions. [2025-03-08 05:12:04,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 05:12:04,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:12:04,336 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:12:04,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:12:04,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:12:04,538 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:12:04,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:12:04,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1455298504, now seen corresponding path program 1 times [2025-03-08 05:12:04,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:12:04,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865082126] [2025-03-08 05:12:04,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:04,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:12:04,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 05:12:04,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 05:12:04,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:04,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:12:04,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [14700417] [2025-03-08 05:12:04,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:04,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:12:04,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:12:04,555 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:12:04,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:12:04,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 05:12:04,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 05:12:04,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:04,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:12:04,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 05:12:04,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:12:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-08 05:12:04,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:12:05,801 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-08 05:12:05,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:12:05,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865082126] [2025-03-08 05:12:05,801 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:12:05,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14700417] [2025-03-08 05:12:05,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14700417] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:12:05,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:12:05,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-03-08 05:12:05,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093418288] [2025-03-08 05:12:05,802 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:12:05,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 05:12:05,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:12:05,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 05:12:05,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:12:05,803 INFO L87 Difference]: Start difference. First operand 168 states and 201 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-08 05:12:06,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:12:06,312 INFO L93 Difference]: Finished difference Result 261 states and 330 transitions. [2025-03-08 05:12:06,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 05:12:06,312 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 58 [2025-03-08 05:12:06,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:12:06,314 INFO L225 Difference]: With dead ends: 261 [2025-03-08 05:12:06,314 INFO L226 Difference]: Without dead ends: 223 [2025-03-08 05:12:06,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-03-08 05:12:06,315 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 44 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:12:06,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 271 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:12:06,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-08 05:12:06,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 210. [2025-03-08 05:12:06,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 141 states have (on average 1.2127659574468086) internal successors, (171), 148 states have internal predecessors, (171), 44 states have call successors, (44), 24 states have call predecessors, (44), 24 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 05:12:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 257 transitions. [2025-03-08 05:12:06,355 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 257 transitions. Word has length 58 [2025-03-08 05:12:06,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:12:06,355 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 257 transitions. [2025-03-08 05:12:06,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-08 05:12:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 257 transitions. [2025-03-08 05:12:06,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 05:12:06,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:12:06,356 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:12:06,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 05:12:06,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:12:06,557 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:12:06,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:12:06,557 INFO L85 PathProgramCache]: Analyzing trace with hash -284772378, now seen corresponding path program 1 times [2025-03-08 05:12:06,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:12:06,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170354854] [2025-03-08 05:12:06,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:06,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:12:06,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 05:12:06,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 05:12:06,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:06,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:12:06,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1889300201] [2025-03-08 05:12:06,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:06,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:12:06,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:12:06,579 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:12:06,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 05:12:06,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 05:12:06,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 05:12:06,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:06,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:12:06,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 05:12:06,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:12:06,840 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 19 proven. 39 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-08 05:12:06,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:12:07,248 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 19 proven. 39 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-08 05:12:07,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:12:07,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170354854] [2025-03-08 05:12:07,248 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:12:07,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889300201] [2025-03-08 05:12:07,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889300201] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:12:07,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:12:07,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2025-03-08 05:12:07,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839716524] [2025-03-08 05:12:07,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:12:07,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 05:12:07,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:12:07,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 05:12:07,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:12:07,250 INFO L87 Difference]: Start difference. First operand 210 states and 257 transitions. Second operand has 16 states, 14 states have (on average 3.0) internal successors, (42), 15 states have internal predecessors, (42), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-08 05:12:07,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:12:07,559 INFO L93 Difference]: Finished difference Result 264 states and 328 transitions. [2025-03-08 05:12:07,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:12:07,560 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.0) internal successors, (42), 15 states have internal predecessors, (42), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 69 [2025-03-08 05:12:07,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:12:07,561 INFO L225 Difference]: With dead ends: 264 [2025-03-08 05:12:07,561 INFO L226 Difference]: Without dead ends: 220 [2025-03-08 05:12:07,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-08 05:12:07,562 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 28 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:12:07,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 236 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:12:07,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-08 05:12:07,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 193. [2025-03-08 05:12:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 135 states have internal predecessors, (152), 38 states have call successors, (38), 25 states have call predecessors, (38), 24 states have return successors, (36), 32 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 05:12:07,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2025-03-08 05:12:07,588 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 69 [2025-03-08 05:12:07,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:12:07,588 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2025-03-08 05:12:07,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.0) internal successors, (42), 15 states have internal predecessors, (42), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-08 05:12:07,589 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2025-03-08 05:12:07,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 05:12:07,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:12:07,590 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:12:07,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 05:12:07,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:12:07,794 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:12:07,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:12:07,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1844647172, now seen corresponding path program 1 times [2025-03-08 05:12:07,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:12:07,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974958639] [2025-03-08 05:12:07,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:07,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:12:07,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 05:12:07,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 05:12:07,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:07,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:12:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 05:12:08,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:12:08,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974958639] [2025-03-08 05:12:08,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974958639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:12:08,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890149533] [2025-03-08 05:12:08,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:08,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:12:08,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:12:08,032 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:12:08,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 05:12:08,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 05:12:08,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 05:12:08,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:08,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:12:08,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 05:12:08,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:12:08,189 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 05:12:08,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:12:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 05:12:08,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890149533] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:12:08,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:12:08,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-08 05:12:08,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916956730] [2025-03-08 05:12:08,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:12:08,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 05:12:08,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:12:08,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 05:12:08,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:12:08,468 INFO L87 Difference]: Start difference. First operand 193 states and 226 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 7 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2025-03-08 05:12:08,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:12:08,617 INFO L93 Difference]: Finished difference Result 217 states and 253 transitions. [2025-03-08 05:12:08,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:12:08,618 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 7 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) Word has length 74 [2025-03-08 05:12:08,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:12:08,619 INFO L225 Difference]: With dead ends: 217 [2025-03-08 05:12:08,619 INFO L226 Difference]: Without dead ends: 165 [2025-03-08 05:12:08,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 140 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:12:08,619 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 13 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:12:08,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 253 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:12:08,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-08 05:12:08,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 160. [2025-03-08 05:12:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 108 states have (on average 1.1574074074074074) internal successors, (125), 111 states have internal predecessors, (125), 31 states have call successors, (31), 20 states have call predecessors, (31), 20 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 05:12:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 186 transitions. [2025-03-08 05:12:08,642 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 186 transitions. Word has length 74 [2025-03-08 05:12:08,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:12:08,642 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 186 transitions. [2025-03-08 05:12:08,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 7 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2025-03-08 05:12:08,643 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 186 transitions. [2025-03-08 05:12:08,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 05:12:08,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:12:08,644 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:12:08,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 05:12:08,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 05:12:08,845 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:12:08,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:12:08,845 INFO L85 PathProgramCache]: Analyzing trace with hash -785921239, now seen corresponding path program 1 times [2025-03-08 05:12:08,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:12:08,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147660979] [2025-03-08 05:12:08,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:08,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:12:08,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 05:12:08,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:12:08,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:08,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:12:08,965 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 05:12:08,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:12:08,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147660979] [2025-03-08 05:12:08,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147660979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:12:08,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727500287] [2025-03-08 05:12:08,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:08,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:12:08,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:12:08,968 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:12:08,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 05:12:08,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 05:12:09,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:12:09,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:09,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:12:09,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:12:09,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:12:09,071 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 72 proven. 260 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 05:12:09,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:12:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 05:12:09,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727500287] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:12:09,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:12:09,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 8 [2025-03-08 05:12:09,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628621027] [2025-03-08 05:12:09,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:12:09,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:12:09,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:12:09,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:12:09,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:12:09,146 INFO L87 Difference]: Start difference. First operand 160 states and 186 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 5 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2025-03-08 05:12:09,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:12:09,231 INFO L93 Difference]: Finished difference Result 218 states and 264 transitions. [2025-03-08 05:12:09,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:12:09,231 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 5 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) Word has length 87 [2025-03-08 05:12:09,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:12:09,232 INFO L225 Difference]: With dead ends: 218 [2025-03-08 05:12:09,232 INFO L226 Difference]: Without dead ends: 162 [2025-03-08 05:12:09,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 168 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:12:09,232 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:12:09,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 110 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:12:09,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-08 05:12:09,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-03-08 05:12:09,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 110 states have (on average 1.1545454545454545) internal successors, (127), 113 states have internal predecessors, (127), 31 states have call successors, (31), 20 states have call predecessors, (31), 20 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 05:12:09,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2025-03-08 05:12:09,253 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 87 [2025-03-08 05:12:09,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:12:09,253 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2025-03-08 05:12:09,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 5 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2025-03-08 05:12:09,254 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2025-03-08 05:12:09,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 05:12:09,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:12:09,254 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-08 05:12:09,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 05:12:09,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 05:12:09,459 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:12:09,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:12:09,459 INFO L85 PathProgramCache]: Analyzing trace with hash 808388229, now seen corresponding path program 2 times [2025-03-08 05:12:09,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:12:09,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484145365] [2025-03-08 05:12:09,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:12:09,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:12:09,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-03-08 05:12:09,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:12:09,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:12:09,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:12:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 05:12:09,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:12:09,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484145365] [2025-03-08 05:12:09,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484145365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:12:09,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874001553] [2025-03-08 05:12:09,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:12:09,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:12:09,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:12:09,613 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:12:09,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 05:12:09,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-03-08 05:12:09,662 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:12:09,662 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:12:09,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:12:09,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 05:12:09,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:12:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 322 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 05:12:09,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:12:09,840 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 05:12:09,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874001553] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:12:09,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:12:09,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 9 [2025-03-08 05:12:09,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575972928] [2025-03-08 05:12:09,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:12:09,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:12:09,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:12:09,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:12:09,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:12:09,841 INFO L87 Difference]: Start difference. First operand 162 states and 188 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 6 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2025-03-08 05:12:09,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:12:09,926 INFO L93 Difference]: Finished difference Result 209 states and 246 transitions. [2025-03-08 05:12:09,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:12:09,926 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 6 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) Word has length 90 [2025-03-08 05:12:09,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:12:09,927 INFO L225 Difference]: With dead ends: 209 [2025-03-08 05:12:09,927 INFO L226 Difference]: Without dead ends: 155 [2025-03-08 05:12:09,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 174 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:12:09,928 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 47 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:12:09,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 193 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:12:09,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-08 05:12:09,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2025-03-08 05:12:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 98 states have (on average 1.0816326530612246) internal successors, (106), 101 states have internal predecessors, (106), 26 states have call successors, (26), 20 states have call predecessors, (26), 20 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 05:12:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2025-03-08 05:12:09,947 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 90 [2025-03-08 05:12:09,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:12:09,947 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2025-03-08 05:12:09,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 6 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2025-03-08 05:12:09,948 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2025-03-08 05:12:09,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 05:12:09,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:12:09,948 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:12:09,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 05:12:10,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 05:12:10,153 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:12:10,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:12:10,153 INFO L85 PathProgramCache]: Analyzing trace with hash 809192586, now seen corresponding path program 1 times [2025-03-08 05:12:10,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:12:10,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564954824] [2025-03-08 05:12:10,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:10,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:12:10,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:12:10,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:12:10,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:10,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:12:10,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [744915686] [2025-03-08 05:12:10,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:12:10,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:12:10,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:12:10,185 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:12:10,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 05:12:10,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:12:10,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:12:10,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:10,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:12:10,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-08 05:12:10,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:12:10,541 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-08 05:12:10,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:12:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-08 05:12:23,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:12:23,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564954824] [2025-03-08 05:12:23,560 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:12:23,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744915686] [2025-03-08 05:12:23,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744915686] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:12:23,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:12:23,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2025-03-08 05:12:23,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653371995] [2025-03-08 05:12:23,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:12:23,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 05:12:23,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:12:23,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 05:12:23,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:12:23,561 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 23 states have internal predecessors, (54), 13 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) [2025-03-08 05:12:24,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:12:24,361 INFO L93 Difference]: Finished difference Result 181 states and 196 transitions. [2025-03-08 05:12:24,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 05:12:24,361 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 23 states have internal predecessors, (54), 13 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) Word has length 90 [2025-03-08 05:12:24,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:12:24,362 INFO L225 Difference]: With dead ends: 181 [2025-03-08 05:12:24,362 INFO L226 Difference]: Without dead ends: 179 [2025-03-08 05:12:24,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2025-03-08 05:12:24,363 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 62 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:12:24,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 534 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:12:24,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-08 05:12:24,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 148. [2025-03-08 05:12:24,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 101 states have (on average 1.0792079207920793) internal successors, (109), 104 states have internal predecessors, (109), 25 states have call successors, (25), 21 states have call predecessors, (25), 21 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 05:12:24,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2025-03-08 05:12:24,390 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 90 [2025-03-08 05:12:24,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:12:24,390 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2025-03-08 05:12:24,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 23 states have internal predecessors, (54), 13 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) [2025-03-08 05:12:24,391 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2025-03-08 05:12:24,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 05:12:24,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:12:24,392 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:12:24,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 05:12:24,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 05:12:24,596 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:12:24,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:12:24,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1807410221, now seen corresponding path program 2 times [2025-03-08 05:12:24,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:12:24,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267642579] [2025-03-08 05:12:24,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:12:24,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:12:24,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-03-08 05:12:24,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:12:24,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:12:24,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:12:24,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [499908913] [2025-03-08 05:12:24,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:12:24,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:12:24,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:12:24,614 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:12:24,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 05:12:24,643 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-03-08 05:12:24,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:12:24,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:12:24,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:12:24,664 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 05:12:24,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 05:12:24,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:12:24,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:12:24,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:12:24,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 05:12:24,699 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 05:12:24,699 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:12:24,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-08 05:12:24,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 05:12:24,904 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:12:24,928 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:12:24,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:12:24 BoogieIcfgContainer [2025-03-08 05:12:24,930 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:12:24,930 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:12:24,931 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:12:24,931 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:12:24,931 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:12:00" (3/4) ... [2025-03-08 05:12:24,932 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 05:12:24,970 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 63. [2025-03-08 05:12:25,029 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:12:25,029 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:12:25,029 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:12:25,030 INFO L158 Benchmark]: Toolchain (without parser) took 24827.41ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 154.1MB in the beginning and 188.4MB in the end (delta: -34.4MB). Peak memory consumption was 116.4MB. Max. memory is 16.1GB. [2025-03-08 05:12:25,030 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:12:25,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 138.26ms. Allocated memory is still 201.3MB. Free memory was 154.1MB in the beginning and 142.8MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:12:25,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.49ms. Allocated memory is still 201.3MB. Free memory was 142.8MB in the beginning and 141.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:12:25,030 INFO L158 Benchmark]: Boogie Preprocessor took 17.36ms. Allocated memory is still 201.3MB. Free memory was 141.7MB in the beginning and 140.7MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:12:25,030 INFO L158 Benchmark]: IcfgBuilder took 224.30ms. Allocated memory is still 201.3MB. Free memory was 140.3MB in the beginning and 128.1MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:12:25,030 INFO L158 Benchmark]: TraceAbstraction took 24320.79ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 127.4MB in the beginning and 196.8MB in the end (delta: -69.4MB). Peak memory consumption was 82.8MB. Max. memory is 16.1GB. [2025-03-08 05:12:25,032 INFO L158 Benchmark]: Witness Printer took 98.67ms. Allocated memory is still 352.3MB. Free memory was 196.8MB in the beginning and 188.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:12:25,032 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 138.26ms. Allocated memory is still 201.3MB. Free memory was 154.1MB in the beginning and 142.8MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.49ms. Allocated memory is still 201.3MB. Free memory was 142.8MB in the beginning and 141.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.36ms. Allocated memory is still 201.3MB. Free memory was 141.7MB in the beginning and 140.7MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 224.30ms. Allocated memory is still 201.3MB. Free memory was 140.3MB in the beginning and 128.1MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 24320.79ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 127.4MB in the beginning and 196.8MB in the end (delta: -69.4MB). Peak memory consumption was 82.8MB. Max. memory is 16.1GB. * Witness Printer took 98.67ms. Allocated memory is still 352.3MB. Free memory was 196.8MB in the beginning and 188.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] int A, B; [L25] int r, d, p, q; [L26] A = __VERIFIER_nondet_int() [L27] B = 1 [L29] r = A [L30] d = B [L31] p = 1 [L32] q = 0 VAL [A=7, B=1, counter=0, d=1, p=1, q=0, r=7] [L34] COND TRUE counter++<5 [L34] EXPR counter++ VAL [A=7, B=1, counter=1, d=1, p=1, q=0, r=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(q == 0) VAL [A=7, B=1, counter=1, d=1, p=1, q=0, r=7] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(r == A) VAL [A=7, B=1, counter=1, d=1, p=1, q=0, r=7] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(d == B * p) VAL [A=7, B=1, counter=1, d=1, p=1, q=0, r=7] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [A=7, B=1, counter=1, d=2, p=2, q=0, r=7] [L34] COND TRUE counter++<5 [L34] EXPR counter++ VAL [A=7, B=1, counter=2, d=2, p=2, q=0, r=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(q == 0) VAL [A=7, B=1, counter=2, d=2, p=2, q=0, r=7] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(r == A) VAL [A=7, B=1, counter=2, d=2, p=2, q=0, r=7] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(d == B * p) VAL [A=7, B=1, counter=2, d=2, p=2, q=0, r=7] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [A=7, B=1, counter=2, d=4, p=4, q=0, r=7] [L34] COND TRUE counter++<5 [L34] EXPR counter++ VAL [A=7, B=1, counter=3, d=4, p=4, q=0, r=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(q == 0) VAL [A=7, B=1, counter=3, d=4, p=4, q=0, r=7] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L36] RET __VERIFIER_assert(r == A) VAL [A=7, B=1, counter=3, d=4, p=4, q=0, r=7] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(d == B * p) VAL [A=7, B=1, counter=3, d=4, p=4, q=0, r=7] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [A=7, B=1, counter=3, d=8, p=8, q=0, r=7] [L34] COND TRUE counter++<5 [L34] EXPR counter++ VAL [A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(q == 0) VAL [A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L36] RET __VERIFIER_assert(r == A) VAL [A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(d == B * p) VAL [A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L38] COND TRUE !(r >= d) VAL [A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L44] COND TRUE counter++<5 [L44] EXPR counter++ VAL [A=7, B=1, counter=5, d=8, p=8, q=0, r=7] [L44] COND TRUE counter++<5 [L45] CALL __VERIFIER_assert(A == q*B + r) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L45] RET __VERIFIER_assert(A == q*B + r) VAL [A=7, B=1, counter=5, d=8, p=8, q=0, r=7] [L46] CALL __VERIFIER_assert(d == B*p) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L46] RET __VERIFIER_assert(d == B*p) VAL [A=7, B=1, counter=5, d=8, p=8, q=0, r=7] [L48] COND FALSE !(!(p != 1)) [L50] d = d / 2 [L51] p = p / 2 VAL [A=7, B=1, counter=5, d=4, p=4, q=0, r=7] [L52] COND TRUE r >= d [L53] r = r - d [L54] q = q + p VAL [A=7, B=1, counter=5, d=4, p=4, q=4, r=3] [L44] COND TRUE counter++<5 [L44] EXPR counter++ VAL [A=7, B=1, counter=6, d=4, p=4, q=4, r=3] [L44] COND FALSE !(counter++<5) [L58] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=0, counter=6] [L15] COND TRUE !(cond) VAL [\old(cond)=0, counter=6] [L17] reach_error() VAL [\old(cond)=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 46 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.2s, OverallIterations: 16, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 404 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 366 mSDsluCounter, 2595 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2064 mSDsCounter, 198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1681 IncrementalHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 198 mSolverCounterUnsat, 531 mSDtfsCounter, 1681 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1306 GetRequests, 1142 SyntacticMatches, 18 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=10, InterpolantAutomatonStates: 138, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 127 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 17.5s InterpolantComputationTime, 1521 NumberOfCodeBlocks, 1521 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1618 ConstructedInterpolants, 0 QuantifiedInterpolants, 16250 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1817 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 4343/5079 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-08 05:12:25,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE