./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f97a505fe6488215cf15708661c3a7c87a5132fbff317a4b6f7f9cc44d66008 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:37:02,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:37:02,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:37:02,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:37:02,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:37:03,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:37:03,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:37:03,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:37:03,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:37:03,002 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:37:03,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:37:03,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:37:03,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:37:03,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:37:03,004 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:37:03,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:37:03,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:37:03,005 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:37:03,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:37:03,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:37:03,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:37:03,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:37:03,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:37:03,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:37:03,011 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:37:03,011 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:37:03,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:37:03,012 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:37:03,012 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:37:03,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:37:03,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:37:03,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:37:03,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:37:03,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:37:03,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:37:03,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:37:03,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:37:03,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:37:03,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:37:03,016 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:37:03,016 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:37:03,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:37:03,016 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 -> 7f97a505fe6488215cf15708661c3a7c87a5132fbff317a4b6f7f9cc44d66008 [2024-11-09 22:37:03,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:37:03,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:37:03,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:37:03,254 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:37:03,255 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:37:03,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c [2024-11-09 22:37:04,674 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:37:04,893 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:37:04,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c [2024-11-09 22:37:04,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/476a06ac8/801a372c631c44d4b60743990e9aac5d/FLAGc1ac11b06 [2024-11-09 22:37:05,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/476a06ac8/801a372c631c44d4b60743990e9aac5d [2024-11-09 22:37:05,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:37:05,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:37:05,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:37:05,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:37:05,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:37:05,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:05" (1/1) ... [2024-11-09 22:37:05,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c4656e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05, skipping insertion in model container [2024-11-09 22:37:05,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:05" (1/1) ... [2024-11-09 22:37:05,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:37:05,479 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/fermat1-ll_unwindbound5.c[535,548] [2024-11-09 22:37:05,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:37:05,509 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:37:05,520 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/fermat1-ll_unwindbound5.c[535,548] [2024-11-09 22:37:05,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:37:05,549 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:37:05,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05 WrapperNode [2024-11-09 22:37:05,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:37:05,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:37:05,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:37:05,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:37:05,560 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:37:05" (1/1) ... [2024-11-09 22:37:05,570 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:37:05" (1/1) ... [2024-11-09 22:37:05,595 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2024-11-09 22:37:05,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:37:05,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:37:05,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:37:05,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:37:05,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 22:37:05,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 22:37:05,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 22:37:05,625 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:37:05,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 22:37:05,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 22:37:05,628 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 22:37:05,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 22:37:05,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 22:37:05,630 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 22:37:05,632 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:37:05,633 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:37:05,633 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:37:05,633 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:37:05,634 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 22:37:05,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:37:05,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:05,668 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:37:05,671 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:37:05,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:37:05,720 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 22:37:05,720 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 22:37:05,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:37:05,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:37:05,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:37:05,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 22:37:05,722 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 22:37:05,777 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:37:05,779 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:37:05,951 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-09 22:37:05,952 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:37:05,970 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:37:05,970 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:37:05,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:37:05 BoogieIcfgContainer [2024-11-09 22:37:05,971 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:37:05,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:37:05,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:37:05,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:37:05,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:37:05" (1/3) ... [2024-11-09 22:37:05,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b971127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:37:05, skipping insertion in model container [2024-11-09 22:37:05,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (2/3) ... [2024-11-09 22:37:05,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b971127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:37:05, skipping insertion in model container [2024-11-09 22:37:05,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:37:05" (3/3) ... [2024-11-09 22:37:05,981 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound5.c [2024-11-09 22:37:05,994 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:37:05,995 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:37:06,050 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:37:06,056 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;@589c1c6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:37:06,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:37:06,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:37:06,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 22:37:06,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:06,068 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:06,070 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:06,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:06,074 INFO L85 PathProgramCache]: Analyzing trace with hash 901631504, now seen corresponding path program 1 times [2024-11-09 22:37:06,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:06,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926195585] [2024-11-09 22:37:06,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:06,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:06,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:06,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:06,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:06,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926195585] [2024-11-09 22:37:06,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926195585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:06,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:06,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 22:37:06,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754150569] [2024-11-09 22:37:06,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:06,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 22:37:06,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:06,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 22:37:06,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:37:06,321 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:37:06,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:06,348 INFO L93 Difference]: Finished difference Result 63 states and 96 transitions. [2024-11-09 22:37:06,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 22:37:06,350 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-11-09 22:37:06,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:06,356 INFO L225 Difference]: With dead ends: 63 [2024-11-09 22:37:06,356 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 22:37:06,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:37:06,363 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:06,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:37:06,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 22:37:06,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 22:37:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:37:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-11-09 22:37:06,405 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 19 [2024-11-09 22:37:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:06,406 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-11-09 22:37:06,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:37:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-11-09 22:37:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 22:37:06,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:06,409 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:06,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:37:06,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:06,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:06,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1613520884, now seen corresponding path program 1 times [2024-11-09 22:37:06,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:06,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967132919] [2024-11-09 22:37:06,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:06,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:06,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:06,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:06,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:06,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:06,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967132919] [2024-11-09 22:37:06,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967132919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:06,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:06,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:37:06,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167259623] [2024-11-09 22:37:06,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:06,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:37:06,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:06,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:37:06,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:37:06,579 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:37:06,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:06,611 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-09 22:37:06,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:37:06,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-09 22:37:06,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:06,616 INFO L225 Difference]: With dead ends: 39 [2024-11-09 22:37:06,616 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 22:37:06,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:37:06,618 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:06,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 94 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:37:06,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 22:37:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 22:37:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:37:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2024-11-09 22:37:06,631 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 20 [2024-11-09 22:37:06,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:06,633 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2024-11-09 22:37:06,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:37:06,633 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2024-11-09 22:37:06,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 22:37:06,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:06,636 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:06,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:37:06,636 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:06,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:06,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1579350607, now seen corresponding path program 1 times [2024-11-09 22:37:06,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:06,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576495511] [2024-11-09 22:37:06,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:06,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:37:06,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [17140036] [2024-11-09 22:37:06,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:06,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:06,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:06,690 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:37:06,692 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:37:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:06,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 22:37:06,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:07,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:07,081 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:37:07,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:07,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576495511] [2024-11-09 22:37:07,082 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:37:07,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17140036] [2024-11-09 22:37:07,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17140036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:07,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:07,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:37:07,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351481051] [2024-11-09 22:37:07,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:07,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:37:07,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:07,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:37:07,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:37:07,086 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:37:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:08,897 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2024-11-09 22:37:08,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:37:08,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-09 22:37:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:08,899 INFO L225 Difference]: With dead ends: 51 [2024-11-09 22:37:08,899 INFO L226 Difference]: Without dead ends: 48 [2024-11-09 22:37:08,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:37:08,900 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 13 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:08,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 108 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 22:37:08,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-09 22:37:08,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-11-09 22:37:08,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 22:37:08,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2024-11-09 22:37:08,921 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 20 [2024-11-09 22:37:08,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:08,921 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2024-11-09 22:37:08,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:37:08,923 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2024-11-09 22:37:08,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 22:37:08,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:08,924 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:08,941 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:37:09,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:09,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:09,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:09,127 INFO L85 PathProgramCache]: Analyzing trace with hash 638966704, now seen corresponding path program 1 times [2024-11-09 22:37:09,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:09,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204097189] [2024-11-09 22:37:09,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:09,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:09,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:09,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:09,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:09,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:09,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204097189] [2024-11-09 22:37:09,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204097189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:09,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672715143] [2024-11-09 22:37:09,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:09,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:09,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:09,470 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:37:09,472 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:37:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:09,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 22:37:09,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:09,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:09,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:09,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672715143] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:09,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:09,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2024-11-09 22:37:09,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059806241] [2024-11-09 22:37:09,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:09,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 22:37:09,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:09,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 22:37:09,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:37:09,783 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 22:37:10,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:10,008 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2024-11-09 22:37:10,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 22:37:10,009 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 26 [2024-11-09 22:37:10,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:10,012 INFO L225 Difference]: With dead ends: 55 [2024-11-09 22:37:10,013 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 22:37:10,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 22:37:10,014 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:10,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 182 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 22:37:10,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 22:37:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2024-11-09 22:37:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:37:10,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-11-09 22:37:10,030 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 26 [2024-11-09 22:37:10,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:10,031 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-09 22:37:10,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 22:37:10,031 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-11-09 22:37:10,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 22:37:10,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:10,034 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:10,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 22:37:10,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 22:37:10,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:10,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:10,235 INFO L85 PathProgramCache]: Analyzing trace with hash 2071350485, now seen corresponding path program 1 times [2024-11-09 22:37:10,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:10,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271394393] [2024-11-09 22:37:10,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:10,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,329 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:37:10,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:10,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271394393] [2024-11-09 22:37:10,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271394393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:10,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:10,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:37:10,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609010327] [2024-11-09 22:37:10,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:10,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:37:10,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:10,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:37:10,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:37:10,335 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 22:37:10,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:10,374 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2024-11-09 22:37:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:37:10,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2024-11-09 22:37:10,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:10,376 INFO L225 Difference]: With dead ends: 63 [2024-11-09 22:37:10,376 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 22:37:10,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:37:10,380 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:10,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 94 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:37:10,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 22:37:10,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 22:37:10,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:37:10,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-11-09 22:37:10,399 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2024-11-09 22:37:10,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:10,399 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-11-09 22:37:10,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 22:37:10,400 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-11-09 22:37:10,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 22:37:10,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:10,401 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:10,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 22:37:10,402 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:10,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:10,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1300120643, now seen corresponding path program 1 times [2024-11-09 22:37:10,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:10,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144532215] [2024-11-09 22:37:10,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:10,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 22:37:10,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:10,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144532215] [2024-11-09 22:37:10,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144532215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:10,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:10,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 22:37:10,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551036557] [2024-11-09 22:37:10,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:10,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 22:37:10,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:10,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 22:37:10,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:37:10,510 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 22:37:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:10,550 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2024-11-09 22:37:10,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:37:10,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2024-11-09 22:37:10,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:10,552 INFO L225 Difference]: With dead ends: 72 [2024-11-09 22:37:10,552 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 22:37:10,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:37:10,553 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:10,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 113 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:37:10,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 22:37:10,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-11-09 22:37:10,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 22:37:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2024-11-09 22:37:10,567 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 38 [2024-11-09 22:37:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:10,567 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-11-09 22:37:10,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 22:37:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2024-11-09 22:37:10,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 22:37:10,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:10,568 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:10,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 22:37:10,569 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:10,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:10,569 INFO L85 PathProgramCache]: Analyzing trace with hash 727834173, now seen corresponding path program 1 times [2024-11-09 22:37:10,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:10,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397435975] [2024-11-09 22:37:10,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:10,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 22:37:10,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:10,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397435975] [2024-11-09 22:37:10,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397435975] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:10,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600424459] [2024-11-09 22:37:10,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:10,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:10,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:10,666 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:37:10,668 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:37:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 22:37:10,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:10,772 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:10,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:10,844 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 22:37:10,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600424459] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:10,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:10,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 9 [2024-11-09 22:37:10,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286177383] [2024-11-09 22:37:10,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:10,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 22:37:10,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:10,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 22:37:10,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 22:37:10,847 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 6 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-09 22:37:10,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:10,977 INFO L93 Difference]: Finished difference Result 107 states and 132 transitions. [2024-11-09 22:37:10,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 22:37:10,977 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 6 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 40 [2024-11-09 22:37:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:10,979 INFO L225 Difference]: With dead ends: 107 [2024-11-09 22:37:10,979 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 22:37:10,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:37:10,980 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 35 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:10,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 160 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:37:10,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 22:37:11,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2024-11-09 22:37:11,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 57 states have internal predecessors, (67), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 22:37:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 92 transitions. [2024-11-09 22:37:11,008 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 92 transitions. Word has length 40 [2024-11-09 22:37:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:11,009 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 92 transitions. [2024-11-09 22:37:11,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 6 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-09 22:37:11,009 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2024-11-09 22:37:11,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 22:37:11,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:11,010 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:11,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 22:37:11,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:11,211 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:11,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:11,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1932846666, now seen corresponding path program 1 times [2024-11-09 22:37:11,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:11,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74115135] [2024-11-09 22:37:11,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:11,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,272 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 22:37:11,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:11,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74115135] [2024-11-09 22:37:11,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74115135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:11,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:11,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:37:11,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640548619] [2024-11-09 22:37:11,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:11,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:37:11,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:11,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:37:11,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:37:11,275 INFO L87 Difference]: Start difference. First operand 76 states and 92 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 22:37:11,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:11,340 INFO L93 Difference]: Finished difference Result 130 states and 167 transitions. [2024-11-09 22:37:11,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:37:11,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 44 [2024-11-09 22:37:11,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:11,344 INFO L225 Difference]: With dead ends: 130 [2024-11-09 22:37:11,346 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 22:37:11,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:37:11,348 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 16 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:11,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 97 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:37:11,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 22:37:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2024-11-09 22:37:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 66 states have internal predecessors, (79), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 22:37:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 110 transitions. [2024-11-09 22:37:11,389 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 110 transitions. Word has length 44 [2024-11-09 22:37:11,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:11,389 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 110 transitions. [2024-11-09 22:37:11,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 22:37:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 110 transitions. [2024-11-09 22:37:11,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 22:37:11,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:11,393 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:11,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 22:37:11,393 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:11,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:11,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1799659301, now seen corresponding path program 1 times [2024-11-09 22:37:11,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:11,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913183670] [2024-11-09 22:37:11,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:11,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,544 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 22:37:11,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:11,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913183670] [2024-11-09 22:37:11,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913183670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:11,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556118959] [2024-11-09 22:37:11,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:11,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:11,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:11,547 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:37:11,548 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:37:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 22:37:11,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:11,668 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:11,757 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 22:37:11,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556118959] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:11,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:11,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 9 [2024-11-09 22:37:11,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024677767] [2024-11-09 22:37:11,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:11,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 22:37:11,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:11,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 22:37:11,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 22:37:11,761 INFO L87 Difference]: Start difference. First operand 88 states and 110 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 6 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-09 22:37:11,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:11,868 INFO L93 Difference]: Finished difference Result 130 states and 169 transitions. [2024-11-09 22:37:11,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 22:37:11,869 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 6 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 46 [2024-11-09 22:37:11,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:11,871 INFO L225 Difference]: With dead ends: 130 [2024-11-09 22:37:11,871 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 22:37:11,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:37:11,872 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:11,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 159 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:37:11,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 22:37:11,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-09 22:37:11,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 22:37:11,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2024-11-09 22:37:11,907 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 46 [2024-11-09 22:37:11,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:11,908 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2024-11-09 22:37:11,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 6 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-09 22:37:11,909 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2024-11-09 22:37:11,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 22:37:11,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:11,914 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:11,932 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:37:12,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:12,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:12,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:12,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1232495694, now seen corresponding path program 1 times [2024-11-09 22:37:12,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:12,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440725438] [2024-11-09 22:37:12,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:12,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:12,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:12,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:12,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:12,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:12,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:12,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:37:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 22:37:12,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:12,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440725438] [2024-11-09 22:37:12,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440725438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:12,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533979240] [2024-11-09 22:37:12,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:12,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:12,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:12,240 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:37:12,249 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:37:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:12,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 22:37:12,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:12,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 22:37:12,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533979240] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:12,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:12,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 8 [2024-11-09 22:37:12,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935447388] [2024-11-09 22:37:12,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:12,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 22:37:12,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:12,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 22:37:12,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 22:37:12,464 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 6 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-09 22:37:12,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:12,559 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2024-11-09 22:37:12,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 22:37:12,560 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 6 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 52 [2024-11-09 22:37:12,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:12,561 INFO L225 Difference]: With dead ends: 99 [2024-11-09 22:37:12,561 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 22:37:12,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 109 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-09 22:37:12,562 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:12,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 123 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:37:12,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 22:37:12,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-09 22:37:12,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 22:37:12,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2024-11-09 22:37:12,594 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 52 [2024-11-09 22:37:12,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:12,596 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2024-11-09 22:37:12,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 6 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-09 22:37:12,596 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2024-11-09 22:37:12,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 22:37:12,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:12,597 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:12,614 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:37:12,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 22:37:12,802 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:12,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:12,803 INFO L85 PathProgramCache]: Analyzing trace with hash 69626138, now seen corresponding path program 2 times [2024-11-09 22:37:12,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:12,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491193885] [2024-11-09 22:37:12,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:12,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:13,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:13,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:13,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:13,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:13,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:13,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:37:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:13,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 22:37:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-09 22:37:13,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:13,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491193885] [2024-11-09 22:37:13,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491193885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:13,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236920200] [2024-11-09 22:37:13,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:37:13,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:13,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:13,115 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:37:13,116 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:37:13,171 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:37:13,171 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:37:13,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 22:37:13,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:13,267 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-09 22:37:13,267 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:19,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236920200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:19,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:37:19,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2024-11-09 22:37:19,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471502629] [2024-11-09 22:37:19,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:19,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 22:37:19,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:19,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 22:37:19,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=142, Unknown=2, NotChecked=0, Total=182 [2024-11-09 22:37:19,148 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 22:37:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:19,468 INFO L93 Difference]: Finished difference Result 185 states and 245 transitions. [2024-11-09 22:37:19,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 22:37:19,468 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 60 [2024-11-09 22:37:19,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:19,471 INFO L225 Difference]: With dead ends: 185 [2024-11-09 22:37:19,472 INFO L226 Difference]: Without dead ends: 138 [2024-11-09 22:37:19,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=63, Invalid=207, Unknown=2, NotChecked=0, Total=272 [2024-11-09 22:37:19,473 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 38 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:19,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 381 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 22:37:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-09 22:37:19,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 105. [2024-11-09 22:37:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 81 states have internal predecessors, (93), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 22:37:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2024-11-09 22:37:19,513 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 60 [2024-11-09 22:37:19,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:19,513 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2024-11-09 22:37:19,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 22:37:19,513 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2024-11-09 22:37:19,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 22:37:19,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:19,516 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:19,535 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:37:19,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:19,721 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:19,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:19,721 INFO L85 PathProgramCache]: Analyzing trace with hash -802250657, now seen corresponding path program 1 times [2024-11-09 22:37:19,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:19,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222379203] [2024-11-09 22:37:19,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:19,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:37:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 22:37:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,790 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-09 22:37:19,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:19,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222379203] [2024-11-09 22:37:19,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222379203] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:19,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124282013] [2024-11-09 22:37:19,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:19,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:19,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:19,793 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:37:19,794 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:37:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 22:37:19,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:19,884 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 22:37:19,885 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-09 22:37:19,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124282013] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:19,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:19,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-09 22:37:19,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400605263] [2024-11-09 22:37:19,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:19,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:37:19,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:19,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:37:19,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:37:19,941 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-09 22:37:20,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:20,066 INFO L93 Difference]: Finished difference Result 244 states and 336 transitions. [2024-11-09 22:37:20,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:37:20,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 60 [2024-11-09 22:37:20,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:20,068 INFO L225 Difference]: With dead ends: 244 [2024-11-09 22:37:20,068 INFO L226 Difference]: Without dead ends: 188 [2024-11-09 22:37:20,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:37:20,069 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 22 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:20,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 185 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:37:20,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-09 22:37:20,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 170. [2024-11-09 22:37:20,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 128 states have (on average 1.265625) internal successors, (162), 133 states have internal predecessors, (162), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (33), 28 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-09 22:37:20,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 229 transitions. [2024-11-09 22:37:20,133 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 229 transitions. Word has length 60 [2024-11-09 22:37:20,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:20,134 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 229 transitions. [2024-11-09 22:37:20,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-09 22:37:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 229 transitions. [2024-11-09 22:37:20,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 22:37:20,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:20,135 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:20,152 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:37:20,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:20,336 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:20,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:20,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1098792284, now seen corresponding path program 1 times [2024-11-09 22:37:20,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:20,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388885843] [2024-11-09 22:37:20,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:20,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:37:20,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1814554807] [2024-11-09 22:37:20,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:20,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:20,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:20,359 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:37:20,360 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:37:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:37:20,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 22:37:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:37:20,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 22:37:20,470 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 22:37:20,471 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 22:37:20,489 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:37:20,673 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,SelfDestructingSolverStorable12 [2024-11-09 22:37:20,676 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:20,711 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 22:37:20,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:37:20 BoogieIcfgContainer [2024-11-09 22:37:20,713 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 22:37:20,714 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 22:37:20,714 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 22:37:20,714 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 22:37:20,715 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:37:05" (3/4) ... [2024-11-09 22:37:20,716 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 22:37:20,759 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 22:37:20,762 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 22:37:20,763 INFO L158 Benchmark]: Toolchain (without parser) took 15476.95ms. Allocated memory was 157.3MB in the beginning and 192.9MB in the end (delta: 35.7MB). Free memory was 124.6MB in the beginning and 96.1MB in the end (delta: 28.4MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-11-09 22:37:20,763 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:37:20,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.02ms. Allocated memory is still 157.3MB. Free memory was 124.6MB in the beginning and 111.0MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 22:37:20,763 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.88ms. Allocated memory is still 157.3MB. Free memory was 111.0MB in the beginning and 109.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:37:20,763 INFO L158 Benchmark]: Boogie Preprocessor took 33.87ms. Allocated memory is still 157.3MB. Free memory was 109.9MB in the beginning and 108.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:37:20,764 INFO L158 Benchmark]: IcfgBuilder took 338.16ms. Allocated memory is still 157.3MB. Free memory was 107.8MB in the beginning and 96.1MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 22:37:20,764 INFO L158 Benchmark]: TraceAbstraction took 14740.49ms. Allocated memory was 157.3MB in the beginning and 192.9MB in the end (delta: 35.7MB). Free memory was 95.2MB in the beginning and 99.3MB in the end (delta: -4.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-09 22:37:20,765 INFO L158 Benchmark]: Witness Printer took 48.51ms. Allocated memory is still 192.9MB. Free memory was 99.3MB in the beginning and 96.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:37:20,766 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 121.6MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.02ms. Allocated memory is still 157.3MB. Free memory was 124.6MB in the beginning and 111.0MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.88ms. Allocated memory is still 157.3MB. Free memory was 111.0MB in the beginning and 109.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.87ms. Allocated memory is still 157.3MB. Free memory was 109.9MB in the beginning and 108.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 338.16ms. Allocated memory is still 157.3MB. Free memory was 107.8MB in the beginning and 96.1MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14740.49ms. Allocated memory was 157.3MB in the beginning and 192.9MB in the end (delta: 35.7MB). Free memory was 95.2MB in the beginning and 99.3MB in the end (delta: -4.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Witness Printer took 48.51ms. Allocated memory is still 192.9MB. Free memory was 99.3MB in the beginning and 96.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L25] CALL assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L25] RET assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [A=3, R=0, counter=0] [L27] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L27] RET assume_abort_if_not(A % 2 == 1) VAL [A=3, R=0, counter=0] [L29] u = ((long long) 2 * R) + 1 [L30] v = 1 [L31] r = ((long long) R * R) - A VAL [A=3, counter=0, r=-3, u=1, v=1] [L34] EXPR counter++ VAL [A=3, counter=1, r=-3, u=1, v=1] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=3, counter=1, r=-3, u=1, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=3, counter=1, r=-3, u=1, v=1] [L39] EXPR counter++ VAL [A=3, counter=2, r=-3, u=1, v=1] [L39] COND TRUE counter++<5 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=3, counter=2, r=-3, u=1, v=1] [L41] COND TRUE !(r > 0) VAL [A=3, counter=2, r=-3, u=1, v=1] [L47] EXPR counter++ VAL [A=3, counter=3, r=-3, u=1, v=1] [L47] COND TRUE counter++<5 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=3, counter=3, r=-3, u=1, v=1] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [A=3, counter=3, r=-2, u=3, v=1] [L47] EXPR counter++ VAL [A=3, counter=4, r=-2, u=3, v=1] [L47] COND TRUE counter++<5 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=3, counter=4, r=-2, u=3, v=1] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [A=3, counter=4, r=1, u=5, v=1] [L47] EXPR counter++ VAL [A=3, counter=5, r=1, u=5, v=1] [L47] COND TRUE counter++<5 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=3, counter=5, r=1, u=5, v=1] [L49] COND TRUE !(r < 0) VAL [A=3, counter=5, r=1, u=5, v=1] [L34] EXPR counter++ VAL [A=3, counter=6, r=1, u=5, v=1] [L34] COND FALSE !(counter++<5) [L56] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=6] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=6] [L14] reach_error() VAL [\old(cond)=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 218 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 204 mSDsluCounter, 1738 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1286 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 564 IncrementalHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 452 mSDtfsCounter, 564 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 694 GetRequests, 608 SyntacticMatches, 15 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=12, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 89 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 881 NumberOfCodeBlocks, 881 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 942 ConstructedInterpolants, 0 QuantifiedInterpolants, 2359 SizeOfPredicates, 14 NumberOfNonLiveVariables, 801 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 23 InterpolantComputations, 6 PerfectInterpolantSequences, 566/662 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:37:20,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE