./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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/cohencu-ll_unwindbound20.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 820aaba80b9c7e4ca2ad4a6a908bac2e6f59545dc6a131cb9fae6306b993a9eb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 06:57:24,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 06:57:24,511 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 06:57:24,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 06:57:24,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 06:57:24,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 06:57:24,542 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 06:57:24,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 06:57:24,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 06:57:24,543 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 06:57:24,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 06:57:24,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 06:57:24,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 06:57:24,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 06:57:24,544 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 06:57:24,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 06:57:24,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 06:57:24,547 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 06:57:24,547 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 06:57:24,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 06:57:24,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 06:57:24,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 06:57:24,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 06:57:24,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 06:57:24,551 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 06:57:24,552 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 06:57:24,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 06:57:24,552 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 06:57:24,553 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 06:57:24,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 06:57:24,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 06:57:24,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 06:57:24,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:57:24,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 06:57:24,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 06:57:24,554 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 06:57:24,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 06:57:24,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 06:57:24,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 06:57:24,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 06:57:24,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 06:57:24,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 06:57:24,556 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 -> 820aaba80b9c7e4ca2ad4a6a908bac2e6f59545dc6a131cb9fae6306b993a9eb [2024-11-16 06:57:24,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 06:57:24,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 06:57:24,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 06:57:24,768 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 06:57:24,768 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 06:57:24,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2024-11-16 06:57:25,923 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 06:57:26,047 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 06:57:26,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2024-11-16 06:57:26,053 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23fdc9999/239c7f9bda64495cbb69d4ba25cb33e3/FLAGd4bd2b996 [2024-11-16 06:57:26,469 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23fdc9999/239c7f9bda64495cbb69d4ba25cb33e3 [2024-11-16 06:57:26,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 06:57:26,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 06:57:26,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 06:57:26,473 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 06:57:26,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 06:57:26,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:57:26" (1/1) ... [2024-11-16 06:57:26,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659ee8e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:26, skipping insertion in model container [2024-11-16 06:57:26,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:57:26" (1/1) ... [2024-11-16 06:57:26,493 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 06:57:26,649 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/cohencu-ll_unwindbound20.c[588,601] [2024-11-16 06:57:26,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:57:26,672 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 06:57:26,681 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/cohencu-ll_unwindbound20.c[588,601] [2024-11-16 06:57:26,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:57:26,705 INFO L204 MainTranslator]: Completed translation [2024-11-16 06:57:26,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:26 WrapperNode [2024-11-16 06:57:26,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 06:57:26,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 06:57:26,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 06:57:26,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 06:57:26,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:26" (1/1) ... [2024-11-16 06:57:26,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:26" (1/1) ... [2024-11-16 06:57:26,727 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2024-11-16 06:57:26,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 06:57:26,727 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 06:57:26,727 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 06:57:26,727 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 06:57:26,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:26" (1/1) ... [2024-11-16 06:57:26,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:26" (1/1) ... [2024-11-16 06:57:26,736 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:26" (1/1) ... [2024-11-16 06:57:26,744 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-16 06:57:26,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:26" (1/1) ... [2024-11-16 06:57:26,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:26" (1/1) ... [2024-11-16 06:57:26,746 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:26" (1/1) ... [2024-11-16 06:57:26,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:26" (1/1) ... [2024-11-16 06:57:26,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:26" (1/1) ... [2024-11-16 06:57:26,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:26" (1/1) ... [2024-11-16 06:57:26,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 06:57:26,750 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 06:57:26,750 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 06:57:26,750 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 06:57:26,751 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:26" (1/1) ... [2024-11-16 06:57:26,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:57:26,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:26,775 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-16 06:57:26,778 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-16 06:57:26,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 06:57:26,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 06:57:26,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 06:57:26,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 06:57:26,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-16 06:57:26,812 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-16 06:57:26,862 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 06:57:26,863 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 06:57:26,970 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-11-16 06:57:26,970 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 06:57:26,983 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 06:57:26,984 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 06:57:26,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:57:26 BoogieIcfgContainer [2024-11-16 06:57:26,984 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 06:57:26,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 06:57:26,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 06:57:26,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 06:57:26,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:57:26" (1/3) ... [2024-11-16 06:57:26,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a998798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:57:26, skipping insertion in model container [2024-11-16 06:57:26,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:26" (2/3) ... [2024-11-16 06:57:26,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a998798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:57:26, skipping insertion in model container [2024-11-16 06:57:26,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:57:26" (3/3) ... [2024-11-16 06:57:26,993 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound20.c [2024-11-16 06:57:27,010 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 06:57:27,012 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 06:57:27,065 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 06:57:27,071 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;@7bde30cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 06:57:27,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 06:57:27,075 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 06:57:27,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-16 06:57:27,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:27,081 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:27,082 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:27,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:27,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1686356366, now seen corresponding path program 1 times [2024-11-16 06:57:27,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:27,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150806077] [2024-11-16 06:57:27,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:27,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:27,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:57:27,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:27,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150806077] [2024-11-16 06:57:27,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150806077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:57:27,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:57:27,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 06:57:27,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874418842] [2024-11-16 06:57:27,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:57:27,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 06:57:27,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:27,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 06:57:27,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 06:57:27,248 INFO L87 Difference]: Start difference. First operand has 27 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:57:27,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:27,265 INFO L93 Difference]: Finished difference Result 52 states and 89 transitions. [2024-11-16 06:57:27,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 06:57:27,267 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-16 06:57:27,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:27,271 INFO L225 Difference]: With dead ends: 52 [2024-11-16 06:57:27,271 INFO L226 Difference]: Without dead ends: 23 [2024-11-16 06:57:27,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 06:57:27,276 INFO L432 NwaCegarLoop]: 38 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, 38 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-16 06:57:27,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:57:27,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-16 06:57:27,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-16 06:57:27,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-16 06:57:27,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2024-11-16 06:57:27,304 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 8 [2024-11-16 06:57:27,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:27,304 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2024-11-16 06:57:27,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:57:27,305 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2024-11-16 06:57:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 06:57:27,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:27,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:27,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 06:57:27,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:27,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:27,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1994067049, now seen corresponding path program 1 times [2024-11-16 06:57:27,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:27,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110300922] [2024-11-16 06:57:27,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:27,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:27,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:57:27,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:27,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110300922] [2024-11-16 06:57:27,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110300922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:57:27,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:57:27,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 06:57:27,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105109692] [2024-11-16 06:57:27,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:57:27,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 06:57:27,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:27,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 06:57:27,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:57:27,453 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:57:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:27,481 INFO L93 Difference]: Finished difference Result 38 states and 54 transitions. [2024-11-16 06:57:27,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 06:57:27,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-16 06:57:27,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:27,483 INFO L225 Difference]: With dead ends: 38 [2024-11-16 06:57:27,483 INFO L226 Difference]: Without dead ends: 25 [2024-11-16 06:57:27,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:57:27,485 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 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-16 06:57:27,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:57:27,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-16 06:57:27,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-16 06:57:27,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-16 06:57:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2024-11-16 06:57:27,492 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 9 [2024-11-16 06:57:27,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:27,492 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-11-16 06:57:27,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:57:27,493 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2024-11-16 06:57:27,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 06:57:27,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:27,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:27,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 06:57:27,493 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:27,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:27,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2031931410, now seen corresponding path program 1 times [2024-11-16 06:57:27,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:27,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288564222] [2024-11-16 06:57:27,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:27,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:57:27,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:27,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288564222] [2024-11-16 06:57:27,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288564222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:57:27,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:57:27,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 06:57:27,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110022613] [2024-11-16 06:57:27,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:57:27,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 06:57:27,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:27,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 06:57:27,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:57:27,629 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:57:27,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:27,727 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2024-11-16 06:57:27,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 06:57:27,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-16 06:57:27,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:27,728 INFO L225 Difference]: With dead ends: 32 [2024-11-16 06:57:27,728 INFO L226 Difference]: Without dead ends: 29 [2024-11-16 06:57:27,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 06:57:27,729 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:27,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 89 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:57:27,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-16 06:57:27,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-16 06:57:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-16 06:57:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2024-11-16 06:57:27,741 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 9 [2024-11-16 06:57:27,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:27,741 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2024-11-16 06:57:27,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:57:27,742 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-11-16 06:57:27,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-16 06:57:27,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:27,742 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:27,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 06:57:27,742 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:27,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:27,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1400374437, now seen corresponding path program 1 times [2024-11-16 06:57:27,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:27,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039319177] [2024-11-16 06:57:27,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:27,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:27,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1448958371] [2024-11-16 06:57:27,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:27,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:27,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:27,762 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-16 06:57:27,763 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-16 06:57:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:27,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 06:57:27,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:57:27,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 06:57:27,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:27,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039319177] [2024-11-16 06:57:27,867 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 06:57:27,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448958371] [2024-11-16 06:57:27,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448958371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:57:27,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:57:27,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 06:57:27,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008010841] [2024-11-16 06:57:27,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:57:27,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 06:57:27,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:27,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 06:57:27,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:57:27,869 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 06:57:27,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:27,926 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2024-11-16 06:57:27,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 06:57:27,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-16 06:57:27,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:27,927 INFO L225 Difference]: With dead ends: 48 [2024-11-16 06:57:27,927 INFO L226 Difference]: Without dead ends: 45 [2024-11-16 06:57:27,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-16 06:57:27,928 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:27,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 124 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:57:27,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-16 06:57:27,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2024-11-16 06:57:27,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 06:57:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-11-16 06:57:27,937 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 14 [2024-11-16 06:57:27,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:27,937 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-11-16 06:57:27,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 06:57:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-11-16 06:57:27,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-16 06:57:27,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:27,941 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:27,955 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-16 06:57:28,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:28,142 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:28,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:28,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1833948082, now seen corresponding path program 1 times [2024-11-16 06:57:28,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:28,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547682026] [2024-11-16 06:57:28,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:28,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:28,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1226725889] [2024-11-16 06:57:28,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:28,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:28,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:28,159 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-16 06:57:28,165 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-16 06:57:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:28,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 06:57:28,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 06:57:28,235 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 06:57:28,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:28,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547682026] [2024-11-16 06:57:28,236 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 06:57:28,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226725889] [2024-11-16 06:57:28,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226725889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:57:28,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:57:28,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 06:57:28,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829855193] [2024-11-16 06:57:28,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:57:28,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 06:57:28,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:28,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 06:57:28,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:57:28,237 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (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-16 06:57:28,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:28,285 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2024-11-16 06:57:28,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 06:57:28,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (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 19 [2024-11-16 06:57:28,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:28,287 INFO L225 Difference]: With dead ends: 52 [2024-11-16 06:57:28,287 INFO L226 Difference]: Without dead ends: 49 [2024-11-16 06:57:28,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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-16 06:57:28,288 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:28,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 133 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:57:28,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-16 06:57:28,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2024-11-16 06:57:28,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-16 06:57:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2024-11-16 06:57:28,301 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 19 [2024-11-16 06:57:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:28,301 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2024-11-16 06:57:28,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (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-16 06:57:28,301 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2024-11-16 06:57:28,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-16 06:57:28,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:28,302 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:28,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 06:57:28,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:28,503 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:28,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:28,503 INFO L85 PathProgramCache]: Analyzing trace with hash 799704197, now seen corresponding path program 1 times [2024-11-16 06:57:28,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:28,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51750247] [2024-11-16 06:57:28,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:28,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:28,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [6228922] [2024-11-16 06:57:28,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:28,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:28,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:28,517 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-16 06:57:28,518 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-16 06:57:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:28,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 06:57:28,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:28,637 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 06:57:28,637 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 06:57:28,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:28,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51750247] [2024-11-16 06:57:28,637 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 06:57:28,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6228922] [2024-11-16 06:57:28,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6228922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:57:28,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:57:28,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 06:57:28,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859164009] [2024-11-16 06:57:28,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:57:28,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 06:57:28,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:28,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 06:57:28,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:57:28,641 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 06:57:28,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:28,701 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2024-11-16 06:57:28,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 06:57:28,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-11-16 06:57:28,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:28,703 INFO L225 Difference]: With dead ends: 60 [2024-11-16 06:57:28,703 INFO L226 Difference]: Without dead ends: 47 [2024-11-16 06:57:28,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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-16 06:57:28,704 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 4 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:28,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:57:28,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-16 06:57:28,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-16 06:57:28,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 06:57:28,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2024-11-16 06:57:28,717 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 24 [2024-11-16 06:57:28,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:28,717 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2024-11-16 06:57:28,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 06:57:28,718 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2024-11-16 06:57:28,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-16 06:57:28,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:28,723 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:28,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 06:57:28,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:28,923 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:28,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:28,924 INFO L85 PathProgramCache]: Analyzing trace with hash 594587768, now seen corresponding path program 1 times [2024-11-16 06:57:28,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:28,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878558711] [2024-11-16 06:57:28,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:28,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:29,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 06:57:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:29,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 06:57:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:29,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 06:57:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:29,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 06:57:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:29,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 06:57:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:29,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 06:57:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:29,079 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 06:57:29,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:29,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878558711] [2024-11-16 06:57:29,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878558711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:57:29,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482327229] [2024-11-16 06:57:29,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:29,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:29,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:29,081 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-16 06:57:29,087 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-16 06:57:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:29,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 06:57:29,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-16 06:57:29,175 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:29,239 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 06:57:29,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482327229] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:29,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:57:29,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-11-16 06:57:29,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965437322] [2024-11-16 06:57:29,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:29,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 06:57:29,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:29,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 06:57:29,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-16 06:57:29,242 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-16 06:57:29,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:29,414 INFO L93 Difference]: Finished difference Result 120 states and 155 transitions. [2024-11-16 06:57:29,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 06:57:29,414 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 42 [2024-11-16 06:57:29,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:29,415 INFO L225 Difference]: With dead ends: 120 [2024-11-16 06:57:29,416 INFO L226 Difference]: Without dead ends: 103 [2024-11-16 06:57:29,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 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-16 06:57:29,417 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 53 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:29,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 155 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:57:29,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-16 06:57:29,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2024-11-16 06:57:29,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-16 06:57:29,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2024-11-16 06:57:29,440 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 128 transitions. Word has length 42 [2024-11-16 06:57:29,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:29,441 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 128 transitions. [2024-11-16 06:57:29,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-16 06:57:29,441 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 128 transitions. [2024-11-16 06:57:29,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-16 06:57:29,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:29,443 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:29,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-16 06:57:29,643 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-16 06:57:29,643 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:29,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:29,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1422995375, now seen corresponding path program 1 times [2024-11-16 06:57:29,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:29,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341350948] [2024-11-16 06:57:29,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:29,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:29,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1001590508] [2024-11-16 06:57:29,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:29,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:29,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:29,669 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-16 06:57:29,671 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-16 06:57:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:29,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-16 06:57:29,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-16 06:57:29,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-16 06:57:29,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:29,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341350948] [2024-11-16 06:57:29,943 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 06:57:29,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001590508] [2024-11-16 06:57:29,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001590508] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:29,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:57:29,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-16 06:57:29,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400050373] [2024-11-16 06:57:29,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:29,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 06:57:29,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:29,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 06:57:29,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-16 06:57:29,946 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-16 06:57:30,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:30,138 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions. [2024-11-16 06:57:30,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 06:57:30,139 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 42 [2024-11-16 06:57:30,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:30,140 INFO L225 Difference]: With dead ends: 116 [2024-11-16 06:57:30,140 INFO L226 Difference]: Without dead ends: 113 [2024-11-16 06:57:30,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-11-16 06:57:30,141 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:30,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 155 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:57:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-16 06:57:30,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-16 06:57:30,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-16 06:57:30,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 140 transitions. [2024-11-16 06:57:30,161 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 140 transitions. Word has length 42 [2024-11-16 06:57:30,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:30,161 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 140 transitions. [2024-11-16 06:57:30,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-16 06:57:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 140 transitions. [2024-11-16 06:57:30,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-16 06:57:30,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:30,162 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:30,174 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-16 06:57:30,363 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-16 06:57:30,363 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:30,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:30,364 INFO L85 PathProgramCache]: Analyzing trace with hash -854982936, now seen corresponding path program 2 times [2024-11-16 06:57:30,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:30,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451427389] [2024-11-16 06:57:30,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:30,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:30,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1121376470] [2024-11-16 06:57:30,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 06:57:30,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:30,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:30,397 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-16 06:57:30,399 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-16 06:57:30,435 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 06:57:30,435 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:57:30,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-16 06:57:30,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:30,548 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-16 06:57:30,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-16 06:57:30,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:30,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451427389] [2024-11-16 06:57:30,684 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 06:57:30,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121376470] [2024-11-16 06:57:30,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121376470] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:30,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:57:30,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2024-11-16 06:57:30,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006192830] [2024-11-16 06:57:30,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:30,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 06:57:30,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:30,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 06:57:30,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-16 06:57:30,686 INFO L87 Difference]: Start difference. First operand 113 states and 140 transitions. Second operand has 14 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-16 06:57:30,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:30,921 INFO L93 Difference]: Finished difference Result 129 states and 156 transitions. [2024-11-16 06:57:30,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 06:57:30,922 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 47 [2024-11-16 06:57:30,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:30,924 INFO L225 Difference]: With dead ends: 129 [2024-11-16 06:57:30,924 INFO L226 Difference]: Without dead ends: 123 [2024-11-16 06:57:30,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-16 06:57:30,924 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:30,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 187 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 06:57:30,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-16 06:57:30,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-16 06:57:30,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 72 states have internal predecessors, (76), 35 states have call successors, (35), 17 states have call predecessors, (35), 17 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 06:57:30,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2024-11-16 06:57:30,957 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 47 [2024-11-16 06:57:30,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:30,957 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2024-11-16 06:57:30,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-16 06:57:30,959 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2024-11-16 06:57:30,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-16 06:57:30,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:30,960 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:30,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-16 06:57:31,160 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-16 06:57:31,161 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:31,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:31,161 INFO L85 PathProgramCache]: Analyzing trace with hash -480361726, now seen corresponding path program 1 times [2024-11-16 06:57:31,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:31,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827342404] [2024-11-16 06:57:31,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:31,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:31,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1118532360] [2024-11-16 06:57:31,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:31,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:31,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:31,186 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-16 06:57:31,188 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-16 06:57:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:31,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-16 06:57:31,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 21 proven. 39 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-16 06:57:31,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-16 06:57:32,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:32,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827342404] [2024-11-16 06:57:32,010 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 06:57:32,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118532360] [2024-11-16 06:57:32,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118532360] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:32,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:57:32,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2024-11-16 06:57:32,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739510082] [2024-11-16 06:57:32,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:32,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 06:57:32,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:32,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 06:57:32,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-16 06:57:32,011 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2024-11-16 06:57:32,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:32,466 INFO L93 Difference]: Finished difference Result 139 states and 161 transitions. [2024-11-16 06:57:32,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 06:57:32,466 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 68 [2024-11-16 06:57:32,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:32,467 INFO L225 Difference]: With dead ends: 139 [2024-11-16 06:57:32,467 INFO L226 Difference]: Without dead ends: 134 [2024-11-16 06:57:32,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-16 06:57:32,470 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:32,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 175 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 06:57:32,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-16 06:57:32,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-16 06:57:32,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 77 states have (on average 1.077922077922078) internal successors, (83), 80 states have internal predecessors, (83), 37 states have call successors, (37), 20 states have call predecessors, (37), 19 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-16 06:57:32,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2024-11-16 06:57:32,494 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 68 [2024-11-16 06:57:32,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:32,494 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2024-11-16 06:57:32,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2024-11-16 06:57:32,494 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2024-11-16 06:57:32,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-16 06:57:32,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:32,495 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:32,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-16 06:57:32,699 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-16 06:57:32,700 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:32,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:32,700 INFO L85 PathProgramCache]: Analyzing trace with hash 917874229, now seen corresponding path program 1 times [2024-11-16 06:57:32,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:32,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690754026] [2024-11-16 06:57:32,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:32,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:32,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [294064175] [2024-11-16 06:57:32,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:32,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:32,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:32,722 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-16 06:57:32,722 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-16 06:57:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:32,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 06:57:32,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 23 proven. 42 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-16 06:57:33,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 23 proven. 42 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-16 06:57:33,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:33,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690754026] [2024-11-16 06:57:33,263 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 06:57:33,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294064175] [2024-11-16 06:57:33,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294064175] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:33,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:57:33,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-16 06:57:33,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627429767] [2024-11-16 06:57:33,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:33,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 06:57:33,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:33,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 06:57:33,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-16 06:57:33,266 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand has 15 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2024-11-16 06:57:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:34,583 INFO L93 Difference]: Finished difference Result 158 states and 189 transitions. [2024-11-16 06:57:34,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 06:57:34,583 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) Word has length 73 [2024-11-16 06:57:34,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:34,584 INFO L225 Difference]: With dead ends: 158 [2024-11-16 06:57:34,584 INFO L226 Difference]: Without dead ends: 146 [2024-11-16 06:57:34,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2024-11-16 06:57:34,585 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:34,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 226 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 06:57:34,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-16 06:57:34,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2024-11-16 06:57:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 79 states have (on average 1.0759493670886076) internal successors, (85), 83 states have internal predecessors, (85), 42 states have call successors, (42), 20 states have call predecessors, (42), 20 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 06:57:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 167 transitions. [2024-11-16 06:57:34,613 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 167 transitions. Word has length 73 [2024-11-16 06:57:34,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:34,614 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 167 transitions. [2024-11-16 06:57:34,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2024-11-16 06:57:34,614 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 167 transitions. [2024-11-16 06:57:34,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-16 06:57:34,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:34,615 INFO L215 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-16 06:57:34,627 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-16 06:57:34,818 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-16 06:57:34,819 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:34,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:34,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1964802407, now seen corresponding path program 3 times [2024-11-16 06:57:34,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:34,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729061708] [2024-11-16 06:57:34,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:34,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:34,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [116973408] [2024-11-16 06:57:34,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 06:57:34,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:34,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:34,845 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-16 06:57:34,847 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-16 06:57:34,908 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-16 06:57:34,909 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:57:34,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-16 06:57:34,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 55 proven. 27 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-16 06:57:35,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 55 proven. 27 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-16 06:57:36,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:36,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729061708] [2024-11-16 06:57:36,118 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 06:57:36,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116973408] [2024-11-16 06:57:36,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116973408] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:36,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:57:36,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-11-16 06:57:36,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663788838] [2024-11-16 06:57:36,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:36,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 06:57:36,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:36,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 06:57:36,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-16 06:57:36,120 INFO L87 Difference]: Start difference. First operand 142 states and 167 transitions. Second operand has 16 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2024-11-16 06:57:37,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:37,231 INFO L93 Difference]: Finished difference Result 149 states and 173 transitions. [2024-11-16 06:57:37,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 06:57:37,231 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) Word has length 80 [2024-11-16 06:57:37,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:37,232 INFO L225 Difference]: With dead ends: 149 [2024-11-16 06:57:37,232 INFO L226 Difference]: Without dead ends: 130 [2024-11-16 06:57:37,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-11-16 06:57:37,233 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:37,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 305 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 06:57:37,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-16 06:57:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-16 06:57:37,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 79 states have internal predecessors, (80), 34 states have call successors, (34), 19 states have call predecessors, (34), 19 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-16 06:57:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2024-11-16 06:57:37,277 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 80 [2024-11-16 06:57:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:37,277 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2024-11-16 06:57:37,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2024-11-16 06:57:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2024-11-16 06:57:37,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 06:57:37,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:37,282 INFO L215 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:37,288 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-16 06:57:37,482 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-16 06:57:37,483 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:37,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:37,483 INFO L85 PathProgramCache]: Analyzing trace with hash 233357206, now seen corresponding path program 2 times [2024-11-16 06:57:37,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:37,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024066526] [2024-11-16 06:57:37,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:37,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 06:57:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 06:57:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 06:57:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 06:57:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 06:57:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 06:57:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 06:57:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 06:57:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-16 06:57:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 06:57:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 06:57:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 06:57:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-16 06:57:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 06:57:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 06:57:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 06:57:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 06:57:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 06:57:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 06:57:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 06:57:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 06:57:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 06:57:37,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:37,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024066526] [2024-11-16 06:57:37,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024066526] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:57:37,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449310889] [2024-11-16 06:57:37,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 06:57:37,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:37,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:37,740 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-16 06:57:37,741 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-16 06:57:37,798 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 06:57:37,798 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:57:37,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 06:57:37,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:37,903 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-16 06:57:37,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 06:57:38,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449310889] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:38,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:57:38,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 16 [2024-11-16 06:57:38,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20685339] [2024-11-16 06:57:38,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:38,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 06:57:38,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:38,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 06:57:38,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2024-11-16 06:57:38,027 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 9 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (62), 9 states have call predecessors, (62), 9 states have call successors, (62) [2024-11-16 06:57:38,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:38,395 INFO L93 Difference]: Finished difference Result 370 states and 403 transitions. [2024-11-16 06:57:38,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-16 06:57:38,396 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 9 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (62), 9 states have call predecessors, (62), 9 states have call successors, (62) Word has length 126 [2024-11-16 06:57:38,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:38,397 INFO L225 Difference]: With dead ends: 370 [2024-11-16 06:57:38,398 INFO L226 Difference]: Without dead ends: 353 [2024-11-16 06:57:38,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2024-11-16 06:57:38,399 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 124 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:38,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 156 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 06:57:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-16 06:57:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 291. [2024-11-16 06:57:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 176 states have (on average 1.0568181818181819) internal successors, (186), 183 states have internal predecessors, (186), 68 states have call successors, (68), 47 states have call predecessors, (68), 46 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-16 06:57:38,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 319 transitions. [2024-11-16 06:57:38,464 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 319 transitions. Word has length 126 [2024-11-16 06:57:38,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:38,464 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 319 transitions. [2024-11-16 06:57:38,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 9 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (62), 9 states have call predecessors, (62), 9 states have call successors, (62) [2024-11-16 06:57:38,465 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 319 transitions. [2024-11-16 06:57:38,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 06:57:38,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:38,466 INFO L215 NwaCegarLoop]: trace histogram [24, 23, 23, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:38,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-16 06:57:38,669 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-16 06:57:38,670 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:38,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:38,670 INFO L85 PathProgramCache]: Analyzing trace with hash -65696330, now seen corresponding path program 1 times [2024-11-16 06:57:38,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:38,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683806854] [2024-11-16 06:57:38,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:38,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:38,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [692406938] [2024-11-16 06:57:38,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:38,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:38,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:38,696 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-16 06:57:38,697 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-16 06:57:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:38,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-16 06:57:38,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1106 backedges. 45 proven. 115 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-16 06:57:38,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:42,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1106 backedges. 45 proven. 115 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-16 06:57:42,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:42,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683806854] [2024-11-16 06:57:42,395 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 06:57:42,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692406938] [2024-11-16 06:57:42,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692406938] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:42,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:57:42,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-11-16 06:57:42,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491222973] [2024-11-16 06:57:42,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:42,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-16 06:57:42,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:42,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-16 06:57:42,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-16 06:57:42,396 INFO L87 Difference]: Start difference. First operand 291 states and 319 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 9 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 8 states have call predecessors, (46), 9 states have call successors, (46) [2024-11-16 06:57:48,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-16 06:57:48,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:48,736 INFO L93 Difference]: Finished difference Result 330 states and 350 transitions. [2024-11-16 06:57:48,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 06:57:48,736 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 9 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 8 states have call predecessors, (46), 9 states have call successors, (46) Word has length 134 [2024-11-16 06:57:48,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:48,738 INFO L225 Difference]: With dead ends: 330 [2024-11-16 06:57:48,738 INFO L226 Difference]: Without dead ends: 301 [2024-11-16 06:57:48,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=76, Invalid=265, Unknown=1, NotChecked=0, Total=342 [2024-11-16 06:57:48,738 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:48,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 329 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-16 06:57:48,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-16 06:57:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2024-11-16 06:57:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 188 states have (on average 1.0425531914893618) internal successors, (196), 194 states have internal predecessors, (196), 62 states have call successors, (62), 51 states have call predecessors, (62), 50 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 06:57:48,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 318 transitions. [2024-11-16 06:57:48,809 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 318 transitions. Word has length 134 [2024-11-16 06:57:48,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:48,809 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 318 transitions. [2024-11-16 06:57:48,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 9 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 8 states have call predecessors, (46), 9 states have call successors, (46) [2024-11-16 06:57:48,809 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 318 transitions. [2024-11-16 06:57:48,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-16 06:57:48,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:48,810 INFO L215 NwaCegarLoop]: trace histogram [28, 27, 27, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:48,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-16 06:57:49,014 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-16 06:57:49,014 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:49,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:49,015 INFO L85 PathProgramCache]: Analyzing trace with hash -962383017, now seen corresponding path program 2 times [2024-11-16 06:57:49,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:49,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543911304] [2024-11-16 06:57:49,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:49,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:49,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [367390690] [2024-11-16 06:57:49,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 06:57:49,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:49,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:49,052 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:57:49,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-16 06:57:49,122 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 06:57:49,122 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:57:49,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-16 06:57:49,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 113 proven. 99 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-16 06:57:49,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 113 proven. 51 refuted. 0 times theorem prover too weak. 1374 trivial. 0 not checked. [2024-11-16 06:57:56,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:56,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543911304] [2024-11-16 06:57:56,350 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 06:57:56,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367390690] [2024-11-16 06:57:56,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367390690] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:56,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:57:56,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-16 06:57:56,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465974800] [2024-11-16 06:57:56,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:56,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-16 06:57:56,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:56,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-16 06:57:56,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-11-16 06:57:56,352 INFO L87 Difference]: Start difference. First operand 301 states and 318 transitions. Second operand has 18 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 10 states have call successors, (41), 3 states have call predecessors, (41), 2 states have return successors, (39), 9 states have call predecessors, (39), 10 states have call successors, (39) [2024-11-16 06:57:56,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:56,879 INFO L93 Difference]: Finished difference Result 315 states and 331 transitions. [2024-11-16 06:57:56,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 06:57:56,880 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 10 states have call successors, (41), 3 states have call predecessors, (41), 2 states have return successors, (39), 9 states have call predecessors, (39), 10 states have call successors, (39) Word has length 157 [2024-11-16 06:57:56,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:56,881 INFO L225 Difference]: With dead ends: 315 [2024-11-16 06:57:56,881 INFO L226 Difference]: Without dead ends: 282 [2024-11-16 06:57:56,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 293 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2024-11-16 06:57:56,882 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 16 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:56,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 309 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 06:57:56,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-16 06:57:56,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-16 06:57:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 180 states have (on average 1.011111111111111) internal successors, (182), 181 states have internal predecessors, (182), 53 states have call successors, (53), 48 states have call predecessors, (53), 48 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-16 06:57:56,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 287 transitions. [2024-11-16 06:57:56,954 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 287 transitions. Word has length 157 [2024-11-16 06:57:56,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:56,955 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 287 transitions. [2024-11-16 06:57:56,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 10 states have call successors, (41), 3 states have call predecessors, (41), 2 states have return successors, (39), 9 states have call predecessors, (39), 10 states have call successors, (39) [2024-11-16 06:57:56,955 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 287 transitions. [2024-11-16 06:57:56,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2024-11-16 06:57:56,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:56,957 INFO L215 NwaCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:56,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-16 06:57:57,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-16 06:57:57,160 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:57,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:57,161 INFO L85 PathProgramCache]: Analyzing trace with hash -636330798, now seen corresponding path program 3 times [2024-11-16 06:57:57,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:57,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453344504] [2024-11-16 06:57:57,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:57,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 06:57:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 06:57:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 06:57:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 06:57:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 06:57:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 06:57:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 06:57:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 06:57:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-16 06:57:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 06:57:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 06:57:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 06:57:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-16 06:57:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 06:57:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 06:57:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 06:57:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 06:57:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 06:57:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 06:57:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 06:57:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 06:57:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 06:57:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 06:57:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-16 06:57:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-16 06:57:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 06:57:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 06:57:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 06:57:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-16 06:57:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-16 06:57:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-16 06:57:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-16 06:57:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-16 06:57:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-16 06:57:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-16 06:57:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-16 06:57:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-16 06:57:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-16 06:57:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-16 06:57:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-16 06:57:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-11-16 06:57:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-16 06:57:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-16 06:57:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-16 06:57:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-16 06:57:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-16 06:57:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-16 06:57:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-16 06:57:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-16 06:57:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-16 06:57:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-11-16 06:57:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2024-11-16 06:57:57,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:57,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453344504] [2024-11-16 06:57:57,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453344504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:57:57,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758094049] [2024-11-16 06:57:57,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 06:57:57,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:57,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:57,736 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:57:57,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-16 06:57:57,909 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2024-11-16 06:57:57,909 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:57:57,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-16 06:57:57,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:58,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 300 proven. 4880 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2024-11-16 06:57:58,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2024-11-16 06:57:58,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758094049] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:58,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:57:58,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 26 [2024-11-16 06:57:58,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360290123] [2024-11-16 06:57:58,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:58,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-16 06:57:58,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:58,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-16 06:57:58,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2024-11-16 06:57:58,424 INFO L87 Difference]: Start difference. First operand 282 states and 287 transitions. Second operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 20 states have call successors, (148), 12 states have call predecessors, (148), 12 states have return successors, (147), 20 states have call predecessors, (147), 20 states have call successors, (147) [2024-11-16 06:57:59,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:59,035 INFO L93 Difference]: Finished difference Result 576 states and 591 transitions. [2024-11-16 06:57:59,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-16 06:57:59,036 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 20 states have call successors, (148), 12 states have call predecessors, (148), 12 states have return successors, (147), 20 states have call predecessors, (147), 20 states have call successors, (147) Word has length 294 [2024-11-16 06:57:59,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:59,038 INFO L225 Difference]: With dead ends: 576 [2024-11-16 06:57:59,038 INFO L226 Difference]: Without dead ends: 562 [2024-11-16 06:57:59,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 676 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=687, Invalid=1205, Unknown=0, NotChecked=0, Total=1892 [2024-11-16 06:57:59,039 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 102 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:59,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 205 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 06:57:59,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-16 06:57:59,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2024-11-16 06:57:59,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 360 states have (on average 1.0055555555555555) internal successors, (362), 361 states have internal predecessors, (362), 103 states have call successors, (103), 98 states have call predecessors, (103), 98 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-16 06:57:59,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 567 transitions. [2024-11-16 06:57:59,174 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 567 transitions. Word has length 294 [2024-11-16 06:57:59,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:59,174 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 567 transitions. [2024-11-16 06:57:59,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 20 states have call successors, (148), 12 states have call predecessors, (148), 12 states have return successors, (147), 20 states have call predecessors, (147), 20 states have call successors, (147) [2024-11-16 06:57:59,175 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 567 transitions. [2024-11-16 06:57:59,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2024-11-16 06:57:59,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:59,183 INFO L215 NwaCegarLoop]: trace histogram [102, 101, 101, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:59,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-16 06:57:59,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-16 06:57:59,384 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:59,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:59,384 INFO L85 PathProgramCache]: Analyzing trace with hash -178141130, now seen corresponding path program 4 times [2024-11-16 06:57:59,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:59,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240357406] [2024-11-16 06:57:59,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:59,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:59,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [233441445] [2024-11-16 06:57:59,546 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-16 06:57:59,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:59,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:59,548 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:57:59,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-16 06:57:59,754 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-16 06:57:59,755 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-16 06:57:59,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 06:57:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 06:57:59,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 06:57:59,962 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 06:57:59,964 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 06:57:59,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-16 06:58:00,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:58:00,168 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:58:00,264 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 06:58:00,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:58:00 BoogieIcfgContainer [2024-11-16 06:58:00,267 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 06:58:00,267 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 06:58:00,267 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 06:58:00,268 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 06:58:00,268 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:57:26" (3/4) ... [2024-11-16 06:58:00,268 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 06:58:00,384 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 06:58:00,384 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 06:58:00,384 INFO L158 Benchmark]: Toolchain (without parser) took 33912.34ms. Allocated memory was 138.4MB in the beginning and 232.8MB in the end (delta: 94.4MB). Free memory was 68.4MB in the beginning and 82.7MB in the end (delta: -14.4MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. [2024-11-16 06:58:00,384 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 138.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 06:58:00,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.39ms. Allocated memory was 138.4MB in the beginning and 192.9MB in the end (delta: 54.5MB). Free memory was 68.1MB in the beginning and 161.3MB in the end (delta: -93.2MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2024-11-16 06:58:00,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.58ms. Allocated memory is still 192.9MB. Free memory was 161.3MB in the beginning and 159.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 06:58:00,385 INFO L158 Benchmark]: Boogie Preprocessor took 21.86ms. Allocated memory is still 192.9MB. Free memory was 159.2MB in the beginning and 158.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 06:58:00,385 INFO L158 Benchmark]: IcfgBuilder took 234.91ms. Allocated memory is still 192.9MB. Free memory was 158.1MB in the beginning and 144.5MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 06:58:00,385 INFO L158 Benchmark]: TraceAbstraction took 33279.87ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 143.5MB in the beginning and 98.5MB in the end (delta: 45.0MB). Peak memory consumption was 84.8MB. Max. memory is 16.1GB. [2024-11-16 06:58:00,386 INFO L158 Benchmark]: Witness Printer took 116.65ms. Allocated memory is still 232.8MB. Free memory was 98.5MB in the beginning and 82.7MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 06:58:00,386 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.16ms. Allocated memory is still 138.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.39ms. Allocated memory was 138.4MB in the beginning and 192.9MB in the end (delta: 54.5MB). Free memory was 68.1MB in the beginning and 161.3MB in the end (delta: -93.2MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.58ms. Allocated memory is still 192.9MB. Free memory was 161.3MB in the beginning and 159.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.86ms. Allocated memory is still 192.9MB. Free memory was 159.2MB in the beginning and 158.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 234.91ms. Allocated memory is still 192.9MB. Free memory was 158.1MB in the beginning and 144.5MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 33279.87ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 143.5MB in the beginning and 98.5MB in the end (delta: 45.0MB). Peak memory consumption was 84.8MB. Max. memory is 16.1GB. * Witness Printer took 116.65ms. Allocated memory is still 232.8MB. Free memory was 98.5MB in the beginning and 82.7MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [a=20, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=11, n=11, x=1331, y=397, z=72] [L33] EXPR counter++ VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=12, n=12, x=1728, y=469, z=78] [L33] EXPR counter++ VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=13, n=13, x=2197, y=547, z=84] [L33] EXPR counter++ VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=14, n=14, x=2744, y=631, z=90] [L33] EXPR counter++ VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=15, n=15, x=3375, y=721, z=96] [L33] EXPR counter++ VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=16, n=16, x=4096, y=817, z=102] [L33] EXPR counter++ VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=17, n=17, x=4913, y=919, z=108] [L33] EXPR counter++ VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=18, n=18, x=5832, y=1027, z=114] [L33] EXPR counter++ VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=19, n=19, x=6859, y=1141, z=120] [L33] EXPR counter++ VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=20, n=20, x=8000, y=1261, z=126] [L33] EXPR counter++ VAL [a=20, counter=21, n=20, x=8000, y=1261, z=126] [L33] COND FALSE !(counter++<20) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [a=20, counter=21, n=20, x=8000, y=1261, z=126] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, counter=21] [L15] COND TRUE !(cond) VAL [\old(cond)=0, counter=21] [L17] reach_error() VAL [\old(cond)=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.1s, OverallIterations: 17, TraceHistogramMax: 102, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 437 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 384 mSDsluCounter, 2809 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2293 mSDsCounter, 480 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2408 IncrementalHoareTripleChecker+Invalid, 2888 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 480 mSolverCounterUnsat, 516 mSDtfsCounter, 2408 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2416 GetRequests, 2196 SyntacticMatches, 5 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=562occurred in iteration=16, InterpolantAutomatonStates: 185, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 87 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 3414 NumberOfCodeBlocks, 3329 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 2642 ConstructedInterpolants, 0 QuantifiedInterpolants, 10131 SizeOfPredicates, 33 NumberOfNonLiveVariables, 2514 ConjunctsInSsa, 287 ConjunctsInUnsatCore, 29 InterpolantComputations, 6 PerfectInterpolantSequences, 20202/27264 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-16 06:58:00,415 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