./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.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/dijkstra-u_unwindbound2.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 ee8fbf7ad7c769bb660b4c416c89e8a6070f0c88820552e25f4a5ca5398fd5ca --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 01:15:08,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 01:15:08,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 01:15:08,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 01:15:08,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 01:15:08,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 01:15:08,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 01:15:08,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 01:15:08,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 01:15:08,590 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 01:15:08,590 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 01:15:08,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 01:15:08,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 01:15:08,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 01:15:08,594 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 01:15:08,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 01:15:08,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 01:15:08,594 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 01:15:08,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 01:15:08,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 01:15:08,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 01:15:08,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 01:15:08,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 01:15:08,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 01:15:08,596 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 01:15:08,596 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 01:15:08,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 01:15:08,596 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 01:15:08,596 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 01:15:08,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 01:15:08,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 01:15:08,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 01:15:08,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 01:15:08,597 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 01:15:08,597 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 01:15:08,597 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 01:15:08,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 01:15:08,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 01:15:08,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 01:15:08,598 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 01:15:08,598 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 01:15:08,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 01:15:08,600 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> ee8fbf7ad7c769bb660b4c416c89e8a6070f0c88820552e25f4a5ca5398fd5ca [2024-11-22 01:15:08,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 01:15:08,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 01:15:08,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 01:15:08,846 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 01:15:08,847 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 01:15:08,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2024-11-22 01:15:10,300 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 01:15:10,503 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 01:15:10,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2024-11-22 01:15:10,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f28c617c1/ac998313d8e74aca99cff900bafca201/FLAG42edc56d1 [2024-11-22 01:15:10,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f28c617c1/ac998313d8e74aca99cff900bafca201 [2024-11-22 01:15:10,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 01:15:10,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 01:15:10,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 01:15:10,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 01:15:10,552 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 01:15:10,553 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:15:10" (1/1) ... [2024-11-22 01:15:10,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cbc5bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:15:10, skipping insertion in model container [2024-11-22 01:15:10,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:15:10" (1/1) ... [2024-11-22 01:15:10,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 01:15:10,751 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/dijkstra-u_unwindbound2.c[525,538] [2024-11-22 01:15:10,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 01:15:10,808 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 01:15:10,821 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/dijkstra-u_unwindbound2.c[525,538] [2024-11-22 01:15:10,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 01:15:10,851 INFO L204 MainTranslator]: Completed translation [2024-11-22 01:15:10,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:15:10 WrapperNode [2024-11-22 01:15:10,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 01:15:10,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 01:15:10,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 01:15:10,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 01:15:10,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:15:10" (1/1) ... [2024-11-22 01:15:10,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:15:10" (1/1) ... [2024-11-22 01:15:10,888 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2024-11-22 01:15:10,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 01:15:10,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 01:15:10,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 01:15:10,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 01:15:10,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:15:10" (1/1) ... [2024-11-22 01:15:10,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:15:10" (1/1) ... [2024-11-22 01:15:10,899 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:15:10" (1/1) ... [2024-11-22 01:15:10,915 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]. [2024-11-22 01:15:10,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:15:10" (1/1) ... [2024-11-22 01:15:10,916 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:15:10" (1/1) ... [2024-11-22 01:15:10,919 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:15:10" (1/1) ... [2024-11-22 01:15:10,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:15:10" (1/1) ... [2024-11-22 01:15:10,922 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:15:10" (1/1) ... [2024-11-22 01:15:10,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:15:10" (1/1) ... [2024-11-22 01:15:10,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 01:15:10,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 01:15:10,925 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 01:15:10,925 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 01:15:10,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:15:10" (1/1) ... [2024-11-22 01:15:10,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 01:15:10,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:15:10,975 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) [2024-11-22 01:15:10,982 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 [2024-11-22 01:15:11,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 01:15:11,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 01:15:11,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 01:15:11,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 01:15:11,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-22 01:15:11,030 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-22 01:15:11,083 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 01:15:11,084 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 01:15:11,344 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-22 01:15:11,344 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 01:15:11,357 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 01:15:11,357 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 01:15:11,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:15:11 BoogieIcfgContainer [2024-11-22 01:15:11,358 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 01:15:11,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 01:15:11,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 01:15:11,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 01:15:11,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:15:10" (1/3) ... [2024-11-22 01:15:11,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec23e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:15:11, skipping insertion in model container [2024-11-22 01:15:11,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:15:10" (2/3) ... [2024-11-22 01:15:11,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec23e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:15:11, skipping insertion in model container [2024-11-22 01:15:11,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:15:11" (3/3) ... [2024-11-22 01:15:11,365 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound2.c [2024-11-22 01:15:11,378 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 01:15:11,378 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 01:15:11,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 01:15:11,425 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;@7fcc076b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 01:15:11,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 01:15:11,429 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 01:15:11,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 01:15:11,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:15:11,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:15:11,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:15:11,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:15:11,440 INFO L85 PathProgramCache]: Analyzing trace with hash -797370321, now seen corresponding path program 1 times [2024-11-22 01:15:11,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:15:11,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524796551] [2024-11-22 01:15:11,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:15:11,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:15:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:15:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 01:15:11,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:15:11,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524796551] [2024-11-22 01:15:11,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524796551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:15:11,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 01:15:11,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 01:15:11,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84838871] [2024-11-22 01:15:11,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:15:11,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 01:15:11,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:15:11,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 01:15:11,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 01:15:11,689 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 01:15:11,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:15:11,709 INFO L93 Difference]: Finished difference Result 57 states and 97 transitions. [2024-11-22 01:15:11,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 01:15:11,711 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-22 01:15:11,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:15:11,719 INFO L225 Difference]: With dead ends: 57 [2024-11-22 01:15:11,719 INFO L226 Difference]: Without dead ends: 26 [2024-11-22 01:15:11,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 01:15:11,725 INFO L432 NwaCegarLoop]: 42 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, 42 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 [2024-11-22 01:15:11,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 01:15:11,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-22 01:15:11,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-22 01:15:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 01:15:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2024-11-22 01:15:11,774 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 10 [2024-11-22 01:15:11,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:15:11,774 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2024-11-22 01:15:11,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 01:15:11,775 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2024-11-22 01:15:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 01:15:11,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:15:11,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:15:11,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 01:15:11,780 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:15:11,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:15:11,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1698606518, now seen corresponding path program 1 times [2024-11-22 01:15:11,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:15:11,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506898497] [2024-11-22 01:15:11,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:15:11,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:15:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:15:11,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 01:15:11,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:15:11,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506898497] [2024-11-22 01:15:11,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506898497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:15:11,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 01:15:11,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 01:15:11,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794194661] [2024-11-22 01:15:11,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:15:11,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 01:15:11,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:15:11,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 01:15:11,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 01:15:11,915 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 01:15:11,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:15:11,939 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2024-11-22 01:15:11,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 01:15:11,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-22 01:15:11,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:15:11,941 INFO L225 Difference]: With dead ends: 47 [2024-11-22 01:15:11,941 INFO L226 Difference]: Without dead ends: 28 [2024-11-22 01:15:11,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 01:15:11,943 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 01:15:11,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 01:15:11,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-22 01:15:11,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-22 01:15:11,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 01:15:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2024-11-22 01:15:11,953 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 12 [2024-11-22 01:15:11,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:15:11,953 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2024-11-22 01:15:11,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 01:15:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2024-11-22 01:15:11,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 01:15:11,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:15:11,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:15:11,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 01:15:11,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:15:11,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:15:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash 776097594, now seen corresponding path program 1 times [2024-11-22 01:15:11,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:15:11,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011915419] [2024-11-22 01:15:11,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:15:11,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:15:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:15:12,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 01:15:12,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:15:12,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011915419] [2024-11-22 01:15:12,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011915419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:15:12,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 01:15:12,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 01:15:12,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087168485] [2024-11-22 01:15:12,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:15:12,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 01:15:12,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:15:12,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 01:15:12,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 01:15:12,070 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 01:15:12,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:15:12,096 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2024-11-22 01:15:12,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 01:15:12,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-22 01:15:12,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:15:12,097 INFO L225 Difference]: With dead ends: 41 [2024-11-22 01:15:12,098 INFO L226 Difference]: Without dead ends: 32 [2024-11-22 01:15:12,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 01:15:12,100 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 01:15:12,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 102 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 01:15:12,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-22 01:15:12,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-11-22 01:15:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 01:15:12,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2024-11-22 01:15:12,108 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 13 [2024-11-22 01:15:12,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:15:12,109 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2024-11-22 01:15:12,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 01:15:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2024-11-22 01:15:12,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 01:15:12,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:15:12,110 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:15:12,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 01:15:12,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:15:12,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:15:12,111 INFO L85 PathProgramCache]: Analyzing trace with hash 777587144, now seen corresponding path program 1 times [2024-11-22 01:15:12,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:15:12,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946975183] [2024-11-22 01:15:12,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:15:12,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:15:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:15:12,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 01:15:12,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:15:12,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946975183] [2024-11-22 01:15:12,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946975183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:15:12,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 01:15:12,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 01:15:12,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635701990] [2024-11-22 01:15:12,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:15:12,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 01:15:12,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:15:12,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 01:15:12,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 01:15:12,321 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 01:15:12,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:15:12,495 INFO L93 Difference]: Finished difference Result 61 states and 91 transitions. [2024-11-22 01:15:12,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 01:15:12,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-22 01:15:12,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:15:12,496 INFO L225 Difference]: With dead ends: 61 [2024-11-22 01:15:12,497 INFO L226 Difference]: Without dead ends: 42 [2024-11-22 01:15:12,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-22 01:15:12,498 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 01:15:12,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 163 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 01:15:12,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-22 01:15:12,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-22 01:15:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 01:15:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2024-11-22 01:15:12,509 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 13 [2024-11-22 01:15:12,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:15:12,509 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2024-11-22 01:15:12,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 01:15:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2024-11-22 01:15:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 01:15:12,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:15:12,510 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:15:12,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 01:15:12,510 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:15:12,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:15:12,511 INFO L85 PathProgramCache]: Analyzing trace with hash 84493759, now seen corresponding path program 1 times [2024-11-22 01:15:12,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:15:12,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697453362] [2024-11-22 01:15:12,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:15:12,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:15:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:15:12,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 01:15:12,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:15:12,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697453362] [2024-11-22 01:15:12,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697453362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:15:12,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540053280] [2024-11-22 01:15:12,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:15:12,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:15:12,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:15:12,574 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) [2024-11-22 01:15:12,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 01:15:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:15:12,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 01:15:12,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:15:12,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 01:15:12,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:15:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 01:15:12,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540053280] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:15:12,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:15:12,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-22 01:15:12,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053447257] [2024-11-22 01:15:12,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:15:12,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 01:15:12,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:15:12,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 01:15:12,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 01:15:12,831 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 01:15:12,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:15:12,904 INFO L93 Difference]: Finished difference Result 63 states and 92 transitions. [2024-11-22 01:15:12,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 01:15:12,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-22 01:15:12,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:15:12,907 INFO L225 Difference]: With dead ends: 63 [2024-11-22 01:15:12,907 INFO L226 Difference]: Without dead ends: 44 [2024-11-22 01:15:12,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 01:15:12,909 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 01:15:12,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 101 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 01:15:12,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-22 01:15:12,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-22 01:15:12,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 01:15:12,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2024-11-22 01:15:12,917 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 15 [2024-11-22 01:15:12,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:15:12,917 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2024-11-22 01:15:12,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 01:15:12,917 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2024-11-22 01:15:12,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 01:15:12,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:15:12,918 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:15:12,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 01:15:13,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:15:13,122 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:15:13,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:15:13,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2016757679, now seen corresponding path program 1 times [2024-11-22 01:15:13,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:15:13,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965852542] [2024-11-22 01:15:13,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:15:13,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:15:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 01:15:13,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1249711056] [2024-11-22 01:15:13,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:15:13,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:15:13,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:15:13,155 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) [2024-11-22 01:15:13,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 01:15:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:15:13,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 01:15:13,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:15:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 01:15:13,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 01:15:13,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:15:13,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965852542] [2024-11-22 01:15:13,304 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 01:15:13,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249711056] [2024-11-22 01:15:13,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249711056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:15:13,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 01:15:13,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 01:15:13,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971530957] [2024-11-22 01:15:13,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:15:13,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 01:15:13,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:15:13,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 01:15:13,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 01:15:13,306 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 01:15:17,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-22 01:15:21,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-22 01:15:21,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:15:21,431 INFO L93 Difference]: Finished difference Result 62 states and 89 transitions. [2024-11-22 01:15:21,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 01:15:21,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-22 01:15:21,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:15:21,434 INFO L225 Difference]: With dead ends: 62 [2024-11-22 01:15:21,434 INFO L226 Difference]: Without dead ends: 59 [2024-11-22 01:15:21,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 01:15:21,435 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-11-22 01:15:21,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 120 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2024-11-22 01:15:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-22 01:15:21,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-22 01:15:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.28125) internal successors, (41), 34 states have internal predecessors, (41), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 01:15:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 85 transitions. [2024-11-22 01:15:21,464 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 85 transitions. Word has length 16 [2024-11-22 01:15:21,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:15:21,465 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 85 transitions. [2024-11-22 01:15:21,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 01:15:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2024-11-22 01:15:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 01:15:21,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:15:21,466 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:15:21,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 01:15:21,666 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,SelfDestructingSolverStorable5 [2024-11-22 01:15:21,670 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:15:21,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:15:21,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2015268129, now seen corresponding path program 1 times [2024-11-22 01:15:21,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:15:21,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977281920] [2024-11-22 01:15:21,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:15:21,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:15:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:15:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 01:15:21,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:15:21,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977281920] [2024-11-22 01:15:21,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977281920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:15:21,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 01:15:21,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 01:15:21,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050055858] [2024-11-22 01:15:21,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:15:21,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 01:15:21,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:15:21,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 01:15:21,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 01:15:21,728 INFO L87 Difference]: Start difference. First operand 59 states and 85 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 01:15:21,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:15:21,801 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2024-11-22 01:15:21,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 01:15:21,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-22 01:15:21,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:15:21,802 INFO L225 Difference]: With dead ends: 71 [2024-11-22 01:15:21,802 INFO L226 Difference]: Without dead ends: 39 [2024-11-22 01:15:21,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-22 01:15:21,803 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 36 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 01:15:21,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 73 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 01:15:21,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-22 01:15:21,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-22 01:15:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-22 01:15:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-11-22 01:15:21,809 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 16 [2024-11-22 01:15:21,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:15:21,809 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-11-22 01:15:21,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 01:15:21,810 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-11-22 01:15:21,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-22 01:15:21,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:15:21,811 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:15:21,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 01:15:21,811 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:15:21,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:15:21,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1484248551, now seen corresponding path program 1 times [2024-11-22 01:15:21,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:15:21,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121537084] [2024-11-22 01:15:21,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:15:21,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:15:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 01:15:21,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1333823695] [2024-11-22 01:15:21,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:15:21,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:15:21,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:15:21,828 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) [2024-11-22 01:15:21,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 01:15:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:15:21,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 01:15:21,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:15:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 01:15:21,972 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 01:15:21,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:15:21,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121537084] [2024-11-22 01:15:21,973 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 01:15:21,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333823695] [2024-11-22 01:15:21,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333823695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:15:21,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 01:15:21,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 01:15:21,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018659438] [2024-11-22 01:15:21,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:15:21,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 01:15:21,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:15:21,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 01:15:21,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 01:15:21,975 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 01:15:26,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-22 01:15:26,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:15:26,063 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2024-11-22 01:15:26,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 01:15:26,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-22 01:15:26,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:15:26,068 INFO L225 Difference]: With dead ends: 49 [2024-11-22 01:15:26,068 INFO L226 Difference]: Without dead ends: 45 [2024-11-22 01:15:26,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 01:15:26,068 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-22 01:15:26,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-11-22 01:15:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-22 01:15:26,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-22 01:15:26,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-22 01:15:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2024-11-22 01:15:26,079 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 18 [2024-11-22 01:15:26,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:15:26,080 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2024-11-22 01:15:26,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 01:15:26,080 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2024-11-22 01:15:26,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 01:15:26,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:15:26,081 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:15:26,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 01:15:26,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:15:26,282 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:15:26,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:15:26,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1651095472, now seen corresponding path program 1 times [2024-11-22 01:15:26,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:15:26,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538610287] [2024-11-22 01:15:26,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:15:26,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:15:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 01:15:26,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [71817288] [2024-11-22 01:15:26,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:15:26,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:15:26,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:15:26,297 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) [2024-11-22 01:15:26,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 01:15:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:15:26,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 01:15:26,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:15:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 01:15:26,373 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 01:15:26,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:15:26,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538610287] [2024-11-22 01:15:26,374 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 01:15:26,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71817288] [2024-11-22 01:15:26,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71817288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:15:26,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 01:15:26,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 01:15:26,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44567448] [2024-11-22 01:15:26,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:15:26,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 01:15:26,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:15:26,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 01:15:26,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 01:15:26,375 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 01:15:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:15:26,433 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2024-11-22 01:15:26,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 01:15:26,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-22 01:15:26,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:15:26,434 INFO L225 Difference]: With dead ends: 45 [2024-11-22 01:15:26,434 INFO L226 Difference]: Without dead ends: 0 [2024-11-22 01:15:26,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 01:15:26,435 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 01:15:26,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 80 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 01:15:26,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-22 01:15:26,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-22 01:15:26,436 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) [2024-11-22 01:15:26,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-22 01:15:26,437 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2024-11-22 01:15:26,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:15:26,437 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-22 01:15:26,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 01:15:26,437 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-22 01:15:26,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-22 01:15:26,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 01:15:26,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 01:15:26,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:15:26,643 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:15:26,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-22 01:15:26,997 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 01:15:27,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:15:27 BoogieIcfgContainer [2024-11-22 01:15:27,016 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 01:15:27,017 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 01:15:27,017 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 01:15:27,018 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 01:15:27,018 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:15:11" (3/4) ... [2024-11-22 01:15:27,020 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 01:15:27,024 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-22 01:15:27,030 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-22 01:15:27,030 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-22 01:15:27,030 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-22 01:15:27,031 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 01:15:27,119 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 01:15:27,122 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 01:15:27,122 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 01:15:27,123 INFO L158 Benchmark]: Toolchain (without parser) took 16579.80ms. Allocated memory was 199.2MB in the beginning and 310.4MB in the end (delta: 111.1MB). Free memory was 131.2MB in the beginning and 264.2MB in the end (delta: -133.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 01:15:27,123 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 199.2MB. Free memory is still 155.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 01:15:27,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.82ms. Allocated memory is still 199.2MB. Free memory was 131.2MB in the beginning and 117.5MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 01:15:27,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.07ms. Allocated memory is still 199.2MB. Free memory was 117.5MB in the beginning and 115.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 01:15:27,123 INFO L158 Benchmark]: Boogie Preprocessor took 34.46ms. Allocated memory is still 199.2MB. Free memory was 115.7MB in the beginning and 114.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 01:15:27,124 INFO L158 Benchmark]: RCFGBuilder took 433.42ms. Allocated memory is still 199.2MB. Free memory was 114.0MB in the beginning and 165.2MB in the end (delta: -51.2MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2024-11-22 01:15:27,124 INFO L158 Benchmark]: TraceAbstraction took 15656.97ms. Allocated memory was 199.2MB in the beginning and 310.4MB in the end (delta: 111.1MB). Free memory was 165.2MB in the beginning and 269.4MB in the end (delta: -104.2MB). Peak memory consumption was 108.6MB. Max. memory is 16.1GB. [2024-11-22 01:15:27,124 INFO L158 Benchmark]: Witness Printer took 105.03ms. Allocated memory is still 310.4MB. Free memory was 269.4MB in the beginning and 264.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 01:15:27,126 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.11ms. Allocated memory is still 199.2MB. Free memory is still 155.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.82ms. Allocated memory is still 199.2MB. Free memory was 131.2MB in the beginning and 117.5MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.07ms. Allocated memory is still 199.2MB. Free memory was 117.5MB in the beginning and 115.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.46ms. Allocated memory is still 199.2MB. Free memory was 115.7MB in the beginning and 114.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 433.42ms. Allocated memory is still 199.2MB. Free memory was 114.0MB in the beginning and 165.2MB in the end (delta: -51.2MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15656.97ms. Allocated memory was 199.2MB in the beginning and 310.4MB in the end (delta: 111.1MB). Free memory was 165.2MB in the beginning and 269.4MB in the end (delta: -104.2MB). Peak memory consumption was 108.6MB. Max. memory is 16.1GB. * Witness Printer took 105.03ms. Allocated memory is still 310.4MB. Free memory was 269.4MB in the beginning and 264.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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: 14]: 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 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 12.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 864 SdHoareTripleChecker+Invalid, 12.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 561 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 201 IncrementalHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 303 mSDtfsCounter, 201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=6, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 204 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 545 SizeOfPredicates, 4 NumberOfNonLiveVariables, 265 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 13/19 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((p == 0) && (n <= 0)) && (h == 0)) && (q == 1)) && (n == r)) && (counter == 1)) || ((((2 <= counter) && (p == 0)) && (h == 0)) && (n == r))) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((p == 0) && (h == 0)) && (n == r)) && (counter == 1)) || (((((p == 0) && (h == 0)) && (q == 1)) && (counter == 0)) && (n == r))) || ((((2 <= counter) && (p == 0)) && (h == 0)) && (n == r))) - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= cond) Ensures: ((1 <= cond) && (counter == \old(counter))) RESULT: Ultimate proved your program to be correct! [2024-11-22 01:15:27,147 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