./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i -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 d6dbcbf51695ea037a123bcc006ce5f6db095b874a22b169ec869d834ce41de6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:02:02,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:02:02,404 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:02:02,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:02:02,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:02:02,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:02:02,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:02:02,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:02:02,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:02:02,426 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:02:02,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:02:02,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:02:02,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:02:02,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:02:02,427 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:02:02,427 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:02:02,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:02:02,428 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:02:02,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:02:02,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:02:02,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:02:02,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:02:02,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:02:02,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:02:02,429 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:02:02,430 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:02:02,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:02:02,430 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:02:02,430 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:02:02,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:02:02,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:02:02,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:02:02,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:02:02,431 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:02:02,431 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:02:02,431 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:02:02,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:02:02,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:02:02,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:02:02,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:02:02,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:02:02,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:02:02,436 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 -> d6dbcbf51695ea037a123bcc006ce5f6db095b874a22b169ec869d834ce41de6 [2024-10-14 02:02:02,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:02:02,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:02:02,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:02:02,708 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:02:02,709 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:02:02,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i [2024-10-14 02:02:04,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:02:04,250 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:02:04,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i [2024-10-14 02:02:04,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27f5e7162/25ca2de2dcdf48fcb1a1ccc8397c5e8c/FLAGb544bb62d [2024-10-14 02:02:04,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27f5e7162/25ca2de2dcdf48fcb1a1ccc8397c5e8c [2024-10-14 02:02:04,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:02:04,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:02:04,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:02:04,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:02:04,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:02:04,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:02:04" (1/1) ... [2024-10-14 02:02:04,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b11804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:04, skipping insertion in model container [2024-10-14 02:02:04,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:02:04" (1/1) ... [2024-10-14 02:02:04,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:02:04,429 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i[804,817] [2024-10-14 02:02:04,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:02:04,454 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:02:04,465 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i[804,817] [2024-10-14 02:02:04,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:02:04,483 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:02:04,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:04 WrapperNode [2024-10-14 02:02:04,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:02:04,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:02:04,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:02:04,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:02:04,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:04" (1/1) ... [2024-10-14 02:02:04,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:04" (1/1) ... [2024-10-14 02:02:04,506 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2024-10-14 02:02:04,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:02:04,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:02:04,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:02:04,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:02:04,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:04" (1/1) ... [2024-10-14 02:02:04,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:04" (1/1) ... [2024-10-14 02:02:04,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:04" (1/1) ... [2024-10-14 02:02:04,527 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-10-14 02:02:04,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:04" (1/1) ... [2024-10-14 02:02:04,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:04" (1/1) ... [2024-10-14 02:02:04,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:04" (1/1) ... [2024-10-14 02:02:04,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:04" (1/1) ... [2024-10-14 02:02:04,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:04" (1/1) ... [2024-10-14 02:02:04,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:04" (1/1) ... [2024-10-14 02:02:04,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:02:04,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:02:04,544 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:02:04,544 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:02:04,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:04" (1/1) ... [2024-10-14 02:02:04,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:02:04,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:02:04,582 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-10-14 02:02:04,585 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-10-14 02:02:04,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:02:04,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:02:04,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:02:04,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:02:04,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 02:02:04,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 02:02:04,684 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:02:04,689 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:02:04,806 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-14 02:02:04,807 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:02:04,829 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:02:04,830 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 02:02:04,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:02:04 BoogieIcfgContainer [2024-10-14 02:02:04,831 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:02:04,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:02:04,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:02:04,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:02:04,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:02:04" (1/3) ... [2024-10-14 02:02:04,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c73d948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:02:04, skipping insertion in model container [2024-10-14 02:02:04,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:04" (2/3) ... [2024-10-14 02:02:04,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c73d948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:02:04, skipping insertion in model container [2024-10-14 02:02:04,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:02:04" (3/3) ... [2024-10-14 02:02:04,839 INFO L112 eAbstractionObserver]: Analyzing ICFG bh2017-ex1-poly.i [2024-10-14 02:02:04,853 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:02:04,853 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:02:04,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:02:04,911 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;@5609753, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:02:04,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:02:04,916 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 11 states have internal predecessors, (15), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 02:02:04,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 02:02:04,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:02:04,923 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:02:04,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:02:04,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:02:04,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1998107271, now seen corresponding path program 1 times [2024-10-14 02:02:04,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:02:04,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805506699] [2024-10-14 02:02:04,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:02:04,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:02:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:02:05,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:02:05,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805506699] [2024-10-14 02:02:05,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805506699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:02:05,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:02:05,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 02:02:05,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382634367] [2024-10-14 02:02:05,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:02:05,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 02:02:05,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:02:05,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 02:02:05,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 02:02:05,118 INFO L87 Difference]: Start difference. First operand has 20 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 11 states have internal predecessors, (15), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-10-14 02:02:05,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:02:05,160 INFO L93 Difference]: Finished difference Result 40 states and 72 transitions. [2024-10-14 02:02:05,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 02:02:05,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2024-10-14 02:02:05,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:02:05,170 INFO L225 Difference]: With dead ends: 40 [2024-10-14 02:02:05,170 INFO L226 Difference]: Without dead ends: 19 [2024-10-14 02:02:05,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 02:02:05,175 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:02:05,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:02:05,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-14 02:02:05,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-14 02:02:05,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 02:02:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2024-10-14 02:02:05,217 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 7 [2024-10-14 02:02:05,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:02:05,218 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 27 transitions. [2024-10-14 02:02:05,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-10-14 02:02:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2024-10-14 02:02:05,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 02:02:05,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:02:05,219 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:02:05,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:02:05,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:02:05,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:02:05,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1996498557, now seen corresponding path program 1 times [2024-10-14 02:02:05,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:02:05,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214829014] [2024-10-14 02:02:05,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:02:05,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:02:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:02:05,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:02:05,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214829014] [2024-10-14 02:02:05,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214829014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:02:05,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:02:05,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:02:05,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153417444] [2024-10-14 02:02:05,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:02:05,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:02:05,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:02:05,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:02:05,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:02:05,383 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-10-14 02:02:05,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:02:05,476 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2024-10-14 02:02:05,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:02:05,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 7 [2024-10-14 02:02:05,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:02:05,477 INFO L225 Difference]: With dead ends: 25 [2024-10-14 02:02:05,478 INFO L226 Difference]: Without dead ends: 23 [2024-10-14 02:02:05,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:02:05,479 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:02:05,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 68 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:02:05,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-14 02:02:05,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-14 02:02:05,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 02:02:05,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-10-14 02:02:05,494 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 7 [2024-10-14 02:02:05,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:02:05,495 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-10-14 02:02:05,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-10-14 02:02:05,495 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-10-14 02:02:05,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 02:02:05,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:02:05,496 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:02:05,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:02:05,497 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:02:05,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:02:05,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2106031398, now seen corresponding path program 1 times [2024-10-14 02:02:05,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:02:05,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369040334] [2024-10-14 02:02:05,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:02:05,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:02:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:05,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 02:02:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:02:05,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:02:05,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369040334] [2024-10-14 02:02:05,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369040334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:02:05,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:02:05,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:02:05,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154904058] [2024-10-14 02:02:05,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:02:05,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:02:05,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:02:05,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:02:05,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:02:05,628 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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-10-14 02:02:05,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:02:05,708 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2024-10-14 02:02:05,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:02:05,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 12 [2024-10-14 02:02:05,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:02:05,710 INFO L225 Difference]: With dead ends: 41 [2024-10-14 02:02:05,710 INFO L226 Difference]: Without dead ends: 39 [2024-10-14 02:02:05,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:02:05,711 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:02:05,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 97 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:02:05,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-14 02:02:05,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-10-14 02:02:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 02:02:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-10-14 02:02:05,719 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 12 [2024-10-14 02:02:05,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:02:05,720 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-10-14 02:02:05,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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-10-14 02:02:05,720 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-10-14 02:02:05,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 02:02:05,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:02:05,721 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:02:05,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 02:02:05,721 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:02:05,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:02:05,721 INFO L85 PathProgramCache]: Analyzing trace with hash -2121220317, now seen corresponding path program 1 times [2024-10-14 02:02:05,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:02:05,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456586842] [2024-10-14 02:02:05,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:02:05,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:02:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:05,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 02:02:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:05,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:02:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:05,795 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:02:05,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:02:05,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456586842] [2024-10-14 02:02:05,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456586842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:02:05,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:02:05,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:02:05,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850910354] [2024-10-14 02:02:05,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:02:05,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:02:05,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:02:05,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:02:05,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:02:05,797 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 02:02:05,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:02:05,874 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-10-14 02:02:05,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:02:05,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-10-14 02:02:05,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:02:05,875 INFO L225 Difference]: With dead ends: 45 [2024-10-14 02:02:05,875 INFO L226 Difference]: Without dead ends: 43 [2024-10-14 02:02:05,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:02:05,877 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:02:05,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 83 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:02:05,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-14 02:02:05,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-10-14 02:02:05,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 02:02:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2024-10-14 02:02:05,889 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 17 [2024-10-14 02:02:05,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:02:05,890 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2024-10-14 02:02:05,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 02:02:05,890 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2024-10-14 02:02:05,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 02:02:05,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:02:05,890 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:02:05,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 02:02:05,891 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:02:05,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:02:05,891 INFO L85 PathProgramCache]: Analyzing trace with hash 905923334, now seen corresponding path program 1 times [2024-10-14 02:02:05,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:02:05,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997393641] [2024-10-14 02:02:05,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:02:05,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:02:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:05,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 02:02:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:05,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:02:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:05,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:02:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 02:02:05,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:02:05,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997393641] [2024-10-14 02:02:05,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997393641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:02:05,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:02:05,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:02:05,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226695866] [2024-10-14 02:02:05,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:02:05,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:02:05,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:02:05,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:02:05,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:02:05,962 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 02:02:06,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:02:06,004 INFO L93 Difference]: Finished difference Result 88 states and 119 transitions. [2024-10-14 02:02:06,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:02:06,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2024-10-14 02:02:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:02:06,006 INFO L225 Difference]: With dead ends: 88 [2024-10-14 02:02:06,007 INFO L226 Difference]: Without dead ends: 55 [2024-10-14 02:02:06,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:02:06,008 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:02:06,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 99 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:02:06,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-14 02:02:06,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-14 02:02:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-14 02:02:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2024-10-14 02:02:06,020 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 22 [2024-10-14 02:02:06,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:02:06,021 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 75 transitions. [2024-10-14 02:02:06,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 02:02:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions. [2024-10-14 02:02:06,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 02:02:06,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:02:06,026 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 02:02:06,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 02:02:06,026 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:02:06,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:02:06,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1205745070, now seen corresponding path program 1 times [2024-10-14 02:02:06,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:02:06,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162263546] [2024-10-14 02:02:06,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:02:06,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:02:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 02:02:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:02:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:02:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 02:02:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 02:02:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:02:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 02:02:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-10-14 02:02:06,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:02:06,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162263546] [2024-10-14 02:02:06,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162263546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:02:06,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:02:06,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 02:02:06,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812187737] [2024-10-14 02:02:06,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:02:06,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:02:06,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:02:06,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:02:06,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:02:06,153 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:02:06,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:02:06,227 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2024-10-14 02:02:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:02:06,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2024-10-14 02:02:06,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:02:06,231 INFO L225 Difference]: With dead ends: 61 [2024-10-14 02:02:06,231 INFO L226 Difference]: Without dead ends: 59 [2024-10-14 02:02:06,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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-10-14 02:02:06,232 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:02:06,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 64 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:02:06,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-14 02:02:06,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-14 02:02:06,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-14 02:02:06,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2024-10-14 02:02:06,255 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 43 [2024-10-14 02:02:06,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:02:06,258 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2024-10-14 02:02:06,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:02:06,258 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2024-10-14 02:02:06,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 02:02:06,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:02:06,260 INFO L215 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:02:06,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 02:02:06,260 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:02:06,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:02:06,262 INFO L85 PathProgramCache]: Analyzing trace with hash 296191259, now seen corresponding path program 1 times [2024-10-14 02:02:06,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:02:06,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454827518] [2024-10-14 02:02:06,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:02:06,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:02:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 02:02:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:02:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:02:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 02:02:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 02:02:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:02:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 02:02:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 02:02:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 02:02:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:02:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 02:02:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 02:02:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 02:02:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 30 proven. 11 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 02:02:06,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:02:06,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454827518] [2024-10-14 02:02:06,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454827518] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:02:06,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833655953] [2024-10-14 02:02:06,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:02:06,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:02:06,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:02:06,506 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-10-14 02:02:06,507 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-10-14 02:02:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:06,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 02:02:06,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:02:06,933 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 33 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 02:02:06,933 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:02:07,224 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 02:02:07,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833655953] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:02:07,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:02:07,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 24 [2024-10-14 02:02:07,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379541639] [2024-10-14 02:02:07,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:02:07,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 02:02:07,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:02:07,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 02:02:07,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2024-10-14 02:02:07,227 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 11 states have call successors, (41), 3 states have call predecessors, (41), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2024-10-14 02:02:07,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:02:07,433 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2024-10-14 02:02:07,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:02:07,433 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 11 states have call successors, (41), 3 states have call predecessors, (41), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) Word has length 77 [2024-10-14 02:02:07,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:02:07,435 INFO L225 Difference]: With dead ends: 79 [2024-10-14 02:02:07,435 INFO L226 Difference]: Without dead ends: 77 [2024-10-14 02:02:07,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 161 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2024-10-14 02:02:07,436 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:02:07,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 248 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 02:02:07,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-14 02:02:07,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2024-10-14 02:02:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 23 states have call successors, (23), 8 states have call predecessors, (23), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-14 02:02:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2024-10-14 02:02:07,448 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 77 [2024-10-14 02:02:07,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:02:07,448 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2024-10-14 02:02:07,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 11 states have call successors, (41), 3 states have call predecessors, (41), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2024-10-14 02:02:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2024-10-14 02:02:07,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 02:02:07,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:02:07,450 INFO L215 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:02:07,462 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-10-14 02:02:07,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:02:07,651 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:02:07,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:02:07,651 INFO L85 PathProgramCache]: Analyzing trace with hash 359688270, now seen corresponding path program 2 times [2024-10-14 02:02:07,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:02:07,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207475892] [2024-10-14 02:02:07,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:02:07,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:02:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:07,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 02:02:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:07,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:02:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:07,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:02:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:07,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 02:02:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:07,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 02:02:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:07,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:02:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:07,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 02:02:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:07,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 02:02:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:07,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 02:02:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:07,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:02:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:07,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 02:02:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:07,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 02:02:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:07,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 02:02:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:07,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 02:02:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-10-14 02:02:07,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:02:07,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207475892] [2024-10-14 02:02:07,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207475892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:02:07,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:02:07,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:02:07,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382051143] [2024-10-14 02:02:07,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:02:07,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:02:07,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:02:07,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:02:07,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:02:07,744 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 02:02:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:02:07,785 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2024-10-14 02:02:07,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:02:07,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 82 [2024-10-14 02:02:07,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:02:07,786 INFO L225 Difference]: With dead ends: 67 [2024-10-14 02:02:07,786 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 02:02:07,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:02:07,787 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:02:07,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 57 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:02:07,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 02:02:07,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 02:02:07,788 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-10-14 02:02:07,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 02:02:07,788 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2024-10-14 02:02:07,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:02:07,789 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 02:02:07,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 02:02:07,789 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 02:02:07,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 02:02:07,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 02:02:07,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 02:02:07,793 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-10-14 02:02:07,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 02:02:08,103 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 02:02:08,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:02:08 BoogieIcfgContainer [2024-10-14 02:02:08,116 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 02:02:08,116 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 02:02:08,116 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 02:02:08,116 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 02:02:08,117 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:02:04" (3/4) ... [2024-10-14 02:02:08,118 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 02:02:08,121 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-14 02:02:08,123 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-10-14 02:02:08,123 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 02:02:08,123 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 02:02:08,123 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 02:02:08,179 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 02:02:08,179 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 02:02:08,179 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 02:02:08,180 INFO L158 Benchmark]: Toolchain (without parser) took 3903.72ms. Allocated memory was 182.5MB in the beginning and 222.3MB in the end (delta: 39.8MB). Free memory was 151.5MB in the beginning and 155.1MB in the end (delta: -3.5MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2024-10-14 02:02:08,180 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 130.0MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 02:02:08,180 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.28ms. Allocated memory is still 182.5MB. Free memory was 151.3MB in the beginning and 142.8MB in the end (delta: 8.5MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-10-14 02:02:08,180 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.41ms. Allocated memory is still 182.5MB. Free memory was 142.8MB in the beginning and 141.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 02:02:08,180 INFO L158 Benchmark]: Boogie Preprocessor took 36.28ms. Allocated memory is still 182.5MB. Free memory was 141.8MB in the beginning and 140.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 02:02:08,180 INFO L158 Benchmark]: RCFGBuilder took 287.07ms. Allocated memory is still 182.5MB. Free memory was 139.7MB in the beginning and 129.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 02:02:08,181 INFO L158 Benchmark]: TraceAbstraction took 3283.21ms. Allocated memory was 182.5MB in the beginning and 222.3MB in the end (delta: 39.8MB). Free memory was 128.2MB in the beginning and 159.3MB in the end (delta: -31.1MB). Peak memory consumption was 106.3MB. Max. memory is 16.1GB. [2024-10-14 02:02:08,181 INFO L158 Benchmark]: Witness Printer took 63.12ms. Allocated memory is still 222.3MB. Free memory was 159.3MB in the beginning and 155.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 02:02:08,182 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 130.0MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.28ms. Allocated memory is still 182.5MB. Free memory was 151.3MB in the beginning and 142.8MB in the end (delta: 8.5MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.41ms. Allocated memory is still 182.5MB. Free memory was 142.8MB in the beginning and 141.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.28ms. Allocated memory is still 182.5MB. Free memory was 141.8MB in the beginning and 140.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 287.07ms. Allocated memory is still 182.5MB. Free memory was 139.7MB in the beginning and 129.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3283.21ms. Allocated memory was 182.5MB in the beginning and 222.3MB in the end (delta: 39.8MB). Free memory was 128.2MB in the beginning and 159.3MB in the end (delta: -31.1MB). Peak memory consumption was 106.3MB. Max. memory is 16.1GB. * Witness Printer took 63.12ms. Allocated memory is still 222.3MB. Free memory was 159.3MB in the beginning and 155.1MB in the end (delta: 4.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: 13]: 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, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 8, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 763 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 576 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 629 IncrementalHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 187 mSDtfsCounter, 629 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 228 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=7, InterpolantAutomatonStates: 54, 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, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 1027 SizeOfPredicates, 1 NumberOfNonLiveVariables, 169 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 1573/1599 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: 16]: Loop Invariant Derived loop invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((((2 == j) && (i == 1)) || ((i == 0) && (j == 0))) || ((((j <= 4) && (((long long) 2 * i) <= ((long long) 6 + j))) && (2 <= j)) && (((long long) 2 + j) <= ((long long) 2 * i)))) || (((1 <= i) && (i <= 3)) && (j == 0))) || (((j <= 4) && (j == ((long long) 2 * i))) && (2 <= i))) - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-14 02:02:08,203 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