./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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/reducercommutativity/rangesum.i -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 4dc91bf2fc8981aab63c1ee768384f1c8f580edfe4618d65089a78f799b6ddb8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 20:43:41,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 20:43:41,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 20:43:41,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 20:43:41,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 20:43:41,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 20:43:41,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 20:43:41,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 20:43:41,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 20:43:41,725 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 20:43:41,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 20:43:41,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 20:43:41,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 20:43:41,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 20:43:41,727 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 20:43:41,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 20:43:41,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 20:43:41,728 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 20:43:41,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 20:43:41,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 20:43:41,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 20:43:41,729 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 20:43:41,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 20:43:41,729 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 20:43:41,730 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 20:43:41,730 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 20:43:41,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 20:43:41,730 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 20:43:41,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 20:43:41,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 20:43:41,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 20:43:41,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 20:43:41,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 20:43:41,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 20:43:41,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 20:43:41,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 20:43:41,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 20:43:41,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 20:43:41,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 20:43:41,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 20:43:41,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 20:43:41,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 20:43:41,735 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 -> 4dc91bf2fc8981aab63c1ee768384f1c8f580edfe4618d65089a78f799b6ddb8 [2024-11-21 20:43:41,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 20:43:41,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 20:43:41,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 20:43:41,930 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 20:43:41,930 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 20:43:41,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum.i [2024-11-21 20:43:43,271 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 20:43:43,436 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 20:43:43,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum.i [2024-11-21 20:43:43,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c97254cd/ce8f361d94234b4d8c69643422c0fb2c/FLAGfda1d0c6d [2024-11-21 20:43:43,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c97254cd/ce8f361d94234b4d8c69643422c0fb2c [2024-11-21 20:43:43,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 20:43:43,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 20:43:43,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 20:43:43,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 20:43:43,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 20:43:43,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:43:43" (1/1) ... [2024-11-21 20:43:43,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12194af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:43, skipping insertion in model container [2024-11-21 20:43:43,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:43:43" (1/1) ... [2024-11-21 20:43:43,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 20:43:43,626 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/reducercommutativity/rangesum.i[1544,1557] [2024-11-21 20:43:43,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 20:43:43,640 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 20:43:43,655 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/reducercommutativity/rangesum.i[1544,1557] [2024-11-21 20:43:43,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 20:43:43,668 INFO L204 MainTranslator]: Completed translation [2024-11-21 20:43:43,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:43 WrapperNode [2024-11-21 20:43:43,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 20:43:43,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 20:43:43,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 20:43:43,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 20:43:43,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:43" (1/1) ... [2024-11-21 20:43:43,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:43" (1/1) ... [2024-11-21 20:43:43,693 INFO L138 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2024-11-21 20:43:43,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 20:43:43,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 20:43:43,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 20:43:43,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 20:43:43,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:43" (1/1) ... [2024-11-21 20:43:43,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:43" (1/1) ... [2024-11-21 20:43:43,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:43" (1/1) ... [2024-11-21 20:43:43,715 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-21 20:43:43,715 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:43" (1/1) ... [2024-11-21 20:43:43,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:43" (1/1) ... [2024-11-21 20:43:43,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:43" (1/1) ... [2024-11-21 20:43:43,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:43" (1/1) ... [2024-11-21 20:43:43,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:43" (1/1) ... [2024-11-21 20:43:43,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:43" (1/1) ... [2024-11-21 20:43:43,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 20:43:43,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 20:43:43,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 20:43:43,727 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 20:43:43,728 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:43" (1/1) ... [2024-11-21 20:43:43,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 20:43:43,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:43,753 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-21 20:43:43,755 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-21 20:43:43,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 20:43:43,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 20:43:43,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-21 20:43:43,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-21 20:43:43,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-21 20:43:43,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-21 20:43:43,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 20:43:43,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 20:43:43,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-21 20:43:43,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-21 20:43:43,789 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2024-11-21 20:43:43,789 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2024-11-21 20:43:43,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-21 20:43:43,843 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 20:43:43,845 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 20:43:43,956 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-21 20:43:43,957 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 20:43:43,965 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 20:43:43,965 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-21 20:43:43,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:43:43 BoogieIcfgContainer [2024-11-21 20:43:43,966 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 20:43:43,967 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 20:43:43,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 20:43:43,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 20:43:43,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 08:43:43" (1/3) ... [2024-11-21 20:43:43,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40655582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:43:43, skipping insertion in model container [2024-11-21 20:43:43,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:43" (2/3) ... [2024-11-21 20:43:43,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40655582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:43:43, skipping insertion in model container [2024-11-21 20:43:43,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:43:43" (3/3) ... [2024-11-21 20:43:43,998 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum.i [2024-11-21 20:43:44,011 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 20:43:44,012 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 20:43:44,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 20:43:44,094 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;@47b9bc50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 20:43:44,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 20:43:44,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:43:44,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-21 20:43:44,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:44,103 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:44,104 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:44,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:44,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2094119026, now seen corresponding path program 1 times [2024-11-21 20:43:44,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:44,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204366489] [2024-11-21 20:43:44,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:44,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-21 20:43:44,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:44,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204366489] [2024-11-21 20:43:44,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204366489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:43:44,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:43:44,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 20:43:44,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765560085] [2024-11-21 20:43:44,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:43:44,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 20:43:44,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:44,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 20:43:44,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 20:43:44,324 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 20:43:44,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:44,339 INFO L93 Difference]: Finished difference Result 55 states and 77 transitions. [2024-11-21 20:43:44,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 20:43:44,341 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2024-11-21 20:43:44,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:44,346 INFO L225 Difference]: With dead ends: 55 [2024-11-21 20:43:44,346 INFO L226 Difference]: Without dead ends: 25 [2024-11-21 20:43:44,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 20:43:44,350 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:44,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:43:44,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-21 20:43:44,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-21 20:43:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:43:44,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-21 20:43:44,376 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 30 [2024-11-21 20:43:44,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:44,376 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-21 20:43:44,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 20:43:44,377 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-11-21 20:43:44,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-21 20:43:44,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:44,378 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:44,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 20:43:44,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:44,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:44,379 INFO L85 PathProgramCache]: Analyzing trace with hash -2142996165, now seen corresponding path program 1 times [2024-11-21 20:43:44,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:44,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082673877] [2024-11-21 20:43:44,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:44,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-21 20:43:44,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:44,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082673877] [2024-11-21 20:43:44,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082673877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:43:44,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:43:44,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 20:43:44,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498768489] [2024-11-21 20:43:44,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:43:44,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 20:43:44,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:44,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 20:43:44,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 20:43:44,574 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 20:43:44,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:44,620 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2024-11-21 20:43:44,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 20:43:44,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2024-11-21 20:43:44,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:44,625 INFO L225 Difference]: With dead ends: 47 [2024-11-21 20:43:44,626 INFO L226 Difference]: Without dead ends: 27 [2024-11-21 20:43:44,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 20:43:44,627 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 46 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-21 20:43:44,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 46 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:43:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-21 20:43:44,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-21 20:43:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:43:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-21 20:43:44,639 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 30 [2024-11-21 20:43:44,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:44,639 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-21 20:43:44,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 20:43:44,640 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-21 20:43:44,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-21 20:43:44,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:44,640 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:44,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 20:43:44,640 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:44,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:44,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1157460697, now seen corresponding path program 1 times [2024-11-21 20:43:44,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:44,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237756899] [2024-11-21 20:43:44,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:44,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:44,754 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-21 20:43:44,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:44,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237756899] [2024-11-21 20:43:44,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237756899] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:44,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228016697] [2024-11-21 20:43:44,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:44,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:44,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:44,758 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-21 20:43:44,760 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-21 20:43:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:44,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 20:43:44,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:44,851 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-21 20:43:44,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 20:43:44,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228016697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:43:44,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 20:43:44,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-21 20:43:44,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638296031] [2024-11-21 20:43:44,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:43:44,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 20:43:44,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:44,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 20:43:44,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 20:43:44,853 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 20:43:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:44,862 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2024-11-21 20:43:44,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 20:43:44,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2024-11-21 20:43:44,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:44,864 INFO L225 Difference]: With dead ends: 48 [2024-11-21 20:43:44,864 INFO L226 Difference]: Without dead ends: 30 [2024-11-21 20:43:44,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 20:43:44,865 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 57 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-21 20:43:44,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 57 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:43:44,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-21 20:43:44,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-21 20:43:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:43:44,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-21 20:43:44,872 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 32 [2024-11-21 20:43:44,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:44,873 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-21 20:43:44,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 20:43:44,873 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-21 20:43:44,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-21 20:43:44,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:44,875 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:44,888 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-21 20:43:45,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:45,080 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:45,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:45,081 INFO L85 PathProgramCache]: Analyzing trace with hash 655585368, now seen corresponding path program 1 times [2024-11-21 20:43:45,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:45,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311285237] [2024-11-21 20:43:45,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:45,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-21 20:43:45,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:45,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311285237] [2024-11-21 20:43:45,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311285237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:45,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740936038] [2024-11-21 20:43:45,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:45,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:45,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:45,184 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-21 20:43:45,185 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-21 20:43:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:45,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-21 20:43:45,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-21 20:43:45,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:43:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-21 20:43:45,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740936038] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:43:45,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:43:45,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-11-21 20:43:45,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353646791] [2024-11-21 20:43:45,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:43:45,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-21 20:43:45,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:45,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-21 20:43:45,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-21 20:43:45,383 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-21 20:43:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:45,505 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2024-11-21 20:43:45,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 20:43:45,505 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 32 [2024-11-21 20:43:45,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:45,506 INFO L225 Difference]: With dead ends: 60 [2024-11-21 20:43:45,506 INFO L226 Difference]: Without dead ends: 36 [2024-11-21 20:43:45,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-21 20:43:45,508 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:45,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 80 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:43:45,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-21 20:43:45,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-21 20:43:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:43:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-21 20:43:45,517 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 32 [2024-11-21 20:43:45,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:45,517 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-21 20:43:45,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-21 20:43:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-11-21 20:43:45,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-21 20:43:45,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:45,519 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:45,532 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-21 20:43:45,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-21 20:43:45,724 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:45,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:45,725 INFO L85 PathProgramCache]: Analyzing trace with hash -639666182, now seen corresponding path program 1 times [2024-11-21 20:43:45,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:45,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730602325] [2024-11-21 20:43:45,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:45,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-21 20:43:45,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:45,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730602325] [2024-11-21 20:43:45,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730602325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:43:45,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:43:45,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 20:43:45,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518946408] [2024-11-21 20:43:45,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:43:45,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 20:43:45,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:45,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 20:43:45,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 20:43:45,818 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-21 20:43:45,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:45,856 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2024-11-21 20:43:45,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 20:43:45,856 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), 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 43 [2024-11-21 20:43:45,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:45,857 INFO L225 Difference]: With dead ends: 55 [2024-11-21 20:43:45,857 INFO L226 Difference]: Without dead ends: 36 [2024-11-21 20:43:45,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 20:43:45,858 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:45,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:43:45,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-21 20:43:45,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-11-21 20:43:45,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:43:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-11-21 20:43:45,867 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 43 [2024-11-21 20:43:45,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:45,868 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-11-21 20:43:45,868 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), 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-21 20:43:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-11-21 20:43:45,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-21 20:43:45,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:45,870 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:45,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 20:43:45,870 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:45,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:45,871 INFO L85 PathProgramCache]: Analyzing trace with hash 121342172, now seen corresponding path program 1 times [2024-11-21 20:43:45,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:45,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333807395] [2024-11-21 20:43:45,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:45,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-21 20:43:46,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:46,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333807395] [2024-11-21 20:43:46,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333807395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:43:46,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:43:46,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-21 20:43:46,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112040332] [2024-11-21 20:43:46,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:43:46,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-21 20:43:46,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:46,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-21 20:43:46,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-21 20:43:46,075 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:43:46,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:46,143 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2024-11-21 20:43:46,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 20:43:46,144 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2024-11-21 20:43:46,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:46,145 INFO L225 Difference]: With dead ends: 59 [2024-11-21 20:43:46,145 INFO L226 Difference]: Without dead ends: 55 [2024-11-21 20:43:46,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-21 20:43:46,146 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:46,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 257 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:43:46,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-21 20:43:46,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2024-11-21 20:43:46,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 38 states have internal predecessors, (45), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-21 20:43:46,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2024-11-21 20:43:46,162 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 45 [2024-11-21 20:43:46,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:46,162 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2024-11-21 20:43:46,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:43:46,163 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2024-11-21 20:43:46,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-21 20:43:46,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:46,165 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:46,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 20:43:46,166 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:46,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:46,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1303372657, now seen corresponding path program 1 times [2024-11-21 20:43:46,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:46,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363238994] [2024-11-21 20:43:46,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:46,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-21 20:43:46,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:46,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363238994] [2024-11-21 20:43:46,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363238994] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:46,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167362873] [2024-11-21 20:43:46,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:46,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:46,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:46,294 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-21 20:43:46,295 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-21 20:43:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:46,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-21 20:43:46,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-21 20:43:46,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:43:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-21 20:43:46,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167362873] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:43:46,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:43:46,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-21 20:43:46,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157013223] [2024-11-21 20:43:46,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:43:46,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-21 20:43:46,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:46,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-21 20:43:46,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-21 20:43:46,560 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-21 20:43:46,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:46,633 INFO L93 Difference]: Finished difference Result 84 states and 120 transitions. [2024-11-21 20:43:46,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 20:43:46,634 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2024-11-21 20:43:46,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:46,634 INFO L225 Difference]: With dead ends: 84 [2024-11-21 20:43:46,635 INFO L226 Difference]: Without dead ends: 49 [2024-11-21 20:43:46,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-21 20:43:46,635 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:46,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 65 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:43:46,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-21 20:43:46,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-11-21 20:43:46,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.2) internal successors, (48), 41 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-21 20:43:46,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2024-11-21 20:43:46,642 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 48 [2024-11-21 20:43:46,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:46,642 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2024-11-21 20:43:46,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-21 20:43:46,642 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2024-11-21 20:43:46,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-21 20:43:46,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:46,643 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:46,652 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-21 20:43:46,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:46,848 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:46,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:46,849 INFO L85 PathProgramCache]: Analyzing trace with hash 729051389, now seen corresponding path program 2 times [2024-11-21 20:43:46,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:46,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509901354] [2024-11-21 20:43:46,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:43:46,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:46,875 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:43:46,876 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:43:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 69 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-21 20:43:46,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:46,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509901354] [2024-11-21 20:43:46,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509901354] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:46,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809351243] [2024-11-21 20:43:47,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:43:47,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:47,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:47,003 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 20:43:47,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-21 20:43:47,065 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:43:47,065 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:43:47,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-21 20:43:47,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 48 proven. 4 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-21 20:43:47,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:43:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 58 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-21 20:43:47,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809351243] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:43:47,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:43:47,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2024-11-21 20:43:47,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270261696] [2024-11-21 20:43:47,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:43:47,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-21 20:43:47,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:47,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-21 20:43:47,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-11-21 20:43:47,279 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-21 20:43:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:47,438 INFO L93 Difference]: Finished difference Result 130 states and 170 transitions. [2024-11-21 20:43:47,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-21 20:43:47,439 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 57 [2024-11-21 20:43:47,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:47,440 INFO L225 Difference]: With dead ends: 130 [2024-11-21 20:43:47,440 INFO L226 Difference]: Without dead ends: 71 [2024-11-21 20:43:47,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 103 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-21 20:43:47,441 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 63 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:47,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 181 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:43:47,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-21 20:43:47,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-11-21 20:43:47,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 59 states have internal predecessors, (68), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-21 20:43:47,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2024-11-21 20:43:47,449 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 57 [2024-11-21 20:43:47,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:47,450 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2024-11-21 20:43:47,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-21 20:43:47,450 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2024-11-21 20:43:47,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-21 20:43:47,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:47,451 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 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] [2024-11-21 20:43:47,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-21 20:43:47,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:47,652 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:47,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:47,652 INFO L85 PathProgramCache]: Analyzing trace with hash 619340959, now seen corresponding path program 3 times [2024-11-21 20:43:47,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:47,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908823095] [2024-11-21 20:43:47,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 20:43:47,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:47,675 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-21 20:43:47,675 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:43:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-21 20:43:47,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:47,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908823095] [2024-11-21 20:43:47,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908823095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:47,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101408665] [2024-11-21 20:43:47,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 20:43:47,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:47,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:47,778 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 20:43:47,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-21 20:43:47,832 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-21 20:43:47,832 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:43:47,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-21 20:43:47,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:47,934 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 51 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-21 20:43:47,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:43:48,053 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 51 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-21 20:43:48,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101408665] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:43:48,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:43:48,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 18 [2024-11-21 20:43:48,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450253222] [2024-11-21 20:43:48,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:43:48,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-21 20:43:48,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:48,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-21 20:43:48,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-11-21 20:43:48,055 INFO L87 Difference]: Start difference. First operand 69 states and 89 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-21 20:43:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:48,178 INFO L93 Difference]: Finished difference Result 123 states and 168 transitions. [2024-11-21 20:43:48,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 20:43:48,179 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 59 [2024-11-21 20:43:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:48,180 INFO L225 Difference]: With dead ends: 123 [2024-11-21 20:43:48,180 INFO L226 Difference]: Without dead ends: 66 [2024-11-21 20:43:48,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 105 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2024-11-21 20:43:48,181 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:48,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 97 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:43:48,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-21 20:43:48,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2024-11-21 20:43:48,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-21 20:43:48,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2024-11-21 20:43:48,186 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 59 [2024-11-21 20:43:48,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:48,187 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2024-11-21 20:43:48,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-21 20:43:48,187 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2024-11-21 20:43:48,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-21 20:43:48,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:48,188 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:48,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-21 20:43:48,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:48,389 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:48,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:48,389 INFO L85 PathProgramCache]: Analyzing trace with hash 433918235, now seen corresponding path program 1 times [2024-11-21 20:43:48,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:48,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895037981] [2024-11-21 20:43:48,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:48,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:48,503 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-21 20:43:48,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:48,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895037981] [2024-11-21 20:43:48,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895037981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:48,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875534203] [2024-11-21 20:43:48,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:48,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:48,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:48,506 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 20:43:48,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-21 20:43:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:48,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-21 20:43:48,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 80 proven. 6 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-21 20:43:48,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:43:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-21 20:43:48,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875534203] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:43:48,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:43:48,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-11-21 20:43:48,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212210750] [2024-11-21 20:43:48,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:43:48,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-21 20:43:48,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:48,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-21 20:43:48,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-21 20:43:48,686 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-21 20:43:48,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:48,762 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2024-11-21 20:43:48,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 20:43:48,763 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2024-11-21 20:43:48,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:48,763 INFO L225 Difference]: With dead ends: 78 [2024-11-21 20:43:48,763 INFO L226 Difference]: Without dead ends: 54 [2024-11-21 20:43:48,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 121 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-21 20:43:48,764 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:48,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 104 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:43:48,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-21 20:43:48,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2024-11-21 20:43:48,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 45 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-21 20:43:48,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2024-11-21 20:43:48,773 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 65 [2024-11-21 20:43:48,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:48,773 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2024-11-21 20:43:48,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-21 20:43:48,774 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2024-11-21 20:43:48,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-21 20:43:48,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:48,774 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:48,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-21 20:43:48,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:48,975 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:48,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:48,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1262430211, now seen corresponding path program 2 times [2024-11-21 20:43:48,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:48,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415297067] [2024-11-21 20:43:48,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:43:48,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:49,033 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:43:49,033 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-21 20:43:49,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1754821166] [2024-11-21 20:43:49,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:43:49,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:49,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:49,038 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 20:43:49,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-21 20:43:49,111 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:43:49,111 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-21 20:43:49,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 20:43:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 20:43:49,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 20:43:49,208 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-21 20:43:49,209 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 20:43:49,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-21 20:43:49,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:49,413 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:49,449 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 20:43:49,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 08:43:49 BoogieIcfgContainer [2024-11-21 20:43:49,451 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 20:43:49,451 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 20:43:49,451 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 20:43:49,451 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 20:43:49,452 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:43:43" (3/4) ... [2024-11-21 20:43:49,452 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-21 20:43:49,494 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 20:43:49,494 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 20:43:49,495 INFO L158 Benchmark]: Toolchain (without parser) took 6038.17ms. Allocated memory was 146.8MB in the beginning and 283.1MB in the end (delta: 136.3MB). Free memory was 77.5MB in the beginning and 148.8MB in the end (delta: -71.3MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. [2024-11-21 20:43:49,495 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 146.8MB. Free memory is still 112.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 20:43:49,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.82ms. Allocated memory is still 146.8MB. Free memory was 77.1MB in the beginning and 64.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 20:43:49,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.25ms. Allocated memory is still 146.8MB. Free memory was 64.4MB in the beginning and 62.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 20:43:49,495 INFO L158 Benchmark]: Boogie Preprocessor took 31.49ms. Allocated memory is still 146.8MB. Free memory was 62.6MB in the beginning and 60.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 20:43:49,496 INFO L158 Benchmark]: RCFGBuilder took 239.18ms. Allocated memory is still 146.8MB. Free memory was 60.3MB in the beginning and 46.0MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-21 20:43:49,496 INFO L158 Benchmark]: TraceAbstraction took 5483.40ms. Allocated memory was 146.8MB in the beginning and 283.1MB in the end (delta: 136.3MB). Free memory was 45.6MB in the beginning and 154.0MB in the end (delta: -108.4MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2024-11-21 20:43:49,496 INFO L158 Benchmark]: Witness Printer took 43.25ms. Allocated memory is still 283.1MB. Free memory was 154.0MB in the beginning and 148.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-21 20:43:49,497 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.13ms. Allocated memory is still 146.8MB. Free memory is still 112.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.82ms. Allocated memory is still 146.8MB. Free memory was 77.1MB in the beginning and 64.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.25ms. Allocated memory is still 146.8MB. Free memory was 64.4MB in the beginning and 62.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.49ms. Allocated memory is still 146.8MB. Free memory was 62.6MB in the beginning and 60.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 239.18ms. Allocated memory is still 146.8MB. Free memory was 60.3MB in the beginning and 46.0MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5483.40ms. Allocated memory was 146.8MB in the beginning and 283.1MB in the end (delta: 136.3MB). Free memory was 45.6MB in the beginning and 154.0MB in the end (delta: -108.4MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * Witness Printer took 43.25ms. Allocated memory is still 283.1MB. Free memory was 154.0MB in the beginning and 148.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 64]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L15] int N; VAL [N=0] [L43] N = __VERIFIER_nondet_int() [L44] COND TRUE N > 1 [L45] int x[N]; [L46] CALL init_nondet(x) [L17] int i; [L18] i = 0 VAL [N=3, i=0, x={3:0}] [L18] COND TRUE i < N [L19] x[i] = __VERIFIER_nondet_int() [L18] i++ VAL [N=3, i=1, x={3:0}] [L18] COND TRUE i < N [L19] x[i] = __VERIFIER_nondet_int() [L18] i++ VAL [N=3, i=2, x={3:0}] [L18] COND TRUE i < N [L19] x[i] = __VERIFIER_nondet_int() [L18] i++ VAL [N=3, i=3, x={3:0}] [L18] COND FALSE !(i < N) VAL [N=3, x={3:0}] [L46] RET init_nondet(x) [L47] int temp; [L48] int ret; [L49] int ret2; [L50] int ret5; VAL [N=3, x={3:0}] [L52] CALL, EXPR rangesum(x) VAL [N=3, \old(x)={3:0}] [L25] int i; [L26] long long ret; [L27] ret = 0 [L28] int cnt = 0; [L29] i = 0 VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L30] COND TRUE i > N/2 [L31] EXPR x[i] [L31] ret = ret + x[i] [L32] cnt = cnt + 1 VAL [N=3, \old(x)={3:0}, cnt=1, i=2, ret=2, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=1, i=3, ret=2, x={3:0}] [L29] COND FALSE !(i < N) VAL [N=3, \old(x)={3:0}, cnt=1, ret=2, x={3:0}] [L35] COND TRUE cnt !=0 [L36] return ret / cnt; VAL [N=3, \old(x)={3:0}, \result=2, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [N=3, x={3:0}] [L52] ret = rangesum(x) [L54] EXPR x[0] [L54] temp=x[0] [L54] EXPR x[1] [L54] x[0] = x[1] [L54] x[1] = temp VAL [N=3] [L55] CALL, EXPR rangesum(x) VAL [N=3, \old(x)={3:0}] [L25] int i; [L26] long long ret; [L27] ret = 0 [L28] int cnt = 0; [L29] i = 0 VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L30] COND TRUE i > N/2 [L31] EXPR x[i] [L31] ret = ret + x[i] [L32] cnt = cnt + 1 VAL [N=3, \old(x)={3:0}, cnt=1, i=2, ret=2, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=1, i=3, ret=2, x={3:0}] [L29] COND FALSE !(i < N) VAL [N=3, \old(x)={3:0}, cnt=1, ret=2, x={3:0}] [L35] COND TRUE cnt !=0 [L36] return ret / cnt; VAL [N=3, \old(x)={3:0}, \result=2, x={3:0}] [L55] RET, EXPR rangesum(x) VAL [N=3, ret=2, x={3:0}] [L55] ret2 = rangesum(x) [L56] EXPR x[0] [L56] temp=x[0] [L57] int i =0 ; VAL [N=3, i=0, ret2=2, ret=2, temp=0, x={3:0}] [L57] COND TRUE i N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L30] COND TRUE i > N/2 [L31] EXPR x[i] [L31] ret = ret + x[i] [L32] cnt = cnt + 1 VAL [N=3, \old(x)={3:0}, cnt=1, i=2, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=1, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i < N) VAL [N=3, \old(x)={3:0}, cnt=1, ret=0, x={3:0}] [L35] COND TRUE cnt !=0 [L36] return ret / cnt; VAL [N=3, \old(x)={3:0}, \result=0, x={3:0}] [L61] RET, EXPR rangesum(x) VAL [N=3, ret2=2, ret=2, x={3:0}] [L61] ret5 = rangesum(x) [L63] COND TRUE ret != ret2 || ret !=ret5 VAL [N=3, x={3:0}] [L64] reach_error() VAL [N=3, x={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 11, TraceHistogramMax: 9, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 178 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 173 mSDsluCounter, 956 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 691 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 821 IncrementalHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 265 mSDtfsCounter, 821 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 625 GetRequests, 521 SyntacticMatches, 17 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=8, InterpolantAutomatonStates: 77, 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, 10 MinimizatonAttempts, 37 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 868 NumberOfCodeBlocks, 836 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 974 ConstructedInterpolants, 0 QuantifiedInterpolants, 1946 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1102 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 21 InterpolantComputations, 5 PerfectInterpolantSequences, 1235/1454 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-21 20:43:49,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE