./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound2.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/prodbin-ll_valuebound2.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 d2bc2a3f53718ecf47344b6d9b2d76a5698712f748ff03cd831a90a334f72c9d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:17:37,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:17:37,392 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:17:37,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:17:37,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:17:37,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:17:37,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:17:37,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:17:37,416 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:17:37,416 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:17:37,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:17:37,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:17:37,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:17:37,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:17:37,417 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:17:37,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:17:37,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:17:37,417 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:17:37,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:17:37,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:17:37,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:17:37,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:17:37,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:17:37,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:17:37,418 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:17:37,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:17:37,418 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:17:37,418 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:17:37,418 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:17:37,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:17:37,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:17:37,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:17:37,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:17:37,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:17:37,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:17:37,420 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:17:37,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:17:37,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:17:37,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:17:37,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:17:37,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:17:37,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:17:37,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:17:37,421 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 -> d2bc2a3f53718ecf47344b6d9b2d76a5698712f748ff03cd831a90a334f72c9d [2025-03-08 05:17:37,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:17:37,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:17:37,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:17:37,668 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:17:37,669 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:17:37,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound2.c [2025-03-08 05:17:39,500 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f307f810/862c88ae59c7431b8f9db8d66055bcbf/FLAGad27310ec [2025-03-08 05:17:39,711 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:17:39,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound2.c [2025-03-08 05:17:39,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f307f810/862c88ae59c7431b8f9db8d66055bcbf/FLAGad27310ec [2025-03-08 05:17:40,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f307f810/862c88ae59c7431b8f9db8d66055bcbf [2025-03-08 05:17:40,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:17:40,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:17:40,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:17:40,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:17:40,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:17:40,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:17:40" (1/1) ... [2025-03-08 05:17:40,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd3874e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:40, skipping insertion in model container [2025-03-08 05:17:40,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:17:40" (1/1) ... [2025-03-08 05:17:40,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:17:40,176 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/prodbin-ll_valuebound2.c[537,550] [2025-03-08 05:17:40,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:17:40,200 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:17:40,208 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/prodbin-ll_valuebound2.c[537,550] [2025-03-08 05:17:40,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:17:40,225 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:17:40,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:40 WrapperNode [2025-03-08 05:17:40,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:17:40,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:17:40,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:17:40,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:17:40,232 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:17:40" (1/1) ... [2025-03-08 05:17:40,236 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:17:40" (1/1) ... [2025-03-08 05:17:40,249 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 40 [2025-03-08 05:17:40,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:17:40,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:17:40,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:17:40,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:17:40,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:40" (1/1) ... [2025-03-08 05:17:40,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:40" (1/1) ... [2025-03-08 05:17:40,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:40" (1/1) ... [2025-03-08 05:17:40,269 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 05:17:40,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:40" (1/1) ... [2025-03-08 05:17:40,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:40" (1/1) ... [2025-03-08 05:17:40,271 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:40" (1/1) ... [2025-03-08 05:17:40,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:40" (1/1) ... [2025-03-08 05:17:40,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:40" (1/1) ... [2025-03-08 05:17:40,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:40" (1/1) ... [2025-03-08 05:17:40,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:17:40,276 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:17:40,276 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:17:40,276 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:17:40,277 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:40" (1/1) ... [2025-03-08 05:17:40,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:17:40,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:17:40,303 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:17:40,308 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:17:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:17:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 05:17:40,323 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 05:17:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:17:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:17:40,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:17:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 05:17:40,323 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 05:17:40,359 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:17:40,360 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:17:40,447 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-08 05:17:40,448 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:17:40,453 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:17:40,454 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:17:40,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:17:40 BoogieIcfgContainer [2025-03-08 05:17:40,454 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:17:40,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:17:40,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:17:40,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:17:40,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:17:40" (1/3) ... [2025-03-08 05:17:40,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e84653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:17:40, skipping insertion in model container [2025-03-08 05:17:40,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:40" (2/3) ... [2025-03-08 05:17:40,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e84653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:17:40, skipping insertion in model container [2025-03-08 05:17:40,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:17:40" (3/3) ... [2025-03-08 05:17:40,461 INFO L128 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound2.c [2025-03-08 05:17:40,471 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:17:40,473 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG prodbin-ll_valuebound2.c that has 3 procedures, 26 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:17:40,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:17:40,521 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;@7c3f2e98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:17:40,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:17:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 05:17:40,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 05:17:40,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:17:40,529 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:17:40,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:17:40,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:17:40,535 INFO L85 PathProgramCache]: Analyzing trace with hash -603682929, now seen corresponding path program 1 times [2025-03-08 05:17:40,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:17:40,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640239011] [2025-03-08 05:17:40,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:40,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:17:40,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:17:40,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:17:40,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:40,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:17:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:17:40,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:17:40,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640239011] [2025-03-08 05:17:40,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640239011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:17:40,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586905629] [2025-03-08 05:17:40,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:40,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:40,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:17:40,661 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:17:40,663 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:17:40,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:17:40,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:17:40,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:40,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:17:40,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 05:17:40,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:17:40,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:17:40,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:17:40,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586905629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:17:40,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:17:40,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 05:17:40,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963537956] [2025-03-08 05:17:40,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:17:40,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 05:17:40,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:17:40,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 05:17:40,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:17:40,744 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:17:40,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:17:40,754 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2025-03-08 05:17:40,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 05:17:40,756 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2025-03-08 05:17:40,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:17:40,759 INFO L225 Difference]: With dead ends: 49 [2025-03-08 05:17:40,760 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 05:17:40,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:17:40,763 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:17:40,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:17:40,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 05:17:40,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-08 05:17:40,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 05:17:40,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-03-08 05:17:40,787 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 23 [2025-03-08 05:17:40,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:17:40,787 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-08 05:17:40,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:17:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-03-08 05:17:40,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 05:17:40,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:17:40,790 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:17:40,797 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:17:40,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:17:40,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:17:40,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:17:40,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1252528, now seen corresponding path program 1 times [2025-03-08 05:17:40,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:17:40,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128437206] [2025-03-08 05:17:40,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:40,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:17:40,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:17:41,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:17:41,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:41,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:17:41,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413030120] [2025-03-08 05:17:41,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:41,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:41,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:17:41,030 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:17:41,032 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:17:41,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:17:41,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:17:41,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:41,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:17:41,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 05:17:41,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:17:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:17:41,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:17:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:17:41,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:17:41,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128437206] [2025-03-08 05:17:41,318 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:17:41,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413030120] [2025-03-08 05:17:41,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413030120] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 05:17:41,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:17:41,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-03-08 05:17:41,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678652690] [2025-03-08 05:17:41,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:17:41,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:17:41,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:17:41,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:17:41,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:17:41,320 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 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:17:41,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:17:41,375 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-03-08 05:17:41,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:17:41,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 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 23 [2025-03-08 05:17:41,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:17:41,376 INFO L225 Difference]: With dead ends: 32 [2025-03-08 05:17:41,376 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 05:17:41,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:17:41,377 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:17:41,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 68 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:17:41,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 05:17:41,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2025-03-08 05:17:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 05:17:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-08 05:17:41,381 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2025-03-08 05:17:41,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:17:41,382 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-08 05:17:41,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 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:17:41,382 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-03-08 05:17:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 05:17:41,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:17:41,386 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:17:41,392 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:17:41,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 05:17:41,587 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:17:41,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:17:41,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1696350775, now seen corresponding path program 1 times [2025-03-08 05:17:41,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:17:41,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504733787] [2025-03-08 05:17:41,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:41,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:17:41,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 05:17:41,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 05:17:41,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:41,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:17:41,764 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:17:41,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:17:41,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504733787] [2025-03-08 05:17:41,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504733787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:17:41,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:17:41,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:17:41,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304469604] [2025-03-08 05:17:41,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:17:41,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:17:41,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:17:41,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:17:41,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:17:41,765 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 05:17:41,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:17:41,845 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2025-03-08 05:17:41,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:17:41,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2025-03-08 05:17:41,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:17:41,845 INFO L225 Difference]: With dead ends: 37 [2025-03-08 05:17:41,845 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 05:17:41,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:17:41,846 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:17:41,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 58 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:17:41,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 05:17:41,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-03-08 05:17:41,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 05:17:41,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-08 05:17:41,853 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 29 [2025-03-08 05:17:41,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:17:41,853 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-08 05:17:41,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 05:17:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-03-08 05:17:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 05:17:41,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:17:41,854 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:17:41,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:17:41,854 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:17:41,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:17:41,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1715132203, now seen corresponding path program 1 times [2025-03-08 05:17:41,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:17:41,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56972468] [2025-03-08 05:17:41,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:41,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:17:41,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 05:17:41,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 05:17:41,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:41,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:17:41,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1337649402] [2025-03-08 05:17:41,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:41,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:41,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:17:41,885 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:17:41,886 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:17:41,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 05:17:41,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 05:17:41,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:41,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:17:41,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 05:17:41,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:17:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:17:42,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:17:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:17:42,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:17:42,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56972468] [2025-03-08 05:17:42,562 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:17:42,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337649402] [2025-03-08 05:17:42,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337649402] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:17:42,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:17:42,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2025-03-08 05:17:42,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638748323] [2025-03-08 05:17:42,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:17:42,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 05:17:42,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:17:42,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 05:17:42,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:17:42,565 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 15 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 13 states have internal predecessors, (22), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:17:43,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:17:43,307 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-03-08 05:17:43,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 05:17:43,308 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 13 states have internal predecessors, (22), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 31 [2025-03-08 05:17:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:17:43,309 INFO L225 Difference]: With dead ends: 43 [2025-03-08 05:17:43,309 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 05:17:43,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:17:43,310 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:17:43,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 185 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 05:17:43,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 05:17:43,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2025-03-08 05:17:43,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 05:17:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2025-03-08 05:17:43,314 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 31 [2025-03-08 05:17:43,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:17:43,315 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2025-03-08 05:17:43,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 13 states have internal predecessors, (22), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:17:43,315 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2025-03-08 05:17:43,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 05:17:43,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:17:43,315 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:17:43,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:17:43,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:43,521 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:17:43,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:17:43,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1686503052, now seen corresponding path program 1 times [2025-03-08 05:17:43,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:17:43,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964885820] [2025-03-08 05:17:43,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:43,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:17:43,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 05:17:43,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 05:17:43,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:43,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:17:43,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1094896874] [2025-03-08 05:17:43,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:43,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:43,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:17:43,549 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:17:43,550 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:17:43,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 05:17:43,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 05:17:43,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:43,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:17:43,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 05:17:43,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:17:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:17:43,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:17:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:17:44,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:17:44,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964885820] [2025-03-08 05:17:44,181 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:17:44,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094896874] [2025-03-08 05:17:44,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094896874] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:17:44,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:17:44,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2025-03-08 05:17:44,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271460885] [2025-03-08 05:17:44,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:17:44,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:17:44,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:17:44,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:17:44,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:17:44,182 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 20 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:17:44,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:17:44,537 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2025-03-08 05:17:44,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 05:17:44,537 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 31 [2025-03-08 05:17:44,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:17:44,538 INFO L225 Difference]: With dead ends: 66 [2025-03-08 05:17:44,538 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 05:17:44,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:17:44,539 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:17:44,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 120 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:17:44,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 05:17:44,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-08 05:17:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.225) internal successors, (49), 44 states have internal predecessors, (49), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 05:17:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2025-03-08 05:17:44,549 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 31 [2025-03-08 05:17:44,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:17:44,549 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2025-03-08 05:17:44,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:17:44,550 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2025-03-08 05:17:44,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 05:17:44,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:17:44,550 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:17:44,560 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:17:44,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:44,751 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:17:44,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:17:44,751 INFO L85 PathProgramCache]: Analyzing trace with hash -514072932, now seen corresponding path program 1 times [2025-03-08 05:17:44,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:17:44,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865930358] [2025-03-08 05:17:44,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:44,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:17:44,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 05:17:44,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 05:17:44,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:44,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:17:44,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366102759] [2025-03-08 05:17:44,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:44,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:44,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:17:44,778 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:17:44,779 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:17:44,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 05:17:44,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 05:17:44,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:44,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:17:44,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 05:17:44,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:17:44,863 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:17:44,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:17:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:17:44,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:17:44,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865930358] [2025-03-08 05:17:44,932 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:17:44,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366102759] [2025-03-08 05:17:44,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366102759] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:17:44,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:17:44,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2025-03-08 05:17:44,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934012272] [2025-03-08 05:17:44,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:17:44,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:17:44,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:17:44,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:17:44,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:17:44,934 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 05:17:45,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:17:45,006 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2025-03-08 05:17:45,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:17:45,006 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 37 [2025-03-08 05:17:45,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:17:45,007 INFO L225 Difference]: With dead ends: 65 [2025-03-08 05:17:45,008 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 05:17:45,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:17:45,009 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:17:45,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 134 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:17:45,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 05:17:45,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-08 05:17:45,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.15) internal successors, (46), 43 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 05:17:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2025-03-08 05:17:45,018 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 37 [2025-03-08 05:17:45,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:17:45,018 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2025-03-08 05:17:45,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 05:17:45,018 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2025-03-08 05:17:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 05:17:45,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:17:45,019 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:17:45,025 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:17:45,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:45,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:17:45,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:17:45,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1695860034, now seen corresponding path program 1 times [2025-03-08 05:17:45,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:17:45,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198486876] [2025-03-08 05:17:45,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:45,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:17:45,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 05:17:45,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 05:17:45,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:45,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:17:45,522 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 05:17:45,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:17:45,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198486876] [2025-03-08 05:17:45,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198486876] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:17:45,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725418971] [2025-03-08 05:17:45,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:45,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:45,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:17:45,527 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:17:45,529 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:17:45,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 05:17:45,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 05:17:45,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:45,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:17:45,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 05:17:45,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:17:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:17:45,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:17:45,756 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 05:17:45,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725418971] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:17:45,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:17:45,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 16 [2025-03-08 05:17:45,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679485868] [2025-03-08 05:17:45,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:17:45,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 05:17:45,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:17:45,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 05:17:45,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:17:45,760 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-03-08 05:17:45,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:17:45,921 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2025-03-08 05:17:45,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 05:17:45,922 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) Word has length 47 [2025-03-08 05:17:45,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:17:45,922 INFO L225 Difference]: With dead ends: 75 [2025-03-08 05:17:45,922 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 05:17:45,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2025-03-08 05:17:45,923 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:17:45,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 83 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:17:45,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 05:17:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-08 05:17:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 30 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 05:17:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2025-03-08 05:17:45,929 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 47 [2025-03-08 05:17:45,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:17:45,929 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2025-03-08 05:17:45,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-03-08 05:17:45,929 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2025-03-08 05:17:45,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 05:17:45,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:17:45,931 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:17:45,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 05:17:46,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:46,132 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:17:46,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:17:46,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2042325056, now seen corresponding path program 2 times [2025-03-08 05:17:46,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:17:46,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475936009] [2025-03-08 05:17:46,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:17:46,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:17:46,137 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-08 05:17:46,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 05:17:46,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:17:46,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:17:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 05:17:46,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:17:46,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475936009] [2025-03-08 05:17:46,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475936009] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:17:46,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254962303] [2025-03-08 05:17:46,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:17:46,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:46,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:17:46,515 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:17:46,516 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:17:46,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-08 05:17:46,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 05:17:46,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:17:46,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:17:46,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 05:17:46,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:17:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 05:17:46,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:17:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:17:46,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254962303] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:17:46,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:17:46,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2025-03-08 05:17:46,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035357969] [2025-03-08 05:17:46,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:17:46,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 05:17:46,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:17:46,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 05:17:46,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-03-08 05:17:46,849 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 17 states have internal predecessors, (42), 12 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (16), 13 states have call predecessors, (16), 12 states have call successors, (16) [2025-03-08 05:17:46,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:17:46,925 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2025-03-08 05:17:46,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:17:46,925 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 17 states have internal predecessors, (42), 12 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (16), 13 states have call predecessors, (16), 12 states have call successors, (16) Word has length 55 [2025-03-08 05:17:46,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:17:46,925 INFO L225 Difference]: With dead ends: 46 [2025-03-08 05:17:46,925 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 05:17:46,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2025-03-08 05:17:46,926 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:17:46,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 128 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:17:46,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 05:17:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 05:17:46,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:17:46,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 05:17:46,927 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2025-03-08 05:17:46,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:17:46,927 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 05:17:46,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 17 states have internal predecessors, (42), 12 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (16), 13 states have call predecessors, (16), 12 states have call successors, (16) [2025-03-08 05:17:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 05:17:46,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 05:17:46,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:17:46,935 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:17:47,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:47,135 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2025-03-08 05:17:47,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 05:17:47,241 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:17:47,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:17:47 BoogieIcfgContainer [2025-03-08 05:17:47,254 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:17:47,255 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:17:47,255 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:17:47,255 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:17:47,256 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:17:40" (3/4) ... [2025-03-08 05:17:47,257 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 05:17:47,260 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-08 05:17:47,261 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-08 05:17:47,264 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-08 05:17:47,265 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 05:17:47,265 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 05:17:47,265 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 05:17:47,315 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:17:47,315 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:17:47,315 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:17:47,315 INFO L158 Benchmark]: Toolchain (without parser) took 7264.55ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 134.9MB in the beginning and 121.8MB in the end (delta: 13.1MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2025-03-08 05:17:47,316 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:17:47,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.43ms. Allocated memory is still 167.8MB. Free memory was 134.6MB in the beginning and 123.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:17:47,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.40ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 122.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:17:47,316 INFO L158 Benchmark]: Boogie Preprocessor took 24.76ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 121.5MB in the end (delta: 896.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:17:47,316 INFO L158 Benchmark]: IcfgBuilder took 178.61ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 109.9MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:17:47,317 INFO L158 Benchmark]: TraceAbstraction took 6798.69ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 109.3MB in the beginning and 128.0MB in the end (delta: -18.7MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2025-03-08 05:17:47,317 INFO L158 Benchmark]: Witness Printer took 59.88ms. Allocated memory is still 201.3MB. Free memory was 128.0MB in the beginning and 121.8MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:17:47,318 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.24ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.43ms. Allocated memory is still 167.8MB. Free memory was 134.6MB in the beginning and 123.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.40ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 122.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.76ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 121.5MB in the end (delta: 896.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 178.61ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 109.9MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6798.69ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 109.3MB in the beginning and 128.0MB in the end (delta: -18.7MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Witness Printer took 59.88ms. Allocated memory is still 201.3MB. Free memory was 128.0MB in the beginning and 121.8MB in the end (delta: 6.2MB). 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 - PositiveResult [Line: 15]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 38 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 806 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 657 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 776 IncrementalHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 149 mSDtfsCounter, 776 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 508 GetRequests, 392 SyntacticMatches, 12 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=5, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 608 ConstructedInterpolants, 2 QuantifiedInterpolants, 1890 SizeOfPredicates, 11 NumberOfNonLiveVariables, 650 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 480/517 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Location Invariant Derived location invariant: ((((((((1 <= ((((__int128) y + 1) >= 0) ? (((__int128) y + 1) % 2) : ((((__int128) y + 1) % 2) + 2))) && (b <= 2)) && (1 <= b)) && ((z + ((__int128) x * y)) == ((long long) a * b))) && (y <= 1)) && (0 <= ((__int128) y + 1))) || (((((y == 1) && (x == ((long long) 2 * a))) && (z == 0)) && (1 == ((b >= 0) ? (b / 2) : ((b / 2) - 1)))) && (((b >= 0) ? (b % 2) : ((b % 2) + 2)) != 1))) || (((((b == y) && (b <= 2)) && (1 <= b)) && ((z + ((__int128) x * y)) == ((long long) a * b))) && (a == x))) RESULT: Ultimate proved your program to be correct! [2025-03-08 05:17:47,329 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 Result: TRUE