./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound10.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 8d4ed8c57ce722a6c7368f844e0bd557207245c570ed48ded2021df85adb4676 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:28:20,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:28:20,816 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:28:20,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:28:20,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:28:20,839 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:28:20,840 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:28:20,840 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:28:20,841 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:28:20,841 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:28:20,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:28:20,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:28:20,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:28:20,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:28:20,843 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:28:20,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:28:20,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:28:20,844 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:28:20,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:28:20,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:28:20,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:28:20,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:28:20,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:28:20,846 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:28:20,847 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:28:20,847 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:28:20,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:28:20,848 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:28:20,848 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:28:20,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:28:20,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:28:20,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:28:20,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:28:20,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:28:20,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:28:20,857 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:28:20,857 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:28:20,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:28:20,857 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:28:20,857 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:28:20,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:28:20,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:28:20,858 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 -> 8d4ed8c57ce722a6c7368f844e0bd557207245c570ed48ded2021df85adb4676 [2024-11-09 22:28:21,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:28:21,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:28:21,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:28:21,139 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:28:21,139 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:28:21,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound10.c [2024-11-09 22:28:22,475 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:28:22,688 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:28:22,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound10.c [2024-11-09 22:28:22,695 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f350b05/089756617bec4f409a770d6e7f7c7afe/FLAG1f7800010 [2024-11-09 22:28:23,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f350b05/089756617bec4f409a770d6e7f7c7afe [2024-11-09 22:28:23,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:28:23,070 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:28:23,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:28:23,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:28:23,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:28:23,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:28:23" (1/1) ... [2024-11-09 22:28:23,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15258351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:23, skipping insertion in model container [2024-11-09 22:28:23,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:28:23" (1/1) ... [2024-11-09 22:28:23,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:28:23,262 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_unwindbound10.c[588,601] [2024-11-09 22:28:23,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:28:23,300 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:28:23,311 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_unwindbound10.c[588,601] [2024-11-09 22:28:23,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:28:23,340 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:28:23,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:23 WrapperNode [2024-11-09 22:28:23,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:28:23,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:28:23,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:28:23,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:28:23,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:23" (1/1) ... [2024-11-09 22:28:23,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:23" (1/1) ... [2024-11-09 22:28:23,368 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2024-11-09 22:28:23,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:28:23,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:28:23,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:28:23,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:28:23,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:23" (1/1) ... [2024-11-09 22:28:23,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:23" (1/1) ... [2024-11-09 22:28:23,379 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:23" (1/1) ... [2024-11-09 22:28:23,393 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 22:28:23,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:23" (1/1) ... [2024-11-09 22:28:23,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:23" (1/1) ... [2024-11-09 22:28:23,396 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:23" (1/1) ... [2024-11-09 22:28:23,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:23" (1/1) ... [2024-11-09 22:28:23,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:23" (1/1) ... [2024-11-09 22:28:23,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:23" (1/1) ... [2024-11-09 22:28:23,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:28:23,401 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:28:23,401 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:28:23,401 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:28:23,402 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:23" (1/1) ... [2024-11-09 22:28:23,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:28:23,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:28:23,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 22:28:23,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 22:28:23,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:28:23,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:28:23,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:28:23,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:28:23,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 22:28:23,492 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 22:28:23,554 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:28:23,559 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:28:23,741 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-11-09 22:28:23,741 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:28:23,755 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:28:23,755 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:28:23,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:28:23 BoogieIcfgContainer [2024-11-09 22:28:23,756 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:28:23,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:28:23,759 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:28:23,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:28:23,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:28:23" (1/3) ... [2024-11-09 22:28:23,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c0e21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:28:23, skipping insertion in model container [2024-11-09 22:28:23,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:23" (2/3) ... [2024-11-09 22:28:23,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c0e21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:28:23, skipping insertion in model container [2024-11-09 22:28:23,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:28:23" (3/3) ... [2024-11-09 22:28:23,767 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound10.c [2024-11-09 22:28:23,785 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:28:23,786 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:28:23,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:28:23,858 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;@3ed5c765, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:28:23,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:28:23,863 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-09 22:28:23,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 22:28:23,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:28:23,871 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:28:23,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:28:23,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:28:23,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1686356366, now seen corresponding path program 1 times [2024-11-09 22:28:23,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:28:23,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689430597] [2024-11-09 22:28:23,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:23,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:28:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:24,040 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-09 22:28:24,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:28:24,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689430597] [2024-11-09 22:28:24,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689430597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:28:24,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:28:24,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 22:28:24,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725041278] [2024-11-09 22:28:24,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:28:24,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 22:28:24,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:28:24,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 22:28:24,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:28:24,074 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-09 22:28:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:28:24,098 INFO L93 Difference]: Finished difference Result 52 states and 89 transitions. [2024-11-09 22:28:24,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 22:28:24,100 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-09 22:28:24,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:28:24,109 INFO L225 Difference]: With dead ends: 52 [2024-11-09 22:28:24,109 INFO L226 Difference]: Without dead ends: 23 [2024-11-09 22:28:24,113 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-09 22:28:24,119 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-09 22:28:24,120 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-09 22:28:24,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-09 22:28:24,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-09 22:28:24,156 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-09 22:28:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2024-11-09 22:28:24,161 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 8 [2024-11-09 22:28:24,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:28:24,162 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2024-11-09 22:28:24,162 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-09 22:28:24,163 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2024-11-09 22:28:24,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 22:28:24,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:28:24,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:28:24,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:28:24,165 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:28:24,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:28:24,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1994067049, now seen corresponding path program 1 times [2024-11-09 22:28:24,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:28:24,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842055391] [2024-11-09 22:28:24,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:24,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:28:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:24,304 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-09 22:28:24,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:28:24,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842055391] [2024-11-09 22:28:24,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842055391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:28:24,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:28:24,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:28:24,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214932060] [2024-11-09 22:28:24,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:28:24,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:28:24,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:28:24,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:28:24,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:28:24,308 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-09 22:28:24,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:28:24,330 INFO L93 Difference]: Finished difference Result 38 states and 54 transitions. [2024-11-09 22:28:24,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:28:24,333 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-09 22:28:24,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:28:24,334 INFO L225 Difference]: With dead ends: 38 [2024-11-09 22:28:24,334 INFO L226 Difference]: Without dead ends: 25 [2024-11-09 22:28:24,334 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-09 22:28:24,336 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-09 22:28:24,337 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-09 22:28:24,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-09 22:28:24,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-09 22:28:24,346 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-09 22:28:24,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2024-11-09 22:28:24,348 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 9 [2024-11-09 22:28:24,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:28:24,348 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-11-09 22:28:24,350 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-09 22:28:24,350 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2024-11-09 22:28:24,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 22:28:24,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:28:24,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:28:24,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:28:24,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:28:24,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:28:24,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2031931410, now seen corresponding path program 1 times [2024-11-09 22:28:24,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:28:24,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508050799] [2024-11-09 22:28:24,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:24,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:28:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:24,561 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-09 22:28:24,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:28:24,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508050799] [2024-11-09 22:28:24,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508050799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:28:24,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:28:24,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:28:24,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223039709] [2024-11-09 22:28:24,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:28:24,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:28:24,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:28:24,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:28:24,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:28:24,563 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-09 22:28:24,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:28:24,691 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2024-11-09 22:28:24,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:28:24,691 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-09 22:28:24,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:28:24,692 INFO L225 Difference]: With dead ends: 32 [2024-11-09 22:28:24,693 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 22:28:24,694 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-09 22:28:24,695 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-09 22:28:24,696 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-09 22:28:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 22:28:24,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 22:28:24,712 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-09 22:28:24,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2024-11-09 22:28:24,713 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 9 [2024-11-09 22:28:24,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:28:24,714 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2024-11-09 22:28:24,714 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-09 22:28:24,714 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-11-09 22:28:24,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 22:28:24,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:28:24,715 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:28:24,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 22:28:24,715 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:28:24,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:28:24,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1400374437, now seen corresponding path program 1 times [2024-11-09 22:28:24,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:28:24,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80394893] [2024-11-09 22:28:24,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:24,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:28:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:28:24,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1457352048] [2024-11-09 22:28:24,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:24,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:24,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:28:24,768 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:28:24,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 22:28:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:24,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 22:28:24,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:28:24,920 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-09 22:28:24,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:28:24,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:28:24,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80394893] [2024-11-09 22:28:24,922 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:28:24,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457352048] [2024-11-09 22:28:24,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457352048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:28:24,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:28:24,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:28:24,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7349452] [2024-11-09 22:28:24,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:28:24,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:28:24,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:28:24,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:28:24,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:28:24,925 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-09 22:28:25,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:28:25,038 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2024-11-09 22:28:25,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:28:25,038 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-09 22:28:25,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:28:25,040 INFO L225 Difference]: With dead ends: 48 [2024-11-09 22:28:25,040 INFO L226 Difference]: Without dead ends: 45 [2024-11-09 22:28:25,040 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-09 22:28:25,041 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:28:25,042 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.1s Time] [2024-11-09 22:28:25,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-09 22:28:25,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2024-11-09 22:28:25,059 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-09 22:28:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-11-09 22:28:25,060 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 14 [2024-11-09 22:28:25,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:28:25,062 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-11-09 22:28:25,063 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-09 22:28:25,063 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-11-09 22:28:25,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 22:28:25,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:28:25,063 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:28:25,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 22:28:25,264 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-09 22:28:25,264 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:28:25,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:28:25,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1833948082, now seen corresponding path program 1 times [2024-11-09 22:28:25,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:28:25,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490501594] [2024-11-09 22:28:25,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:25,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:28:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:28:25,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [144026351] [2024-11-09 22:28:25,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:25,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:25,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:28:25,291 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:28:25,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 22:28:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:25,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 22:28:25,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:28:25,398 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-09 22:28:25,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:28:25,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:28:25,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490501594] [2024-11-09 22:28:25,402 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:28:25,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144026351] [2024-11-09 22:28:25,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144026351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:28:25,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:28:25,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:28:25,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661204082] [2024-11-09 22:28:25,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:28:25,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:28:25,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:28:25,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:28:25,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:28:25,405 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-09 22:28:25,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:28:25,498 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2024-11-09 22:28:25,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:28:25,499 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-09 22:28:25,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:28:25,500 INFO L225 Difference]: With dead ends: 52 [2024-11-09 22:28:25,500 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 22:28:25,500 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-09 22:28:25,501 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:28:25,501 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.1s Time] [2024-11-09 22:28:25,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 22:28:25,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2024-11-09 22:28:25,514 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-09 22:28:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2024-11-09 22:28:25,515 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 19 [2024-11-09 22:28:25,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:28:25,516 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2024-11-09 22:28:25,516 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-09 22:28:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2024-11-09 22:28:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 22:28:25,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:28:25,517 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:28:25,535 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-09 22:28:25,721 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-09 22:28:25,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:28:25,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:28:25,722 INFO L85 PathProgramCache]: Analyzing trace with hash 799704197, now seen corresponding path program 1 times [2024-11-09 22:28:25,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:28:25,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805198783] [2024-11-09 22:28:25,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:25,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:28:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:28:25,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [688079065] [2024-11-09 22:28:25,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:25,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:25,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:28:25,747 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:28:25,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 22:28:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:25,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 22:28:25,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:28:25,906 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-09 22:28:25,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:28:25,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:28:25,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805198783] [2024-11-09 22:28:25,907 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:28:25,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688079065] [2024-11-09 22:28:25,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688079065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:28:25,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:28:25,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:28:25,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902030583] [2024-11-09 22:28:25,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:28:25,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:28:25,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:28:25,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:28:25,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:28:25,909 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-09 22:28:26,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:28:26,002 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2024-11-09 22:28:26,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:28:26,003 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-09 22:28:26,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:28:26,004 INFO L225 Difference]: With dead ends: 60 [2024-11-09 22:28:26,004 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 22:28:26,004 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-09 22:28:26,007 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 4 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:28:26,008 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.1s Time] [2024-11-09 22:28:26,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 22:28:26,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-09 22:28:26,027 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-09 22:28:26,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2024-11-09 22:28:26,027 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 24 [2024-11-09 22:28:26,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:28:26,028 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2024-11-09 22:28:26,028 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-09 22:28:26,028 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2024-11-09 22:28:26,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 22:28:26,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:28:26,031 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-09 22:28:26,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 22:28:26,235 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-09 22:28:26,236 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:28:26,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:28:26,236 INFO L85 PathProgramCache]: Analyzing trace with hash 594587768, now seen corresponding path program 1 times [2024-11-09 22:28:26,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:28:26,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030327358] [2024-11-09 22:28:26,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:26,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:28:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:26,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 22:28:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:26,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 22:28:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:26,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 22:28:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:26,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 22:28:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:26,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:28:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:26,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:28:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:26,413 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-09 22:28:26,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:28:26,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030327358] [2024-11-09 22:28:26,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030327358] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:28:26,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854018176] [2024-11-09 22:28:26,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:26,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:26,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:28:26,415 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:28:26,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 22:28:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:26,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 22:28:26,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:28:26,551 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-09 22:28:26,552 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:28:26,638 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-09 22:28:26,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854018176] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:28:26,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:28:26,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-11-09 22:28:26,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376042922] [2024-11-09 22:28:26,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:28:26,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 22:28:26,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:28:26,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 22:28:26,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 22:28:26,641 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-09 22:28:26,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:28:26,866 INFO L93 Difference]: Finished difference Result 120 states and 155 transitions. [2024-11-09 22:28:26,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 22:28:26,866 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-09 22:28:26,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:28:26,869 INFO L225 Difference]: With dead ends: 120 [2024-11-09 22:28:26,870 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 22:28:26,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:28:26,871 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:28:26,871 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.2s Time] [2024-11-09 22:28:26,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 22:28:26,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2024-11-09 22:28:26,891 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-09 22:28:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2024-11-09 22:28:26,894 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 128 transitions. Word has length 42 [2024-11-09 22:28:26,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:28:26,895 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 128 transitions. [2024-11-09 22:28:26,895 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-09 22:28:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 128 transitions. [2024-11-09 22:28:26,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 22:28:26,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:28:26,897 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-09 22:28:26,913 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-09 22:28:27,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:27,098 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:28:27,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:28:27,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1422995375, now seen corresponding path program 1 times [2024-11-09 22:28:27,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:28:27,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816363038] [2024-11-09 22:28:27,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:27,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:28:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:28:27,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1597806960] [2024-11-09 22:28:27,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:27,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:27,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:28:27,135 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:28:27,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 22:28:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:27,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 22:28:27,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:28:27,331 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-09 22:28:27,332 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:28:27,508 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-09 22:28:27,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:28:27,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816363038] [2024-11-09 22:28:27,509 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:28:27,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597806960] [2024-11-09 22:28:27,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597806960] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:28:27,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:28:27,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-09 22:28:27,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501983735] [2024-11-09 22:28:27,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:28:27,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 22:28:27,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:28:27,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 22:28:27,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-09 22:28:27,512 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-09 22:28:27,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:28:27,772 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions. [2024-11-09 22:28:27,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 22:28:27,773 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-09 22:28:27,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:28:27,774 INFO L225 Difference]: With dead ends: 116 [2024-11-09 22:28:27,774 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 22:28:27,775 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-09 22:28:27,775 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:28:27,775 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.2s Time] [2024-11-09 22:28:27,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 22:28:27,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-09 22:28:27,806 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-09 22:28:27,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 140 transitions. [2024-11-09 22:28:27,808 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 140 transitions. Word has length 42 [2024-11-09 22:28:27,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:28:27,808 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 140 transitions. [2024-11-09 22:28:27,809 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-09 22:28:27,809 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 140 transitions. [2024-11-09 22:28:27,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 22:28:27,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:28:27,810 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-09 22:28:27,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 22:28:28,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:28,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:28:28,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:28:28,015 INFO L85 PathProgramCache]: Analyzing trace with hash -854982936, now seen corresponding path program 2 times [2024-11-09 22:28:28,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:28:28,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333661650] [2024-11-09 22:28:28,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:28,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:28:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:28:28,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1813865884] [2024-11-09 22:28:28,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:28:28,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:28,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:28:28,053 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:28:28,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 22:28:28,106 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:28:28,106 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:28:28,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 22:28:28,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:28:28,272 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-09 22:28:28,273 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:28:28,451 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-09 22:28:28,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:28:28,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333661650] [2024-11-09 22:28:28,452 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:28:28,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813865884] [2024-11-09 22:28:28,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813865884] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:28:28,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:28:28,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2024-11-09 22:28:28,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953532004] [2024-11-09 22:28:28,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:28:28,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 22:28:28,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:28:28,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 22:28:28,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-09 22:28:28,455 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-09 22:28:28,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:28:28,758 INFO L93 Difference]: Finished difference Result 129 states and 156 transitions. [2024-11-09 22:28:28,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 22:28:28,759 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-09 22:28:28,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:28:28,762 INFO L225 Difference]: With dead ends: 129 [2024-11-09 22:28:28,762 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 22:28:28,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-09 22:28:28,763 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-09 22:28:28,766 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-09 22:28:28,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 22:28:28,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-09 22:28:28,825 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-09 22:28:28,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2024-11-09 22:28:28,830 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 47 [2024-11-09 22:28:28,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:28:28,831 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2024-11-09 22:28:28,831 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-09 22:28:28,831 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2024-11-09 22:28:28,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 22:28:28,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:28:28,833 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-09 22:28:28,852 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-09 22:28:29,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:29,040 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:28:29,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:28:29,040 INFO L85 PathProgramCache]: Analyzing trace with hash -480361726, now seen corresponding path program 1 times [2024-11-09 22:28:29,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:28:29,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651504392] [2024-11-09 22:28:29,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:29,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:28:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:28:29,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [612140920] [2024-11-09 22:28:29,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:29,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:29,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:28:29,079 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:28:29,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 22:28:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:29,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 22:28:29,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:28:29,541 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-09 22:28:29,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:28:30,099 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-09 22:28:30,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:28:30,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651504392] [2024-11-09 22:28:30,100 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:28:30,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612140920] [2024-11-09 22:28:30,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612140920] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:28:30,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:28:30,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2024-11-09 22:28:30,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776914542] [2024-11-09 22:28:30,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:28:30,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 22:28:30,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:28:30,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 22:28:30,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-09 22:28:30,103 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-09 22:28:30,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:28:30,536 INFO L93 Difference]: Finished difference Result 139 states and 161 transitions. [2024-11-09 22:28:30,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 22:28:30,537 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-09 22:28:30,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:28:30,539 INFO L225 Difference]: With dead ends: 139 [2024-11-09 22:28:30,539 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 22:28:30,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-09 22:28:30,545 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-09 22:28:30,545 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-09 22:28:30,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 22:28:30,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-09 22:28:30,589 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-09 22:28:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2024-11-09 22:28:30,591 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 68 [2024-11-09 22:28:30,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:28:30,592 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2024-11-09 22:28:30,593 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-09 22:28:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2024-11-09 22:28:30,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 22:28:30,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:28:30,595 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-09 22:28:30,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 22:28:30,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:30,797 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:28:30,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:28:30,798 INFO L85 PathProgramCache]: Analyzing trace with hash 917874229, now seen corresponding path program 1 times [2024-11-09 22:28:30,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:28:30,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992763517] [2024-11-09 22:28:30,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:30,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:28:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:28:30,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [711704673] [2024-11-09 22:28:30,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:30,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:30,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:28:30,824 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:28:30,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 22:28:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:30,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 22:28:30,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:28:31,200 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-09 22:28:31,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:28:31,743 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-09 22:28:31,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:28:31,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992763517] [2024-11-09 22:28:31,744 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:28:31,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711704673] [2024-11-09 22:28:31,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711704673] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:28:31,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:28:31,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-09 22:28:31,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483000281] [2024-11-09 22:28:31,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:28:31,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 22:28:31,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:28:31,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 22:28:31,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-09 22:28:31,748 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-09 22:28:32,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:28:32,815 INFO L93 Difference]: Finished difference Result 158 states and 189 transitions. [2024-11-09 22:28:32,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 22:28:32,815 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-09 22:28:32,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:28:32,819 INFO L225 Difference]: With dead ends: 158 [2024-11-09 22:28:32,819 INFO L226 Difference]: Without dead ends: 146 [2024-11-09 22:28:32,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2024-11-09 22:28:32,820 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 22:28:32,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 226 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 22:28:32,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-09 22:28:32,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2024-11-09 22:28:32,866 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-09 22:28:32,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 167 transitions. [2024-11-09 22:28:32,868 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 167 transitions. Word has length 73 [2024-11-09 22:28:32,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:28:32,868 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 167 transitions. [2024-11-09 22:28:32,868 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-09 22:28:32,869 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 167 transitions. [2024-11-09 22:28:32,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 22:28:32,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:28:32,871 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-09 22:28:32,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 22:28:33,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 22:28:33,072 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:28:33,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:28:33,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1964802407, now seen corresponding path program 3 times [2024-11-09 22:28:33,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:28:33,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546626727] [2024-11-09 22:28:33,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:33,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:28:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:28:33,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507516220] [2024-11-09 22:28:33,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 22:28:33,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:33,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:28:33,096 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:28:33,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 22:28:33,184 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 22:28:33,184 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:28:33,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 22:28:33,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:28:33,426 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-09 22:28:33,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:28:34,132 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-09 22:28:34,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:28:34,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546626727] [2024-11-09 22:28:34,133 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:28:34,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507516220] [2024-11-09 22:28:34,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507516220] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:28:34,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:28:34,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-11-09 22:28:34,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518457629] [2024-11-09 22:28:34,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:28:34,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 22:28:34,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:28:34,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 22:28:34,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-09 22:28:34,136 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-09 22:28:35,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:28:35,090 INFO L93 Difference]: Finished difference Result 149 states and 173 transitions. [2024-11-09 22:28:35,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 22:28:35,091 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-09 22:28:35,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:28:35,092 INFO L225 Difference]: With dead ends: 149 [2024-11-09 22:28:35,092 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 22:28:35,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-11-09 22:28:35,093 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.7s IncrementalHoareTripleChecker+Time [2024-11-09 22:28:35,094 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.7s Time] [2024-11-09 22:28:35,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 22:28:35,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-09 22:28:35,131 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-09 22:28:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2024-11-09 22:28:35,133 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 80 [2024-11-09 22:28:35,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:28:35,145 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2024-11-09 22:28:35,145 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-09 22:28:35,145 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2024-11-09 22:28:35,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 22:28:35,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:28:35,147 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-09 22:28:35,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 22:28:35,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:35,347 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:28:35,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:28:35,348 INFO L85 PathProgramCache]: Analyzing trace with hash 233357206, now seen corresponding path program 2 times [2024-11-09 22:28:35,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:28:35,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666675703] [2024-11-09 22:28:35,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:35,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:28:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 22:28:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 22:28:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 22:28:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 22:28:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:28:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:28:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 22:28:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 22:28:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 22:28:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 22:28:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 22:28:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 22:28:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 22:28:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 22:28:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 22:28:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 22:28:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 22:28:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 22:28:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 22:28:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-09 22:28:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 22:28:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:35,712 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-09 22:28:35,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:28:35,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666675703] [2024-11-09 22:28:35,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666675703] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:28:35,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639845705] [2024-11-09 22:28:35,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:28:35,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:35,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:28:35,715 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:28:35,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 22:28:35,784 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:28:35,784 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:28:35,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 22:28:35,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:28:35,915 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-09 22:28:35,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:28:36,075 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-09 22:28:36,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639845705] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:28:36,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:28:36,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 16 [2024-11-09 22:28:36,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933851001] [2024-11-09 22:28:36,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:28:36,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 22:28:36,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:28:36,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 22:28:36,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2024-11-09 22:28:36,078 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-09 22:28:36,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:28:36,533 INFO L93 Difference]: Finished difference Result 370 states and 403 transitions. [2024-11-09 22:28:36,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 22:28:36,534 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-09 22:28:36,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:28:36,536 INFO L225 Difference]: With dead ends: 370 [2024-11-09 22:28:36,536 INFO L226 Difference]: Without dead ends: 353 [2024-11-09 22:28:36,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2024-11-09 22:28:36,539 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 22:28:36,539 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.3s Time] [2024-11-09 22:28:36,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-09 22:28:36,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 291. [2024-11-09 22:28:36,613 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-09 22:28:36,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 319 transitions. [2024-11-09 22:28:36,615 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 319 transitions. Word has length 126 [2024-11-09 22:28:36,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:28:36,615 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 319 transitions. [2024-11-09 22:28:36,616 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-09 22:28:36,616 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 319 transitions. [2024-11-09 22:28:36,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 22:28:36,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:28:36,617 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-09 22:28:36,634 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-09 22:28:36,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 22:28:36,818 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:28:36,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:28:36,819 INFO L85 PathProgramCache]: Analyzing trace with hash -65696330, now seen corresponding path program 1 times [2024-11-09 22:28:36,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:28:36,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181085922] [2024-11-09 22:28:36,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:36,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:28:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:28:36,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140766255] [2024-11-09 22:28:36,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:36,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:36,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:28:36,866 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:28:36,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 22:28:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:36,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 22:28:36,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:28:37,248 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-09 22:28:37,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:28:43,567 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-09 22:28:43,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:28:43,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181085922] [2024-11-09 22:28:43,568 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:28:43,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140766255] [2024-11-09 22:28:43,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140766255] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:28:43,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:28:43,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-11-09 22:28:43,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004840176] [2024-11-09 22:28:43,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:28:43,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 22:28:43,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:28:43,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 22:28:43,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=214, Unknown=1, NotChecked=0, Total=272 [2024-11-09 22:28:43,570 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-09 22:28:54,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 22:28:59,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 22:28:59,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:28:59,947 INFO L93 Difference]: Finished difference Result 330 states and 350 transitions. [2024-11-09 22:28:59,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 22:28:59,948 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-09 22:28:59,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:28:59,950 INFO L225 Difference]: With dead ends: 330 [2024-11-09 22:28:59,950 INFO L226 Difference]: Without dead ends: 301 [2024-11-09 22:28:59,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=76, Invalid=264, Unknown=2, NotChecked=0, Total=342 [2024-11-09 22:28:59,951 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 31 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:28:59,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 329 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 320 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2024-11-09 22:28:59,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-09 22:29:00,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2024-11-09 22:29:00,035 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-09 22:29:00,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 318 transitions. [2024-11-09 22:29:00,036 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 318 transitions. Word has length 134 [2024-11-09 22:29:00,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:29:00,037 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 318 transitions. [2024-11-09 22:29:00,037 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-09 22:29:00,037 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 318 transitions. [2024-11-09 22:29:00,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 22:29:00,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:29:00,038 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-09 22:29:00,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 22:29:00,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 22:29:00,239 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:29:00,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:29:00,239 INFO L85 PathProgramCache]: Analyzing trace with hash -962383017, now seen corresponding path program 2 times [2024-11-09 22:29:00,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:29:00,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620218835] [2024-11-09 22:29:00,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:29:00,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:29:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:29:00,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2009856373] [2024-11-09 22:29:00,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:29:00,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:29:00,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:29:00,301 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-09 22:29:00,302 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-09 22:29:00,387 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:29:00,387 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:29:00,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 22:29:00,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:29:00,673 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-09 22:29:00,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:29:01,378 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-09 22:29:01,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:29:01,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620218835] [2024-11-09 22:29:01,378 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:29:01,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009856373] [2024-11-09 22:29:01,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009856373] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:29:01,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:29:01,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-09 22:29:01,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383787453] [2024-11-09 22:29:01,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:29:01,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 22:29:01,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:29:01,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 22:29:01,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-11-09 22:29:01,380 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-09 22:29:01,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:29:01,907 INFO L93 Difference]: Finished difference Result 315 states and 331 transitions. [2024-11-09 22:29:01,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 22:29:01,907 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-09 22:29:01,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:29:01,909 INFO L225 Difference]: With dead ends: 315 [2024-11-09 22:29:01,909 INFO L226 Difference]: Without dead ends: 282 [2024-11-09 22:29:01,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 293 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2024-11-09 22:29:01,910 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 16 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:29:01,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 363 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 22:29:01,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-09 22:29:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-09 22:29:01,971 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-09 22:29:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 287 transitions. [2024-11-09 22:29:01,972 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 287 transitions. Word has length 157 [2024-11-09 22:29:01,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:29:01,973 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 287 transitions. [2024-11-09 22:29:01,973 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-09 22:29:01,973 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 287 transitions. [2024-11-09 22:29:01,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2024-11-09 22:29:01,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:29:01,976 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-09 22:29:01,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 22:29:02,177 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-09 22:29:02,177 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:29:02,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:29:02,177 INFO L85 PathProgramCache]: Analyzing trace with hash -636330798, now seen corresponding path program 3 times [2024-11-09 22:29:02,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:29:02,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729394351] [2024-11-09 22:29:02,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:29:02,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:29:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:29:02,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1651897663] [2024-11-09 22:29:02,279 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 22:29:02,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:29:02,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:29:02,281 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-09 22:29:02,282 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-09 22:29:02,532 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2024-11-09 22:29:02,532 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 22:29:02,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 22:29:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:29:02,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 22:29:02,656 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 22:29:02,657 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 22:29:02,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 22:29:02,858 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-09 22:29:02,861 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:29:02,936 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 22:29:02,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:29:02 BoogieIcfgContainer [2024-11-09 22:29:02,938 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 22:29:02,939 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 22:29:02,939 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 22:29:02,939 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 22:29:02,939 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:28:23" (3/4) ... [2024-11-09 22:29:02,940 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 22:29:03,040 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 22:29:03,040 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 22:29:03,040 INFO L158 Benchmark]: Toolchain (without parser) took 39970.28ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 136.6MB in the beginning and 170.7MB in the end (delta: -34.1MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2024-11-09 22:29:03,040 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:29:03,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.60ms. Allocated memory is still 167.8MB. Free memory was 136.6MB in the beginning and 123.4MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 22:29:03,041 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.61ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 122.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:29:03,041 INFO L158 Benchmark]: Boogie Preprocessor took 30.57ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 120.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:29:03,041 INFO L158 Benchmark]: IcfgBuilder took 355.58ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 108.2MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 22:29:03,041 INFO L158 Benchmark]: TraceAbstraction took 39179.67ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 107.4MB in the beginning and 180.2MB in the end (delta: -72.7MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2024-11-09 22:29:03,041 INFO L158 Benchmark]: Witness Printer took 101.21ms. Allocated memory is still 243.3MB. Free memory was 180.2MB in the beginning and 170.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 22:29:03,044 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.18ms. Allocated memory is still 117.4MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.60ms. Allocated memory is still 167.8MB. Free memory was 136.6MB in the beginning and 123.4MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.61ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 122.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.57ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 120.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 355.58ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 108.2MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 39179.67ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 107.4MB in the beginning and 180.2MB in the end (delta: -72.7MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * Witness Printer took 101.21ms. Allocated memory is still 243.3MB. Free memory was 180.2MB in the beginning and 170.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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=10, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [a=10, counter=1, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<10 [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=10, 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=10, 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=10, 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=10, 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=10, 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=10, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [a=10, counter=2, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<10 [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=10, 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=10, 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=10, 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=10, 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=10, 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=10, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [a=10, counter=3, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<10 [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=10, 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=10, 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=10, 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=10, 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=10, 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=10, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [a=10, counter=4, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<10 [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=10, 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=10, 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=10, 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=10, 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=10, 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=10, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [a=10, counter=5, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<10 [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=10, 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=10, 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=10, 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=10, 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=10, 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=10, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [a=10, counter=6, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<10 [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=10, 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=10, 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=10, 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=10, 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=10, 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=10, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [a=10, counter=7, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<10 [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=10, 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=10, 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=10, 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=10, 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=10, 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=10, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [a=10, counter=8, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<10 [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=10, 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=10, 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=10, 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=10, 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=10, 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=10, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [a=10, counter=9, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<10 [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=10, 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=10, 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=10, 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=10, 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=10, 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=10, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [a=10, counter=10, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<10 [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=10, 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=10, 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=10, 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=10, 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=10, 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=10, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [a=10, counter=11, n=10, x=1000, y=331, z=66] [L33] COND FALSE !(counter++<10) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [a=10, counter=11, n=10, x=1000, y=331, z=66] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, counter=11] [L15] COND TRUE !(cond) VAL [\old(cond)=0, counter=11] [L17] reach_error() VAL [\old(cond)=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.0s, OverallIterations: 16, TraceHistogramMax: 52, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 21.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 335 SdHoareTripleChecker+Valid, 12.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 282 mSDsluCounter, 2658 SdHoareTripleChecker+Invalid, 11.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2167 mSDsCounter, 415 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2205 IncrementalHoareTripleChecker+Invalid, 2622 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 415 mSolverCounterUnsat, 491 mSDtfsCounter, 2205 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1697 GetRequests, 1520 SyntacticMatches, 4 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 15.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=14, InterpolantAutomatonStates: 143, 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, 15 MinimizatonAttempts, 87 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 2266 NumberOfCodeBlocks, 2226 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 1763 ConstructedInterpolants, 0 QuantifiedInterpolants, 8350 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1948 ConjunctsInSsa, 264 ConjunctsInUnsatCore, 26 InterpolantComputations, 6 PerfectInterpolantSequences, 9096/10518 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 22:29:03,070 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