./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77987d39218daa3d8ca19fe9337f6493b276d704fa95c2d6fb7800ec30efdcea --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:34:12,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:34:12,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:34:12,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:34:12,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:34:12,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:34:12,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:34:12,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:34:12,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:34:12,326 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:34:12,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:34:12,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:34:12,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:34:12,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:34:12,328 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:34:12,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:34:12,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:34:12,329 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:34:12,329 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:34:12,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:34:12,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:34:12,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:34:12,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:34:12,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:34:12,332 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:34:12,332 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:34:12,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:34:12,333 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:34:12,333 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:34:12,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:34:12,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:34:12,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:34:12,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:34:12,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:34:12,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:34:12,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:34:12,334 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:34:12,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:34:12,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:34:12,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:34:12,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:34:12,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:34:12,336 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 -> 77987d39218daa3d8ca19fe9337f6493b276d704fa95c2d6fb7800ec30efdcea [2024-11-09 22:34:12,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:34:12,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:34:12,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:34:12,545 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:34:12,545 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:34:12,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound5.c [2024-11-09 22:34:13,809 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:34:13,948 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:34:13,949 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound5.c [2024-11-09 22:34:13,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/508fb199c/070524283cf94a06b2571fba5da81ab2/FLAG1bc122b74 [2024-11-09 22:34:14,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/508fb199c/070524283cf94a06b2571fba5da81ab2 [2024-11-09 22:34:14,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:34:14,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:34:14,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:34:14,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:34:14,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:34:14,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:34:14" (1/1) ... [2024-11-09 22:34:14,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b5834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:34:14, skipping insertion in model container [2024-11-09 22:34:14,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:34:14" (1/1) ... [2024-11-09 22:34:14,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:34:14,527 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound5.c[489,502] [2024-11-09 22:34:14,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:34:14,549 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:34:14,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound5.c[489,502] [2024-11-09 22:34:14,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:34:14,575 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:34:14,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:34:14 WrapperNode [2024-11-09 22:34:14,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:34:14,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:34:14,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:34:14,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:34:14,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:34:14" (1/1) ... [2024-11-09 22:34:14,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:34:14" (1/1) ... [2024-11-09 22:34:14,602 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2024-11-09 22:34:14,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:34:14,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:34:14,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:34:14,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:34:14,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:34:14" (1/1) ... [2024-11-09 22:34:14,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:34:14" (1/1) ... [2024-11-09 22:34:14,613 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:34:14" (1/1) ... [2024-11-09 22:34:14,634 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 22:34:14,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:34:14" (1/1) ... [2024-11-09 22:34:14,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:34:14" (1/1) ... [2024-11-09 22:34:14,637 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:34:14" (1/1) ... [2024-11-09 22:34:14,637 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:34:14" (1/1) ... [2024-11-09 22:34:14,638 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:34:14" (1/1) ... [2024-11-09 22:34:14,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:34:14" (1/1) ... [2024-11-09 22:34:14,640 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:34:14,640 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:34:14,640 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:34:14,640 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:34:14,641 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:34:14" (1/1) ... [2024-11-09 22:34:14,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:34:14,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:34:14,667 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 22:34:14,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 22:34:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:34:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 22:34:14,705 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 22:34:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:34:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:34:14,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:34:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 22:34:14,705 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 22:34:14,771 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:34:14,773 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:34:14,933 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-09 22:34:14,934 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:34:14,945 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:34:14,945 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:34:14,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:34:14 BoogieIcfgContainer [2024-11-09 22:34:14,946 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:34:14,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:34:14,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:34:14,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:34:14,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:34:14" (1/3) ... [2024-11-09 22:34:14,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7486e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:34:14, skipping insertion in model container [2024-11-09 22:34:14,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:34:14" (2/3) ... [2024-11-09 22:34:14,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7486e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:34:14, skipping insertion in model container [2024-11-09 22:34:14,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:34:14" (3/3) ... [2024-11-09 22:34:14,954 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound5.c [2024-11-09 22:34:14,967 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:34:14,967 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:34:15,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:34:15,015 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;@194a1392, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:34:15,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:34:15,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 22:34:15,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 22:34:15,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:34:15,048 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:34:15,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:34:15,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:34:15,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1538472981, now seen corresponding path program 1 times [2024-11-09 22:34:15,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:34:15,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739431678] [2024-11-09 22:34:15,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:15,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:34:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:15,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:34:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:15,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:34:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:34:15,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:34:15,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739431678] [2024-11-09 22:34:15,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739431678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:34:15,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:34:15,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 22:34:15,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010583996] [2024-11-09 22:34:15,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:34:15,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 22:34:15,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:34:15,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 22:34:15,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:34:15,248 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:34:15,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:34:15,266 INFO L93 Difference]: Finished difference Result 59 states and 91 transitions. [2024-11-09 22:34:15,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 22:34:15,268 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-11-09 22:34:15,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:34:15,273 INFO L225 Difference]: With dead ends: 59 [2024-11-09 22:34:15,273 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 22:34:15,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:34:15,279 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:34:15,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:34:15,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 22:34:15,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 22:34:15,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 22:34:15,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-11-09 22:34:15,319 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 19 [2024-11-09 22:34:15,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:34:15,319 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-11-09 22:34:15,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:34:15,319 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2024-11-09 22:34:15,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 22:34:15,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:34:15,321 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:34:15,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:34:15,321 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:34:15,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:34:15,322 INFO L85 PathProgramCache]: Analyzing trace with hash -113582382, now seen corresponding path program 1 times [2024-11-09 22:34:15,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:34:15,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298408101] [2024-11-09 22:34:15,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:15,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:34:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:15,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:34:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:15,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:34:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:34:15,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:34:15,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298408101] [2024-11-09 22:34:15,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298408101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:34:15,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:34:15,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:34:15,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488120978] [2024-11-09 22:34:15,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:34:15,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:34:15,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:34:15,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:34:15,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:34:15,434 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 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-11-09 22:34:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:34:15,457 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2024-11-09 22:34:15,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:34:15,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 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 20 [2024-11-09 22:34:15,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:34:15,462 INFO L225 Difference]: With dead ends: 40 [2024-11-09 22:34:15,462 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 22:34:15,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:34:15,463 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 5 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 90 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-11-09 22:34:15,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 90 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:34:15,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 22:34:15,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 22:34:15,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 22:34:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-11-09 22:34:15,476 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 20 [2024-11-09 22:34:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:34:15,477 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-11-09 22:34:15,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 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-11-09 22:34:15,477 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-11-09 22:34:15,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 22:34:15,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:34:15,478 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:34:15,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:34:15,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:34:15,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:34:15,479 INFO L85 PathProgramCache]: Analyzing trace with hash -79412105, now seen corresponding path program 1 times [2024-11-09 22:34:15,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:34:15,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840933381] [2024-11-09 22:34:15,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:15,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:34:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:34:15,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1580145298] [2024-11-09 22:34:15,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:15,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:34:15,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:34:15,518 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:34:15,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 22:34:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:15,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 22:34:15,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:34:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:34:15,688 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:34:15,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:34:15,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840933381] [2024-11-09 22:34:15,689 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:34:15,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580145298] [2024-11-09 22:34:15,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580145298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:34:15,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:34:15,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:34:15,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532944759] [2024-11-09 22:34:15,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:34:15,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:34:15,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:34:15,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:34:15,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:34:15,691 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 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-11-09 22:34:15,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:34:15,734 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2024-11-09 22:34:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:34:15,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 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 20 [2024-11-09 22:34:15,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:34:15,735 INFO L225 Difference]: With dead ends: 47 [2024-11-09 22:34:15,735 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 22:34:15,736 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-11-09 22:34:15,736 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:34:15,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 125 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:34:15,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 22:34:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-11-09 22:34:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 22:34:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2024-11-09 22:34:15,744 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 20 [2024-11-09 22:34:15,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:34:15,744 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2024-11-09 22:34:15,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 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-11-09 22:34:15,744 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2024-11-09 22:34:15,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 22:34:15,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:34:15,745 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:34:15,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 22:34:15,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:34:15,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:34:15,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:34:15,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1572424285, now seen corresponding path program 1 times [2024-11-09 22:34:15,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:34:15,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280394825] [2024-11-09 22:34:15,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:15,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:34:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:34:15,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [392281747] [2024-11-09 22:34:15,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:15,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:34:15,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:34:15,976 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:34:15,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 22:34:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:16,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 22:34:16,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:34:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:34:16,056 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:34:16,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:34:16,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280394825] [2024-11-09 22:34:16,057 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:34:16,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392281747] [2024-11-09 22:34:16,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392281747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:34:16,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:34:16,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:34:16,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858547791] [2024-11-09 22:34:16,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:34:16,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:34:16,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:34:16,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:34:16,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:34:16,058 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 22:34:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:34:16,107 INFO L93 Difference]: Finished difference Result 69 states and 102 transitions. [2024-11-09 22:34:16,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:34:16,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-11-09 22:34:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:34:16,110 INFO L225 Difference]: With dead ends: 69 [2024-11-09 22:34:16,110 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 22:34:16,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:34:16,111 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:34:16,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 118 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:34:16,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 22:34:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2024-11-09 22:34:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 35 states have internal predecessors, (45), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 22:34:16,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2024-11-09 22:34:16,123 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 25 [2024-11-09 22:34:16,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:34:16,123 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2024-11-09 22:34:16,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 22:34:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2024-11-09 22:34:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 22:34:16,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:34:16,124 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:34:16,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 22:34:16,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 22:34:16,327 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:34:16,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:34:16,328 INFO L85 PathProgramCache]: Analyzing trace with hash 665993143, now seen corresponding path program 1 times [2024-11-09 22:34:16,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:34:16,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37828382] [2024-11-09 22:34:16,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:16,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:34:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:34:16,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1908264976] [2024-11-09 22:34:16,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:16,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:34:16,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:34:16,355 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:34:16,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 22:34:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:16,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 22:34:16,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:34:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 22:34:16,478 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:34:16,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:34:16,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37828382] [2024-11-09 22:34:16,479 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:34:16,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908264976] [2024-11-09 22:34:16,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908264976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:34:16,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:34:16,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:34:16,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873896642] [2024-11-09 22:34:16,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:34:16,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:34:16,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:34:16,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:34:16,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:34:16,481 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 22:34:16,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:34:16,532 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2024-11-09 22:34:16,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:34:16,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2024-11-09 22:34:16,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:34:16,534 INFO L225 Difference]: With dead ends: 67 [2024-11-09 22:34:16,534 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 22:34:16,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:34:16,535 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:34:16,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 115 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:34:16,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 22:34:16,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-09 22:34:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 38 states have internal predecessors, (48), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 22:34:16,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2024-11-09 22:34:16,546 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 30 [2024-11-09 22:34:16,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:34:16,546 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2024-11-09 22:34:16,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 22:34:16,546 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2024-11-09 22:34:16,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 22:34:16,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:34:16,547 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:34:16,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 22:34:16,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:34:16,749 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:34:16,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:34:16,749 INFO L85 PathProgramCache]: Analyzing trace with hash -229716128, now seen corresponding path program 1 times [2024-11-09 22:34:16,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:34:16,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516634282] [2024-11-09 22:34:16,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:16,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:34:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:16,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:34:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:16,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:34:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:16,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:34:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:16,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 22:34:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:16,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:34:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 22:34:16,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:34:16,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516634282] [2024-11-09 22:34:16,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516634282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:34:16,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:34:16,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:34:16,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321086563] [2024-11-09 22:34:16,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:34:16,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:34:16,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:34:16,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:34:16,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:34:16,868 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 22:34:16,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:34:16,900 INFO L93 Difference]: Finished difference Result 75 states and 102 transitions. [2024-11-09 22:34:16,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:34:16,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2024-11-09 22:34:16,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:34:16,901 INFO L225 Difference]: With dead ends: 75 [2024-11-09 22:34:16,901 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 22:34:16,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:34:16,902 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:34:16,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 139 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:34:16,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 22:34:16,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2024-11-09 22:34:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 43 states have internal predecessors, (51), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 22:34:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2024-11-09 22:34:16,911 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 93 transitions. Word has length 36 [2024-11-09 22:34:16,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:34:16,911 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 93 transitions. [2024-11-09 22:34:16,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 22:34:16,911 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2024-11-09 22:34:16,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 22:34:16,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:34:16,912 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:34:16,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 22:34:16,912 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:34:16,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:34:16,913 INFO L85 PathProgramCache]: Analyzing trace with hash -907810744, now seen corresponding path program 1 times [2024-11-09 22:34:16,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:34:16,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385849044] [2024-11-09 22:34:16,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:16,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:34:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:17,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:34:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:17,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:34:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:17,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:34:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:17,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 22:34:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:17,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:34:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:17,033 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 22:34:17,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:34:17,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385849044] [2024-11-09 22:34:17,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385849044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:34:17,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756103785] [2024-11-09 22:34:17,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:17,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:34:17,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:34:17,037 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:34:17,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 22:34:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:17,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 22:34:17,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:34:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 22:34:17,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:34:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 22:34:17,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756103785] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:34:17,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:34:17,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-11-09 22:34:17,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556364531] [2024-11-09 22:34:17,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:34:17,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 22:34:17,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:34:17,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 22:34:17,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 22:34:17,220 INFO L87 Difference]: Start difference. First operand 68 states and 93 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-11-09 22:34:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:34:17,336 INFO L93 Difference]: Finished difference Result 205 states and 260 transitions. [2024-11-09 22:34:17,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 22:34:17,336 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 39 [2024-11-09 22:34:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:34:17,340 INFO L225 Difference]: With dead ends: 205 [2024-11-09 22:34:17,340 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 22:34:17,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:34:17,341 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 55 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:34:17,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 163 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:34:17,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 22:34:17,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 181. [2024-11-09 22:34:17,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 117 states have internal predecessors, (133), 51 states have call successors, (51), 21 states have call predecessors, (51), 20 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-09 22:34:17,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 228 transitions. [2024-11-09 22:34:17,367 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 228 transitions. Word has length 39 [2024-11-09 22:34:17,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:34:17,367 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 228 transitions. [2024-11-09 22:34:17,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-11-09 22:34:17,368 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 228 transitions. [2024-11-09 22:34:17,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 22:34:17,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:34:17,368 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:34:17,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 22:34:17,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:34:17,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:34:17,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:34:17,570 INFO L85 PathProgramCache]: Analyzing trace with hash 869169868, now seen corresponding path program 1 times [2024-11-09 22:34:17,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:34:17,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949520301] [2024-11-09 22:34:17,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:17,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:34:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:34:17,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1434822471] [2024-11-09 22:34:17,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:17,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:34:17,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:34:17,589 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:34:17,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 22:34:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:17,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 22:34:17,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:34:17,697 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 22:34:17,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:34:17,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:34:17,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949520301] [2024-11-09 22:34:17,698 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:34:17,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434822471] [2024-11-09 22:34:17,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434822471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:34:17,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:34:17,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:34:17,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936218478] [2024-11-09 22:34:17,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:34:17,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:34:17,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:34:17,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:34:17,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:34:17,700 INFO L87 Difference]: Start difference. First operand 181 states and 228 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 22:34:17,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:34:17,745 INFO L93 Difference]: Finished difference Result 205 states and 258 transitions. [2024-11-09 22:34:17,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:34:17,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2024-11-09 22:34:17,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:34:17,747 INFO L225 Difference]: With dead ends: 205 [2024-11-09 22:34:17,747 INFO L226 Difference]: Without dead ends: 202 [2024-11-09 22:34:17,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:34:17,748 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:34:17,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 116 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:34:17,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-09 22:34:17,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2024-11-09 22:34:17,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 129 states have internal predecessors, (142), 58 states have call successors, (58), 24 states have call predecessors, (58), 23 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-09 22:34:17,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 251 transitions. [2024-11-09 22:34:17,788 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 251 transitions. Word has length 39 [2024-11-09 22:34:17,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:34:17,789 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 251 transitions. [2024-11-09 22:34:17,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 22:34:17,789 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 251 transitions. [2024-11-09 22:34:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 22:34:17,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:34:17,790 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:34:17,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 22:34:17,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:34:17,994 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:34:17,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:34:17,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2125859942, now seen corresponding path program 1 times [2024-11-09 22:34:17,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:34:17,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479508732] [2024-11-09 22:34:17,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:17,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:34:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:18,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:34:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:18,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:34:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:18,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:34:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:18,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 22:34:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:18,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:34:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:18,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:34:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 22:34:18,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:34:18,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479508732] [2024-11-09 22:34:18,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479508732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:34:18,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418512163] [2024-11-09 22:34:18,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:18,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:34:18,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:34:18,211 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:34:18,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 22:34:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:18,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 22:34:18,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:34:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 22:34:18,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:34:18,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418512163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:34:18,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 22:34:18,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-11-09 22:34:18,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416523617] [2024-11-09 22:34:18,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:34:18,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 22:34:18,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:34:18,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 22:34:18,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:34:18,380 INFO L87 Difference]: Start difference. First operand 200 states and 251 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 22:34:18,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:34:18,464 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2024-11-09 22:34:18,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:34:18,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2024-11-09 22:34:18,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:34:18,467 INFO L225 Difference]: With dead ends: 232 [2024-11-09 22:34:18,467 INFO L226 Difference]: Without dead ends: 221 [2024-11-09 22:34:18,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-09 22:34:18,468 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:34:18,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 141 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:34:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-09 22:34:18,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 217. [2024-11-09 22:34:18,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 131 states have (on average 1.1755725190839694) internal successors, (154), 142 states have internal predecessors, (154), 57 states have call successors, (57), 28 states have call predecessors, (57), 28 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-09 22:34:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 262 transitions. [2024-11-09 22:34:18,497 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 262 transitions. Word has length 41 [2024-11-09 22:34:18,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:34:18,498 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 262 transitions. [2024-11-09 22:34:18,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 22:34:18,498 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 262 transitions. [2024-11-09 22:34:18,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 22:34:18,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:34:18,502 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:34:18,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 22:34:18,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:34:18,703 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:34:18,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:34:18,703 INFO L85 PathProgramCache]: Analyzing trace with hash -130603539, now seen corresponding path program 1 times [2024-11-09 22:34:18,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:34:18,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406839046] [2024-11-09 22:34:18,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:18,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:34:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:34:18,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2130637488] [2024-11-09 22:34:18,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:18,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:34:18,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:34:18,715 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:34:18,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 22:34:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:18,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 22:34:18,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:34:18,870 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 22:34:18,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:34:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 22:34:19,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:34:19,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406839046] [2024-11-09 22:34:19,004 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:34:19,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130637488] [2024-11-09 22:34:19,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130637488] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:34:19,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:34:19,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-09 22:34:19,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175964987] [2024-11-09 22:34:19,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:34:19,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 22:34:19,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:34:19,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 22:34:19,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 22:34:19,006 INFO L87 Difference]: Start difference. First operand 217 states and 262 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-09 22:34:19,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:34:19,419 INFO L93 Difference]: Finished difference Result 257 states and 319 transitions. [2024-11-09 22:34:19,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 22:34:19,420 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 44 [2024-11-09 22:34:19,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:34:19,422 INFO L225 Difference]: With dead ends: 257 [2024-11-09 22:34:19,422 INFO L226 Difference]: Without dead ends: 214 [2024-11-09 22:34:19,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:34:19,423 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 18 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 22:34:19,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 157 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 22:34:19,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-09 22:34:19,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 189. [2024-11-09 22:34:19,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 121 states have (on average 1.1570247933884297) internal successors, (140), 127 states have internal predecessors, (140), 43 states have call successors, (43), 25 states have call predecessors, (43), 24 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 22:34:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 221 transitions. [2024-11-09 22:34:19,455 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 221 transitions. Word has length 44 [2024-11-09 22:34:19,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:34:19,455 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 221 transitions. [2024-11-09 22:34:19,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-09 22:34:19,455 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 221 transitions. [2024-11-09 22:34:19,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 22:34:19,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:34:19,456 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:34:19,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 22:34:19,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:34:19,661 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:34:19,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:34:19,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1571266966, now seen corresponding path program 1 times [2024-11-09 22:34:19,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:34:19,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455260715] [2024-11-09 22:34:19,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:19,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:34:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:34:19,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [110358778] [2024-11-09 22:34:19,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:19,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:34:19,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:34:19,676 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:34:19,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 22:34:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:19,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 22:34:19,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:34:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-09 22:34:19,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:34:20,053 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 22:34:20,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:34:20,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455260715] [2024-11-09 22:34:20,054 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:34:20,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110358778] [2024-11-09 22:34:20,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110358778] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:34:20,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:34:20,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2024-11-09 22:34:20,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664419937] [2024-11-09 22:34:20,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:34:20,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 22:34:20,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:34:20,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 22:34:20,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-09 22:34:20,056 INFO L87 Difference]: Start difference. First operand 189 states and 221 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 12 states have internal predecessors, (39), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-09 22:34:20,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:34:20,399 INFO L93 Difference]: Finished difference Result 210 states and 248 transitions. [2024-11-09 22:34:20,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 22:34:20,399 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 12 states have internal predecessors, (39), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 58 [2024-11-09 22:34:20,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:34:20,401 INFO L225 Difference]: With dead ends: 210 [2024-11-09 22:34:20,401 INFO L226 Difference]: Without dead ends: 202 [2024-11-09 22:34:20,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2024-11-09 22:34:20,401 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 33 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:34:20,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 392 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 22:34:20,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-09 22:34:20,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 180. [2024-11-09 22:34:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 121 states have (on average 1.1487603305785123) internal successors, (139), 123 states have internal predecessors, (139), 34 states have call successors, (34), 25 states have call predecessors, (34), 24 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 22:34:20,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 205 transitions. [2024-11-09 22:34:20,422 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 205 transitions. Word has length 58 [2024-11-09 22:34:20,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:34:20,422 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 205 transitions. [2024-11-09 22:34:20,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 12 states have internal predecessors, (39), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-09 22:34:20,422 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 205 transitions. [2024-11-09 22:34:20,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 22:34:20,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:34:20,423 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:34:20,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 22:34:20,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 22:34:20,624 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:34:20,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:34:20,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1720414236, now seen corresponding path program 1 times [2024-11-09 22:34:20,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:34:20,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807728928] [2024-11-09 22:34:20,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:20,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:34:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:20,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:34:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:20,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:34:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:20,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:34:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:20,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 22:34:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:20,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:34:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:20,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 22:34:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:20,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:34:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:20,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 22:34:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:20,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 22:34:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:20,764 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-09 22:34:20,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:34:20,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807728928] [2024-11-09 22:34:20,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807728928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:34:20,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949964607] [2024-11-09 22:34:20,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:20,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:34:20,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:34:20,766 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:34:20,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 22:34:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:20,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 22:34:20,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:34:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-09 22:34:20,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:34:20,933 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-09 22:34:20,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949964607] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:34:20,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:34:20,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 13 [2024-11-09 22:34:20,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412385583] [2024-11-09 22:34:20,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:34:20,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 22:34:20,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:34:20,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 22:34:20,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-09 22:34:20,934 INFO L87 Difference]: Start difference. First operand 180 states and 205 transitions. Second operand has 13 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 22:34:21,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:34:21,026 INFO L93 Difference]: Finished difference Result 207 states and 235 transitions. [2024-11-09 22:34:21,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 22:34:21,026 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) Word has length 60 [2024-11-09 22:34:21,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:34:21,027 INFO L225 Difference]: With dead ends: 207 [2024-11-09 22:34:21,027 INFO L226 Difference]: Without dead ends: 186 [2024-11-09 22:34:21,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-09 22:34:21,028 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:34:21,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 141 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:34:21,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-09 22:34:21,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-09 22:34:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 125 states have (on average 1.112) internal successors, (139), 129 states have internal predecessors, (139), 36 states have call successors, (36), 24 states have call predecessors, (36), 24 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 22:34:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 209 transitions. [2024-11-09 22:34:21,048 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 209 transitions. Word has length 60 [2024-11-09 22:34:21,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:34:21,066 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 209 transitions. [2024-11-09 22:34:21,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 22:34:21,067 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 209 transitions. [2024-11-09 22:34:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 22:34:21,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:34:21,068 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:34:21,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 22:34:21,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:34:21,269 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:34:21,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:34:21,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1800998738, now seen corresponding path program 2 times [2024-11-09 22:34:21,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:34:21,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73486172] [2024-11-09 22:34:21,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:21,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:34:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:21,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:34:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:21,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:34:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:21,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:34:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:21,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 22:34:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:21,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:34:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:21,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 22:34:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:21,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:34:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:21,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 22:34:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:21,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 22:34:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:21,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 22:34:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:21,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 22:34:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:21,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 22:34:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:21,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 22:34:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:21,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 22:34:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:34:21,419 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-09 22:34:21,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:34:21,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73486172] [2024-11-09 22:34:21,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73486172] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:34:21,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847526442] [2024-11-09 22:34:21,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:34:21,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:34:21,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:34:21,421 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:34:21,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 22:34:21,472 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:34:21,472 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:34:21,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 22:34:21,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:34:21,586 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-09 22:34:21,587 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:34:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-09 22:34:21,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847526442] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:34:21,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:34:21,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 10 [2024-11-09 22:34:21,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918936011] [2024-11-09 22:34:21,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:34:21,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 22:34:21,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:34:21,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 22:34:21,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-09 22:34:21,692 INFO L87 Difference]: Start difference. First operand 186 states and 209 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 7 states have call successors, (31), 7 states have call predecessors, (31), 6 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) [2024-11-09 22:34:21,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:34:21,786 INFO L93 Difference]: Finished difference Result 249 states and 283 transitions. [2024-11-09 22:34:21,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 22:34:21,786 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 7 states have call successors, (31), 7 states have call predecessors, (31), 6 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) Word has length 96 [2024-11-09 22:34:21,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:34:21,787 INFO L225 Difference]: With dead ends: 249 [2024-11-09 22:34:21,787 INFO L226 Difference]: Without dead ends: 239 [2024-11-09 22:34:21,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 212 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-09 22:34:21,788 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:34:21,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 116 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:34:21,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-09 22:34:21,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2024-11-09 22:34:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 160 states have (on average 1.10625) internal successors, (177), 165 states have internal predecessors, (177), 47 states have call successors, (47), 31 states have call predecessors, (47), 31 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 22:34:21,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 269 transitions. [2024-11-09 22:34:21,839 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 269 transitions. Word has length 96 [2024-11-09 22:34:21,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:34:21,840 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 269 transitions. [2024-11-09 22:34:21,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 7 states have call successors, (31), 7 states have call predecessors, (31), 6 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) [2024-11-09 22:34:21,840 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 269 transitions. [2024-11-09 22:34:21,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 22:34:21,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:34:21,841 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:34:21,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 22:34:22,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 22:34:22,046 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:34:22,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:34:22,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1612900296, now seen corresponding path program 3 times [2024-11-09 22:34:22,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:34:22,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864532795] [2024-11-09 22:34:22,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:34:22,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:34:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:34:22,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1606999440] [2024-11-09 22:34:22,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 22:34:22,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:34:22,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:34:22,067 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:34:22,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 22:34:22,153 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-09 22:34:22,153 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 22:34:22,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 22:34:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:34:22,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 22:34:22,206 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 22:34:22,207 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 22:34:22,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 22:34:22,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 22:34:22,415 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:34:22,455 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 22:34:22,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:34:22 BoogieIcfgContainer [2024-11-09 22:34:22,457 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 22:34:22,459 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 22:34:22,459 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 22:34:22,459 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 22:34:22,459 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:34:14" (3/4) ... [2024-11-09 22:34:22,460 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 22:34:22,530 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 22:34:22,530 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 22:34:22,531 INFO L158 Benchmark]: Toolchain (without parser) took 8146.49ms. Allocated memory was 220.2MB in the beginning and 285.2MB in the end (delta: 65.0MB). Free memory was 150.2MB in the beginning and 236.9MB in the end (delta: -86.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:34:22,533 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 123.7MB. Free memory was 91.3MB in the beginning and 91.1MB in the end (delta: 148.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:34:22,533 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.72ms. Allocated memory is still 220.2MB. Free memory was 150.2MB in the beginning and 137.3MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 22:34:22,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.78ms. Allocated memory is still 220.2MB. Free memory was 137.3MB in the beginning and 135.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:34:22,533 INFO L158 Benchmark]: Boogie Preprocessor took 36.76ms. Allocated memory is still 220.2MB. Free memory was 135.8MB in the beginning and 134.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:34:22,533 INFO L158 Benchmark]: IcfgBuilder took 305.80ms. Allocated memory is still 220.2MB. Free memory was 134.1MB in the beginning and 121.8MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 22:34:22,534 INFO L158 Benchmark]: TraceAbstraction took 7509.97ms. Allocated memory was 220.2MB in the beginning and 285.2MB in the end (delta: 65.0MB). Free memory was 121.2MB in the beginning and 242.1MB in the end (delta: -120.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:34:22,534 INFO L158 Benchmark]: Witness Printer took 71.67ms. Allocated memory is still 285.2MB. Free memory was 242.1MB in the beginning and 236.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 22:34:22,535 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.15ms. Allocated memory is still 123.7MB. Free memory was 91.3MB in the beginning and 91.1MB in the end (delta: 148.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.72ms. Allocated memory is still 220.2MB. Free memory was 150.2MB in the beginning and 137.3MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.78ms. Allocated memory is still 220.2MB. Free memory was 137.3MB in the beginning and 135.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.76ms. Allocated memory is still 220.2MB. Free memory was 135.8MB in the beginning and 134.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 305.80ms. Allocated memory is still 220.2MB. Free memory was 134.1MB in the beginning and 121.8MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7509.97ms. Allocated memory was 220.2MB in the beginning and 285.2MB in the end (delta: 65.0MB). Free memory was 121.2MB in the beginning and 242.1MB in the end (delta: -120.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 71.67ms. Allocated memory is still 285.2MB. Free memory was 242.1MB in the beginning and 236.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [counter=0] [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [counter=0, x=7, y=1] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [counter=0, x=7, y=1] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=7, b=1, counter=0, p=1, q=0, r=0, s=1, x=7, y=1] [L34] EXPR counter++ VAL [a=7, b=1, counter=1, p=1, q=0, r=0, s=1, x=7, y=1] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=7, b=1, counter=1, p=1, q=0, r=0, s=1, x=7, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=7, b=1, counter=1, p=1, q=0, r=0, s=1, x=7, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=7, b=1, counter=1, p=1, q=0, r=0, s=1, x=7, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=7, b=1, counter=1, p=1, q=0, r=0, s=1, x=7, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=6, b=1, counter=1, p=1, q=0, r=-1, s=1, x=7, y=1] [L34] EXPR counter++ VAL [a=6, b=1, counter=2, p=1, q=0, r=-1, s=1, x=7, y=1] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=6, b=1, counter=2, p=1, q=0, r=-1, s=1, x=7, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=6, b=1, counter=2, p=1, q=0, r=-1, s=1, x=7, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=6, b=1, counter=2, p=1, q=0, r=-1, s=1, x=7, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=6, b=1, counter=2, p=1, q=0, r=-1, s=1, x=7, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=5, b=1, counter=2, p=1, q=0, r=-2, s=1, x=7, y=1] [L34] EXPR counter++ VAL [a=5, b=1, counter=3, p=1, q=0, r=-2, s=1, x=7, y=1] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=5, b=1, counter=3, p=1, q=0, r=-2, s=1, x=7, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=5, b=1, counter=3, p=1, q=0, r=-2, s=1, x=7, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=5, b=1, counter=3, p=1, q=0, r=-2, s=1, x=7, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=5, b=1, counter=3, p=1, q=0, r=-2, s=1, x=7, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=4, b=1, counter=3, p=1, q=0, r=-3, s=1, x=7, y=1] [L34] EXPR counter++ VAL [a=4, b=1, counter=4, p=1, q=0, r=-3, s=1, x=7, y=1] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=4, b=1, counter=4, p=1, q=0, r=-3, s=1, x=7, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=4, b=1, counter=4, p=1, q=0, r=-3, s=1, x=7, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=4, b=1, counter=4, p=1, q=0, r=-3, s=1, x=7, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=4, b=1, counter=4, p=1, q=0, r=-3, s=1, x=7, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=3, b=1, counter=4, p=1, q=0, r=-4, s=1, x=7, y=1] [L34] EXPR counter++ VAL [a=3, b=1, counter=5, p=1, q=0, r=-4, s=1, x=7, y=1] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=3, b=1, counter=5, p=1, q=0, r=-4, s=1, x=7, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=3, b=1, counter=5, p=1, q=0, r=-4, s=1, x=7, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=3, b=1, counter=5, p=1, q=0, r=-4, s=1, x=7, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=3, b=1, counter=5, p=1, q=0, r=-4, s=1, x=7, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=2, b=1, counter=5, p=1, q=0, r=-5, s=1, x=7, y=1] [L34] EXPR counter++ VAL [a=2, b=1, counter=6, p=1, q=0, r=-5, s=1, x=7, y=1] [L34] COND FALSE !(counter++<5) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, counter=6] [L11] COND TRUE !(cond) VAL [\old(cond)=0, counter=6] [L13] reach_error() VAL [\old(cond)=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 14, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 1853 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1405 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 737 IncrementalHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 448 mSDtfsCounter, 737 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 884 GetRequests, 782 SyntacticMatches, 8 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=13, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 74 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1209 NumberOfCodeBlocks, 1209 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1038 ConstructedInterpolants, 0 QuantifiedInterpolants, 2884 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1232 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 22 InterpolantComputations, 8 PerfectInterpolantSequences, 1402/1829 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-09 22:34:22,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE