./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-nonlinear/bound-unconstrained.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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/floats-nonlinear/bound-unconstrained.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 d0ffe75bee721c501c37c8984b3eedc1776f6d69b4bd2f17e8a9e550059e7a0c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:47:03,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:47:03,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:47:03,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:47:03,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:47:03,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:47:03,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:47:03,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:47:03,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:47:03,496 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:47:03,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:47:03,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:47:03,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:47:03,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:47:03,499 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:47:03,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:47:03,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:47:03,500 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:47:03,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:47:03,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:47:03,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:47:03,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:47:03,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:47:03,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:47:03,504 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:47:03,504 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:47:03,504 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:47:03,504 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:47:03,505 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:47:03,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:47:03,505 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:47:03,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:47:03,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:47:03,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:47:03,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:47:03,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:47:03,507 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:47:03,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:47:03,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:47:03,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:47:03,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:47:03,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:47:03,508 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 -> d0ffe75bee721c501c37c8984b3eedc1776f6d69b4bd2f17e8a9e550059e7a0c [2024-11-08 13:47:03,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:47:03,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:47:03,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:47:03,752 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:47:03,753 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:47:03,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-nonlinear/bound-unconstrained.c [2024-11-08 13:47:05,054 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:47:05,232 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:47:05,233 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/bound-unconstrained.c [2024-11-08 13:47:05,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ab5b0ad/c7632cef41bc4aefb823ccb6273818c4/FLAGa498c524f [2024-11-08 13:47:05,251 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ab5b0ad/c7632cef41bc4aefb823ccb6273818c4 [2024-11-08 13:47:05,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:47:05,254 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:47:05,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:47:05,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:47:05,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:47:05,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:47:05" (1/1) ... [2024-11-08 13:47:05,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7559de35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:05, skipping insertion in model container [2024-11-08 13:47:05,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:47:05" (1/1) ... [2024-11-08 13:47:05,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:47:05,430 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/floats-nonlinear/bound-unconstrained.c[614,627] [2024-11-08 13:47:05,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:47:05,458 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:47:05,468 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/floats-nonlinear/bound-unconstrained.c[614,627] [2024-11-08 13:47:05,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:47:05,493 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:47:05,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:05 WrapperNode [2024-11-08 13:47:05,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:47:05,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:47:05,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:47:05,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:47:05,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:05" (1/1) ... [2024-11-08 13:47:05,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:05" (1/1) ... [2024-11-08 13:47:05,525 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2024-11-08 13:47:05,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:47:05,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:47:05,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:47:05,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:47:05,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:05" (1/1) ... [2024-11-08 13:47:05,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:05" (1/1) ... [2024-11-08 13:47:05,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:05" (1/1) ... [2024-11-08 13:47:05,558 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2024-11-08 13:47:05,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:05" (1/1) ... [2024-11-08 13:47:05,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:05" (1/1) ... [2024-11-08 13:47:05,564 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:05" (1/1) ... [2024-11-08 13:47:05,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:05" (1/1) ... [2024-11-08 13:47:05,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:05" (1/1) ... [2024-11-08 13:47:05,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:05" (1/1) ... [2024-11-08 13:47:05,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:47:05,574 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:47:05,578 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:47:05,578 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:47:05,579 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:05" (1/1) ... [2024-11-08 13:47:05,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:47:05,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:47:05,606 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-08 13:47:05,628 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-08 13:47:05,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:47:05,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:47:05,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:47:05,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 13:47:05,684 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2024-11-08 13:47:05,684 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2024-11-08 13:47:05,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:47:05,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:47:05,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:47:05,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:47:05,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:47:05,767 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:47:05,769 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:47:05,933 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-11-08 13:47:05,933 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:47:05,945 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:47:05,946 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 13:47:05,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:47:05 BoogieIcfgContainer [2024-11-08 13:47:05,946 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:47:05,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:47:05,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:47:05,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:47:05,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:47:05" (1/3) ... [2024-11-08 13:47:05,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213cb4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:47:05, skipping insertion in model container [2024-11-08 13:47:05,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:05" (2/3) ... [2024-11-08 13:47:05,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213cb4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:47:05, skipping insertion in model container [2024-11-08 13:47:05,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:47:05" (3/3) ... [2024-11-08 13:47:05,954 INFO L112 eAbstractionObserver]: Analyzing ICFG bound-unconstrained.c [2024-11-08 13:47:05,967 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:47:05,968 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:47:06,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:47:06,010 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;@6b335d13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:47:06,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:47:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 13:47:06,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 13:47:06,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:06,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:06,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:06,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:06,022 INFO L85 PathProgramCache]: Analyzing trace with hash 759900455, now seen corresponding path program 1 times [2024-11-08 13:47:06,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:06,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374507995] [2024-11-08 13:47:06,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:06,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:06,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:06,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:47:06,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:06,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374507995] [2024-11-08 13:47:06,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374507995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:06,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:06,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 13:47:06,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769389537] [2024-11-08 13:47:06,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:06,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:47:06,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:06,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:47:06,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:47:06,300 INFO L87 Difference]: Start difference. First operand has 38 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:06,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:06,352 INFO L93 Difference]: Finished difference Result 73 states and 102 transitions. [2024-11-08 13:47:06,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:47:06,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-08 13:47:06,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:06,359 INFO L225 Difference]: With dead ends: 73 [2024-11-08 13:47:06,359 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 13:47:06,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:47:06,366 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:06,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:06,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 13:47:06,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-08 13:47:06,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 13:47:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2024-11-08 13:47:06,398 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 19 [2024-11-08 13:47:06,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:06,399 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2024-11-08 13:47:06,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:06,400 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2024-11-08 13:47:06,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 13:47:06,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:06,402 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:06,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:47:06,402 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:06,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:06,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2027515032, now seen corresponding path program 1 times [2024-11-08 13:47:06,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:06,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162772863] [2024-11-08 13:47:06,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:06,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:06,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:47:06,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:06,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162772863] [2024-11-08 13:47:06,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162772863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:06,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:06,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:47:06,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663196744] [2024-11-08 13:47:06,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:06,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:47:06,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:06,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:47:06,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:47:06,476 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:06,498 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2024-11-08 13:47:06,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:47:06,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-08 13:47:06,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:06,500 INFO L225 Difference]: With dead ends: 43 [2024-11-08 13:47:06,500 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 13:47:06,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:47:06,501 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:06,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:06,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 13:47:06,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-08 13:47:06,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 13:47:06,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2024-11-08 13:47:06,511 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 19 [2024-11-08 13:47:06,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:06,511 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2024-11-08 13:47:06,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:06,512 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2024-11-08 13:47:06,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 13:47:06,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:06,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:06,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:47:06,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:06,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:06,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2027455450, now seen corresponding path program 1 times [2024-11-08 13:47:06,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:06,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447068939] [2024-11-08 13:47:06,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:06,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:06,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:06,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:47:06,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:06,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447068939] [2024-11-08 13:47:06,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447068939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:06,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:06,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:47:06,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147418824] [2024-11-08 13:47:06,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:06,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:47:06,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:06,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:47:06,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:06,636 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:06,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:06,650 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2024-11-08 13:47:06,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:47:06,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-08 13:47:06,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:06,652 INFO L225 Difference]: With dead ends: 43 [2024-11-08 13:47:06,652 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 13:47:06,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-08 13:47:06,653 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:06,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:06,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 13:47:06,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-08 13:47:06,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 13:47:06,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-08 13:47:06,663 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 19 [2024-11-08 13:47:06,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:06,663 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-08 13:47:06,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:06,664 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-08 13:47:06,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 13:47:06,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:06,665 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:06,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 13:47:06,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:06,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:06,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1306662713, now seen corresponding path program 1 times [2024-11-08 13:47:06,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:06,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476569027] [2024-11-08 13:47:06,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:06,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:06,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:06,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:47:06,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:06,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476569027] [2024-11-08 13:47:06,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476569027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:06,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:06,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:47:06,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712971810] [2024-11-08 13:47:06,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:06,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:47:06,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:06,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:47:06,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:47:06,735 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:06,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:06,755 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2024-11-08 13:47:06,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:47:06,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-08 13:47:06,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:06,759 INFO L225 Difference]: With dead ends: 52 [2024-11-08 13:47:06,759 INFO L226 Difference]: Without dead ends: 45 [2024-11-08 13:47:06,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:47:06,760 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:06,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 76 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:06,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-08 13:47:06,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2024-11-08 13:47:06,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 13:47:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-11-08 13:47:06,769 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 22 [2024-11-08 13:47:06,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:06,769 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-08 13:47:06,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:06,770 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2024-11-08 13:47:06,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 13:47:06,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:06,771 INFO L215 NwaCegarLoop]: trace histogram [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-08 13:47:06,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 13:47:06,771 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:06,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:06,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1623898437, now seen corresponding path program 1 times [2024-11-08 13:47:06,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:06,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448327284] [2024-11-08 13:47:06,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:06,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:06,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:47:06,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:06,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448327284] [2024-11-08 13:47:06,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448327284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:06,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:06,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:47:06,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307791147] [2024-11-08 13:47:06,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:06,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:47:06,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:06,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:47:06,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:06,850 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:06,874 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2024-11-08 13:47:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:47:06,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-08 13:47:06,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:06,876 INFO L225 Difference]: With dead ends: 55 [2024-11-08 13:47:06,876 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 13:47:06,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-08 13:47:06,877 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:06,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:06,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 13:47:06,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-08 13:47:06,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 13:47:06,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2024-11-08 13:47:06,888 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 23 [2024-11-08 13:47:06,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:06,888 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2024-11-08 13:47:06,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:06,889 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2024-11-08 13:47:06,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 13:47:06,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:06,891 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 13:47:06,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 13:47:06,891 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:06,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:06,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1586179963, now seen corresponding path program 1 times [2024-11-08 13:47:06,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:06,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627546403] [2024-11-08 13:47:06,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:06,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:06,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:06,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 13:47:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:06,994 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-08 13:47:06,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:06,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627546403] [2024-11-08 13:47:06,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627546403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:06,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:06,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:47:06,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442232245] [2024-11-08 13:47:06,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:06,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:47:06,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:06,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:47:06,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:06,997 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:47:07,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:07,013 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2024-11-08 13:47:07,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:47:07,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-08 13:47:07,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:07,014 INFO L225 Difference]: With dead ends: 65 [2024-11-08 13:47:07,014 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 13:47:07,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-08 13:47:07,015 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:07,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:07,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 13:47:07,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-08 13:47:07,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 13:47:07,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2024-11-08 13:47:07,020 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 29 [2024-11-08 13:47:07,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:07,020 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-08 13:47:07,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:47:07,020 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2024-11-08 13:47:07,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 13:47:07,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:07,021 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1] [2024-11-08 13:47:07,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 13:47:07,022 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:07,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:07,022 INFO L85 PathProgramCache]: Analyzing trace with hash 354834250, now seen corresponding path program 1 times [2024-11-08 13:47:07,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:07,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453145071] [2024-11-08 13:47:07,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:07,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:07,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:07,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 13:47:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:07,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 13:47:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:07,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 13:47:07,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:07,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453145071] [2024-11-08 13:47:07,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453145071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:07,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:07,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:47:07,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736808015] [2024-11-08 13:47:07,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:07,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:47:07,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:07,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:47:07,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:07,091 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 13:47:07,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:07,122 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2024-11-08 13:47:07,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:47:07,123 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-11-08 13:47:07,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:07,123 INFO L225 Difference]: With dead ends: 69 [2024-11-08 13:47:07,124 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 13:47:07,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-08 13:47:07,125 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:07,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:07,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 13:47:07,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-11-08 13:47:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 13:47:07,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-08 13:47:07,134 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 35 [2024-11-08 13:47:07,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:07,134 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-08 13:47:07,134 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 13:47:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-08 13:47:07,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 13:47:07,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:07,136 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1] [2024-11-08 13:47:07,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 13:47:07,137 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:07,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:07,137 INFO L85 PathProgramCache]: Analyzing trace with hash 193177993, now seen corresponding path program 1 times [2024-11-08 13:47:07,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:07,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355262472] [2024-11-08 13:47:07,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:07,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:07,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:07,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:07,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:07,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 13:47:07,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:07,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355262472] [2024-11-08 13:47:07,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355262472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:07,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:07,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:47:07,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009607283] [2024-11-08 13:47:07,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:07,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:47:07,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:07,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:47:07,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:07,222 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 13:47:07,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:07,238 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-11-08 13:47:07,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:47:07,239 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), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2024-11-08 13:47:07,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:07,239 INFO L225 Difference]: With dead ends: 41 [2024-11-08 13:47:07,241 INFO L226 Difference]: Without dead ends: 35 [2024-11-08 13:47:07,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-08 13:47:07,242 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 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-08 13:47:07,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:07,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-08 13:47:07,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-08 13:47:07,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 13:47:07,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-08 13:47:07,248 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 41 [2024-11-08 13:47:07,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:07,248 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-08 13:47:07,249 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), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 13:47:07,249 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-08 13:47:07,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 13:47:07,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:07,251 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:07,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 13:47:07,251 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:07,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:07,252 INFO L85 PathProgramCache]: Analyzing trace with hash -397851069, now seen corresponding path program 1 times [2024-11-08 13:47:07,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:07,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361409036] [2024-11-08 13:47:07,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:07,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:07,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:07,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:07,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:07,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:07,319 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 13:47:07,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:07,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361409036] [2024-11-08 13:47:07,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361409036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:07,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:07,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:47:07,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014626861] [2024-11-08 13:47:07,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:07,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:47:07,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:07,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:47:07,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:07,322 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 13:47:07,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:07,361 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2024-11-08 13:47:07,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:47:07,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2024-11-08 13:47:07,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:07,364 INFO L225 Difference]: With dead ends: 56 [2024-11-08 13:47:07,364 INFO L226 Difference]: Without dead ends: 43 [2024-11-08 13:47:07,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:47:07,365 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:07,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 98 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:07,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-08 13:47:07,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-11-08 13:47:07,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 13:47:07,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-11-08 13:47:07,371 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 44 [2024-11-08 13:47:07,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:07,373 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-11-08 13:47:07,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 13:47:07,373 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-11-08 13:47:07,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 13:47:07,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:07,376 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:07,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 13:47:07,376 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:07,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:07,376 INFO L85 PathProgramCache]: Analyzing trace with hash 21171379, now seen corresponding path program 1 times [2024-11-08 13:47:07,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:07,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991649257] [2024-11-08 13:47:07,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:07,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:07,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:07,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:07,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:07,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 13:47:07,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:07,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991649257] [2024-11-08 13:47:07,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991649257] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:47:07,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647551200] [2024-11-08 13:47:07,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:07,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:07,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:47:07,454 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-08 13:47:07,456 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-08 13:47:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:07,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 13:47:07,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:47:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 13:47:07,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:47:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 13:47:07,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647551200] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:47:07,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:47:07,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-08 13:47:07,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879771504] [2024-11-08 13:47:07,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:47:07,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 13:47:07,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:07,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 13:47:07,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-08 13:47:07,645 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 13:47:07,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:07,732 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2024-11-08 13:47:07,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 13:47:07,733 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2024-11-08 13:47:07,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:07,733 INFO L225 Difference]: With dead ends: 74 [2024-11-08 13:47:07,734 INFO L226 Difference]: Without dead ends: 61 [2024-11-08 13:47:07,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-08 13:47:07,738 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 34 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:07,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 224 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:07,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-08 13:47:07,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2024-11-08 13:47:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 13:47:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2024-11-08 13:47:07,745 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 47 [2024-11-08 13:47:07,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:07,746 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-11-08 13:47:07,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 13:47:07,746 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2024-11-08 13:47:07,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 13:47:07,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:07,747 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 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, 1, 1] [2024-11-08 13:47:07,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 13:47:07,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 13:47:07,951 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:07,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:07,952 INFO L85 PathProgramCache]: Analyzing trace with hash 102156763, now seen corresponding path program 2 times [2024-11-08 13:47:07,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:07,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900208270] [2024-11-08 13:47:07,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:07,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:08,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:08,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:08,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:08,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-08 13:47:08,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:08,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900208270] [2024-11-08 13:47:08,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900208270] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:47:08,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951629155] [2024-11-08 13:47:08,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 13:47:08,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:08,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:47:08,020 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-08 13:47:08,038 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-08 13:47:08,109 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 13:47:08,109 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:47:08,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 13:47:08,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:47:08,156 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 13:47:08,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:47:08,224 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 13:47:08,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951629155] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:47:08,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:47:08,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 9 [2024-11-08 13:47:08,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890347158] [2024-11-08 13:47:08,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:47:08,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 13:47:08,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:08,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 13:47:08,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 13:47:08,227 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 13:47:08,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:08,307 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2024-11-08 13:47:08,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 13:47:08,308 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 66 [2024-11-08 13:47:08,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:08,309 INFO L225 Difference]: With dead ends: 88 [2024-11-08 13:47:08,310 INFO L226 Difference]: Without dead ends: 74 [2024-11-08 13:47:08,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 131 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2024-11-08 13:47:08,311 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 18 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:08,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 132 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:08,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-08 13:47:08,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2024-11-08 13:47:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 62 states have internal predecessors, (67), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 13:47:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2024-11-08 13:47:08,317 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 66 [2024-11-08 13:47:08,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:08,318 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2024-11-08 13:47:08,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 13:47:08,318 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2024-11-08 13:47:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 13:47:08,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:08,320 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1] [2024-11-08 13:47:08,336 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-08 13:47:08,521 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,SelfDestructingSolverStorable10 [2024-11-08 13:47:08,522 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:08,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:08,522 INFO L85 PathProgramCache]: Analyzing trace with hash 413434803, now seen corresponding path program 3 times [2024-11-08 13:47:08,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:08,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082547861] [2024-11-08 13:47:08,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:08,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:08,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:08,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:08,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:08,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-08 13:47:08,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:08,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082547861] [2024-11-08 13:47:08,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082547861] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:47:08,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778431861] [2024-11-08 13:47:08,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 13:47:08,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:08,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:47:08,618 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-08 13:47:08,619 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-08 13:47:08,708 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 13:47:08,708 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:47:08,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 13:47:08,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:47:08,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 13:47:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-08 13:47:08,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 13:47:08,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778431861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:08,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 13:47:08,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-11-08 13:47:08,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770857942] [2024-11-08 13:47:08,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:08,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:47:08,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:08,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:47:08,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-08 13:47:08,758 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 13:47:08,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:08,783 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2024-11-08 13:47:08,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:47:08,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 79 [2024-11-08 13:47:08,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:08,784 INFO L225 Difference]: With dead ends: 68 [2024-11-08 13:47:08,784 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 13:47:08,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-08 13:47:08,785 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:08,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:08,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 13:47:08,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 13:47:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:47:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 13:47:08,785 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2024-11-08 13:47:08,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:08,785 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 13:47:08,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 13:47:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 13:47:08,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 13:47:08,789 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 13:47:08,802 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-08 13:47:08,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:08,993 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:08,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 13:47:09,021 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 13:47:09,028 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#di~0!offset [2024-11-08 13:47:09,031 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#di~0!offset [2024-11-08 13:47:09,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 01:47:09 BoogieIcfgContainer [2024-11-08 13:47:09,035 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 13:47:09,035 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 13:47:09,035 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 13:47:09,035 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 13:47:09,036 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:47:05" (3/4) ... [2024-11-08 13:47:09,037 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 13:47:09,040 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure check_domain [2024-11-08 13:47:09,044 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-08 13:47:09,044 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-08 13:47:09,044 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 13:47:09,044 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 13:47:09,119 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 13:47:09,119 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 13:47:09,119 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 13:47:09,119 INFO L158 Benchmark]: Toolchain (without parser) took 3865.04ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 104.1MB in the beginning and 136.3MB in the end (delta: -32.1MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2024-11-08 13:47:09,120 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 13:47:09,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.51ms. Allocated memory is still 176.2MB. Free memory was 103.9MB in the beginning and 91.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 13:47:09,120 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.59ms. Allocated memory is still 176.2MB. Free memory was 91.1MB in the beginning and 89.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 13:47:09,120 INFO L158 Benchmark]: Boogie Preprocessor took 45.68ms. Allocated memory is still 176.2MB. Free memory was 89.3MB in the beginning and 87.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 13:47:09,120 INFO L158 Benchmark]: RCFGBuilder took 372.23ms. Allocated memory is still 176.2MB. Free memory was 86.9MB in the beginning and 131.8MB in the end (delta: -44.9MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2024-11-08 13:47:09,120 INFO L158 Benchmark]: TraceAbstraction took 3087.20ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 130.6MB in the beginning and 141.5MB in the end (delta: -10.9MB). Peak memory consumption was 74.9MB. Max. memory is 16.1GB. [2024-11-08 13:47:09,121 INFO L158 Benchmark]: Witness Printer took 83.75ms. Allocated memory is still 260.0MB. Free memory was 141.5MB in the beginning and 136.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 13:47:09,121 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.51ms. Allocated memory is still 176.2MB. Free memory was 103.9MB in the beginning and 91.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.59ms. Allocated memory is still 176.2MB. Free memory was 91.1MB in the beginning and 89.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.68ms. Allocated memory is still 176.2MB. Free memory was 89.3MB in the beginning and 87.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 372.23ms. Allocated memory is still 176.2MB. Free memory was 86.9MB in the beginning and 131.8MB in the end (delta: -44.9MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3087.20ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 130.6MB in the beginning and 141.5MB in the end (delta: -10.9MB). Peak memory consumption was 74.9MB. Max. memory is 16.1GB. * Witness Printer took 83.75ms. Allocated memory is still 260.0MB. Free memory was 141.5MB in the beginning and 136.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#di~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#di~0!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 12, TraceHistogramMax: 9, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 1427 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 960 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 209 IncrementalHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 467 mSDtfsCounter, 209 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 427 GetRequests, 367 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=11, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 29 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 635 NumberOfCodeBlocks, 606 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 731 ConstructedInterpolants, 0 QuantifiedInterpolants, 1035 SizeOfPredicates, 7 NumberOfNonLiveVariables, 649 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 528/752 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((i == 0) && (j == 0)) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (i == 0) RESULT: Ultimate proved your program to be correct! [2024-11-08 13:47:09,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE