./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/recursified_loop-simple/recursified_nested_2.c --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 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 ../../../trunk/examples/svcomp/recursified_loop-simple/recursified_nested_2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 21:40:09,629 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 21:40:09,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 21:40:09,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 21:40:09,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 21:40:09,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 21:40:09,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 21:40:09,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 21:40:09,754 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 21:40:09,758 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 21:40:09,758 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 21:40:09,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 21:40:09,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 21:40:09,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 21:40:09,761 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 21:40:09,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 21:40:09,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 21:40:09,762 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 21:40:09,762 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 21:40:09,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 21:40:09,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 21:40:09,763 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 21:40:09,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 21:40:09,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 21:40:09,764 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 21:40:09,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 21:40:09,764 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 21:40:09,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 21:40:09,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 21:40:09,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 21:40:09,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 21:40:09,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:40:09,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 21:40:09,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 21:40:09,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 21:40:09,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 21:40:09,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 21:40:09,768 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 21:40:09,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 21:40:09,768 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 21:40:09,768 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 21:40:09,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 21:40:09,769 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 -> 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 21:40:10,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 21:40:10,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 21:40:10,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 21:40:10,090 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 21:40:10,090 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 21:40:10,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursified_loop-simple/recursified_nested_2.c [2023-11-22 21:40:11,369 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 21:40:11,553 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 21:40:11,556 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-simple/recursified_nested_2.c [2023-11-22 21:40:11,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf3590927/969e901c2b784ad4ad856edaa0459e6e/FLAG2dcc2ab2d [2023-11-22 21:40:11,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf3590927/969e901c2b784ad4ad856edaa0459e6e [2023-11-22 21:40:11,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 21:40:11,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 21:40:11,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 21:40:11,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 21:40:11,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 21:40:11,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:40:11" (1/1) ... [2023-11-22 21:40:11,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e2bae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:11, skipping insertion in model container [2023-11-22 21:40:11,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:40:11" (1/1) ... [2023-11-22 21:40:11,640 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 21:40:11,790 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2023-11-22 21:40:11,794 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:40:11,801 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 21:40:11,814 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2023-11-22 21:40:11,815 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:40:11,826 INFO L206 MainTranslator]: Completed translation [2023-11-22 21:40:11,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:11 WrapperNode [2023-11-22 21:40:11,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 21:40:11,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 21:40:11,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 21:40:11,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 21:40:11,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:11" (1/1) ... [2023-11-22 21:40:11,840 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:11" (1/1) ... [2023-11-22 21:40:11,853 INFO L138 Inliner]: procedures = 13, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2023-11-22 21:40:11,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 21:40:11,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 21:40:11,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 21:40:11,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 21:40:11,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:11" (1/1) ... [2023-11-22 21:40:11,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:11" (1/1) ... [2023-11-22 21:40:11,872 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:11" (1/1) ... [2023-11-22 21:40:11,882 INFO L189 HeapSplitter]: Split 14 memory accesses to 3 slices as follows [2, 6, 6] [2023-11-22 21:40:11,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:11" (1/1) ... [2023-11-22 21:40:11,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:11" (1/1) ... [2023-11-22 21:40:11,886 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:11" (1/1) ... [2023-11-22 21:40:11,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:11" (1/1) ... [2023-11-22 21:40:11,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:11" (1/1) ... [2023-11-22 21:40:11,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:11" (1/1) ... [2023-11-22 21:40:11,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 21:40:11,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 21:40:11,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 21:40:11,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 21:40:11,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:11" (1/1) ... [2023-11-22 21:40:11,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:40:11,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:40:11,921 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 21:40:11,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 21:40:11,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 21:40:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 21:40:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-22 21:40:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-22 21:40:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 21:40:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-22 21:40:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-22 21:40:11,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-22 21:40:11,984 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2023-11-22 21:40:11,985 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2023-11-22 21:40:11,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 21:40:11,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 21:40:11,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-22 21:40:11,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-22 21:40:11,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-22 21:40:11,985 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2023-11-22 21:40:11,986 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2023-11-22 21:40:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 21:40:12,057 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 21:40:12,059 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 21:40:12,202 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 21:40:12,222 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 21:40:12,222 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-22 21:40:12,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:40:12 BoogieIcfgContainer [2023-11-22 21:40:12,223 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 21:40:12,225 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 21:40:12,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 21:40:12,228 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 21:40:12,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:40:11" (1/3) ... [2023-11-22 21:40:12,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d10343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:40:12, skipping insertion in model container [2023-11-22 21:40:12,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:40:11" (2/3) ... [2023-11-22 21:40:12,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d10343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:40:12, skipping insertion in model container [2023-11-22 21:40:12,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:40:12" (3/3) ... [2023-11-22 21:40:12,232 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2023-11-22 21:40:12,248 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 21:40:12,249 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 21:40:12,293 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 21:40:12,298 INFO L357 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, mHoare=true, 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;@57093de3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 21:40:12,299 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 21:40:12,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 21:40:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-22 21:40:12,308 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:40:12,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:40:12,309 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:40:12,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:40:12,314 INFO L85 PathProgramCache]: Analyzing trace with hash 855928239, now seen corresponding path program 1 times [2023-11-22 21:40:12,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:40:12,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032727488] [2023-11-22 21:40:12,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:40:12,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:40:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:12,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:40:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:40:12,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:40:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032727488] [2023-11-22 21:40:12,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032727488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:40:12,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:40:12,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 21:40:12,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138067068] [2023-11-22 21:40:12,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:40:12,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:40:12,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:40:12,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:40:12,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:40:12,855 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 21:40:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:40:12,980 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2023-11-22 21:40:12,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:40:12,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-11-22 21:40:12,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:40:12,993 INFO L225 Difference]: With dead ends: 32 [2023-11-22 21:40:12,993 INFO L226 Difference]: Without dead ends: 23 [2023-11-22 21:40:12,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-22 21:40:12,998 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:40:12,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 61 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:40:13,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-22 21:40:13,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2023-11-22 21:40:13,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-22 21:40:13,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-11-22 21:40:13,031 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10 [2023-11-22 21:40:13,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:40:13,031 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-11-22 21:40:13,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 21:40:13,032 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-11-22 21:40:13,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-22 21:40:13,033 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:40:13,033 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:40:13,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 21:40:13,034 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:40:13,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:40:13,035 INFO L85 PathProgramCache]: Analyzing trace with hash 255373073, now seen corresponding path program 1 times [2023-11-22 21:40:13,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:40:13,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147076942] [2023-11-22 21:40:13,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:40:13,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:40:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:13,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:40:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:13,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:40:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:13,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 21:40:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-22 21:40:13,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:40:13,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147076942] [2023-11-22 21:40:13,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147076942] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:40:13,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:40:13,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:40:13,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520765142] [2023-11-22 21:40:13,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:40:13,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:40:13,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:40:13,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:40:13,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:40:13,324 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 21:40:13,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:40:13,416 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2023-11-22 21:40:13,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:40:13,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 21 [2023-11-22 21:40:13,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:40:13,418 INFO L225 Difference]: With dead ends: 42 [2023-11-22 21:40:13,418 INFO L226 Difference]: Without dead ends: 23 [2023-11-22 21:40:13,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-22 21:40:13,422 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:40:13,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 59 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:40:13,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-22 21:40:13,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-22 21:40:13,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-22 21:40:13,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-11-22 21:40:13,435 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 21 [2023-11-22 21:40:13,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:40:13,435 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-11-22 21:40:13,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 21:40:13,436 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-11-22 21:40:13,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-22 21:40:13,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:40:13,438 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:40:13,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 21:40:13,439 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:40:13,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:40:13,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1037516303, now seen corresponding path program 1 times [2023-11-22 21:40:13,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:40:13,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954439745] [2023-11-22 21:40:13,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:40:13,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:40:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:13,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:40:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:13,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:40:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:13,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:40:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:14,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 21:40:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:14,058 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 21:40:14,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:40:14,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954439745] [2023-11-22 21:40:14,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954439745] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:40:14,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207734115] [2023-11-22 21:40:14,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:40:14,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:40:14,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:40:14,072 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) [2023-11-22 21:40:14,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 21:40:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:14,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-22 21:40:14,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:40:14,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-22 21:40:14,479 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:40:14,479 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:40:15,045 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-22 21:40:15,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2023-11-22 21:40:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:40:19,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207734115] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:40:19,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 21:40:19,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 28 [2023-11-22 21:40:19,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005903502] [2023-11-22 21:40:19,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 21:40:19,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-22 21:40:19,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:40:19,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-22 21:40:19,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=673, Unknown=2, NotChecked=0, Total=756 [2023-11-22 21:40:19,451 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 28 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 26 states have internal predecessors, (45), 10 states have call successors, (11), 5 states have call predecessors, (11), 10 states have return successors, (11), 6 states have call predecessors, (11), 10 states have call successors, (11) [2023-11-22 21:40:19,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:40:19,994 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2023-11-22 21:40:19,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-22 21:40:19,997 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 26 states have internal predecessors, (45), 10 states have call successors, (11), 5 states have call predecessors, (11), 10 states have return successors, (11), 6 states have call predecessors, (11), 10 states have call successors, (11) Word has length 26 [2023-11-22 21:40:19,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:40:19,997 INFO L225 Difference]: With dead ends: 47 [2023-11-22 21:40:19,997 INFO L226 Difference]: Without dead ends: 25 [2023-11-22 21:40:19,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=165, Invalid=1315, Unknown=2, NotChecked=0, Total=1482 [2023-11-22 21:40:19,999 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 21:40:19,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 152 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 21:40:20,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-22 21:40:20,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-22 21:40:20,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-22 21:40:20,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-11-22 21:40:20,008 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 26 [2023-11-22 21:40:20,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:40:20,009 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-11-22 21:40:20,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 26 states have internal predecessors, (45), 10 states have call successors, (11), 5 states have call predecessors, (11), 10 states have return successors, (11), 6 states have call predecessors, (11), 10 states have call successors, (11) [2023-11-22 21:40:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-11-22 21:40:20,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-22 21:40:20,011 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:40:20,011 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:40:20,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-22 21:40:20,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:40:20,231 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:40:20,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:40:20,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1404341341, now seen corresponding path program 1 times [2023-11-22 21:40:20,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:40:20,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774593906] [2023-11-22 21:40:20,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:40:20,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:40:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:20,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:40:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:20,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:40:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:20,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:40:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:20,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:40:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:20,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 21:40:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-22 21:40:20,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:40:20,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774593906] [2023-11-22 21:40:20,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774593906] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:40:20,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916113072] [2023-11-22 21:40:20,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:40:20,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:40:20,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:40:20,792 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) [2023-11-22 21:40:20,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 21:40:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:20,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-22 21:40:20,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:40:20,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 21:40:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-22 21:40:21,069 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:40:21,748 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-22 21:40:21,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916113072] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:40:21,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 21:40:21,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 14] total 27 [2023-11-22 21:40:21,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821682605] [2023-11-22 21:40:21,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 21:40:21,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-22 21:40:21,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:40:21,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-22 21:40:21,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2023-11-22 21:40:21,751 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 27 states, 20 states have (on average 1.8) internal successors, (36), 22 states have internal predecessors, (36), 9 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (13), 5 states have call predecessors, (13), 9 states have call successors, (13) [2023-11-22 21:40:21,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:40:21,914 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2023-11-22 21:40:21,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 21:40:21,915 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 20 states have (on average 1.8) internal successors, (36), 22 states have internal predecessors, (36), 9 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (13), 5 states have call predecessors, (13), 9 states have call successors, (13) Word has length 31 [2023-11-22 21:40:21,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:40:21,915 INFO L225 Difference]: With dead ends: 50 [2023-11-22 21:40:21,916 INFO L226 Difference]: Without dead ends: 27 [2023-11-22 21:40:21,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=736, Unknown=0, NotChecked=0, Total=930 [2023-11-22 21:40:21,917 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:40:21,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 160 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:40:21,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-22 21:40:21,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-22 21:40:21,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-22 21:40:21,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-11-22 21:40:21,923 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 31 [2023-11-22 21:40:21,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:40:21,923 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-11-22 21:40:21,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 20 states have (on average 1.8) internal successors, (36), 22 states have internal predecessors, (36), 9 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (13), 5 states have call predecessors, (13), 9 states have call successors, (13) [2023-11-22 21:40:21,924 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-11-22 21:40:21,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-22 21:40:21,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:40:21,925 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:40:21,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-22 21:40:22,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-11-22 21:40:22,140 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:40:22,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:40:22,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1141740675, now seen corresponding path program 2 times [2023-11-22 21:40:22,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:40:22,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560879291] [2023-11-22 21:40:22,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:40:22,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:40:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:22,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:40:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:22,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:40:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:22,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:40:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:22,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:40:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:22,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:40:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:22,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-22 21:40:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:22,897 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-22 21:40:22,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:40:22,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560879291] [2023-11-22 21:40:22,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560879291] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:40:22,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042978929] [2023-11-22 21:40:22,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 21:40:22,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:40:22,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:40:22,900 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) [2023-11-22 21:40:22,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-22 21:40:23,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 21:40:23,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 21:40:23,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-22 21:40:23,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:40:23,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 21:40:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-22 21:40:23,198 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:40:23,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042978929] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:40:23,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:40:23,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2023-11-22 21:40:23,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458826721] [2023-11-22 21:40:23,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 21:40:23,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-22 21:40:23,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:40:23,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-22 21:40:23,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2023-11-22 21:40:23,675 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 18 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 17 states have internal predecessors, (31), 8 states have call successors, (8), 2 states have call predecessors, (8), 9 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2023-11-22 21:40:23,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:40:23,960 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2023-11-22 21:40:23,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-22 21:40:23,961 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 17 states have internal predecessors, (31), 8 states have call successors, (8), 2 states have call predecessors, (8), 9 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) Word has length 36 [2023-11-22 21:40:23,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:40:23,962 INFO L225 Difference]: With dead ends: 56 [2023-11-22 21:40:23,962 INFO L226 Difference]: Without dead ends: 31 [2023-11-22 21:40:23,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2023-11-22 21:40:23,963 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 86 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 [2023-11-22 21:40:23,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 86 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:40:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-22 21:40:23,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-22 21:40:23,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 8 states have return successors, (10), 8 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-22 21:40:23,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2023-11-22 21:40:23,970 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 36 [2023-11-22 21:40:23,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:40:23,970 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2023-11-22 21:40:23,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 17 states have internal predecessors, (31), 8 states have call successors, (8), 2 states have call predecessors, (8), 9 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2023-11-22 21:40:23,970 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2023-11-22 21:40:23,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-22 21:40:23,972 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:40:23,972 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:40:23,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-22 21:40:24,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:40:24,190 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:40:24,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:40:24,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1958163257, now seen corresponding path program 3 times [2023-11-22 21:40:24,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:40:24,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47533240] [2023-11-22 21:40:24,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:40:24,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:40:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:24,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:40:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:25,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:40:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:25,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:40:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:25,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:40:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:25,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:40:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:25,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:40:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:25,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 21:40:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:25,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:40:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:25,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:40:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:25,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:40:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:25,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:40:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:25,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:40:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:25,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 21:40:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:40:25,618 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 4 proven. 118 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2023-11-22 21:40:25,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:40:25,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47533240] [2023-11-22 21:40:25,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47533240] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:40:25,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736559156] [2023-11-22 21:40:25,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 21:40:25,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:40:25,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:40:25,620 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) [2023-11-22 21:40:25,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-22 21:40:25,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-22 21:40:25,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 21:40:25,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-22 21:40:25,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:40:25,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-22 21:40:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 122 proven. 6 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2023-11-22 21:40:26,040 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:40:26,551 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-22 21:40:26,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2023-11-22 21:40:26,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736559156] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:40:26,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:40:26,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2023-11-22 21:40:26,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317744423] [2023-11-22 21:40:26,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 21:40:26,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-22 21:40:26,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:40:26,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-22 21:40:26,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2023-11-22 21:40:26,875 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 23 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 21 states have internal predecessors, (44), 9 states have call successors, (14), 3 states have call predecessors, (14), 10 states have return successors, (16), 11 states have call predecessors, (16), 9 states have call successors, (16) [2023-11-22 21:40:27,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:40:27,268 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2023-11-22 21:40:27,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-22 21:40:27,269 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 21 states have internal predecessors, (44), 9 states have call successors, (14), 3 states have call predecessors, (14), 10 states have return successors, (16), 11 states have call predecessors, (16), 9 states have call successors, (16) Word has length 72 [2023-11-22 21:40:27,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:40:27,269 INFO L225 Difference]: With dead ends: 59 [2023-11-22 21:40:27,269 INFO L226 Difference]: Without dead ends: 0 [2023-11-22 21:40:27,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=1517, Unknown=0, NotChecked=0, Total=1722 [2023-11-22 21:40:27,272 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 15 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 21:40:27,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 59 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 21:40:27,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-22 21:40:27,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-22 21:40:27,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:40:27,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-22 21:40:27,274 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2023-11-22 21:40:27,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:40:27,274 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-22 21:40:27,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 21 states have internal predecessors, (44), 9 states have call successors, (14), 3 states have call predecessors, (14), 10 states have return successors, (16), 11 states have call predecessors, (16), 9 states have call successors, (16) [2023-11-22 21:40:27,274 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-22 21:40:27,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-22 21:40:27,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 21:40:27,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-22 21:40:27,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:40:27,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-22 21:40:27,591 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (or (not (= (select (select |old(#memory_int#2)| |func_to_recursive_line_20_to_21_0_#in~b.base|) |func_to_recursive_line_20_to_21_0_#in~b.offset|) 6)) (let ((.cse1 (select (select |#memory_int#2| |func_to_recursive_line_21_to_21_0_#in~b.base|) |func_to_recursive_line_21_to_21_0_#in~b.offset|)) (.cse0 (select (select |old(#memory_int#2)| |func_to_recursive_line_21_to_21_0_#in~b.base|) |func_to_recursive_line_21_to_21_0_#in~b.offset|))) (and (= func_to_recursive_line_20_to_21_0_~a.base |func_to_recursive_line_20_to_21_0_#in~a.base|) (or (< 4 .cse0) (< .cse1 5)) (<= (select (select |#memory_int#1| func_to_recursive_line_20_to_21_0_~a.base) func_to_recursive_line_20_to_21_0_~a.offset) 5) (= |func_to_recursive_line_20_to_21_0_#in~a.offset| func_to_recursive_line_20_to_21_0_~a.offset) (or (< 3 .cse0) (< .cse1 4)) (= (select (select |#memory_int#2| func_to_recursive_line_20_to_21_0_~b.base) func_to_recursive_line_20_to_21_0_~b.offset) 0) (= |#memory_int#1| |old(#memory_int#1)|) (= |func_to_recursive_line_20_to_21_0_#in~b.offset| func_to_recursive_line_20_to_21_0_~b.offset) (= func_to_recursive_line_20_to_21_0_~b.base |func_to_recursive_line_20_to_21_0_#in~b.base|) (or (< .cse1 6) (< 5 .cse0))))) [2023-11-22 21:40:27,591 INFO L899 garLoopResultBuilder]: For program point L47-1(line 47) no Hoare annotation was computed. [2023-11-22 21:40:27,591 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 39 57) the Hoare annotation is: (or (not (= (select (select |old(#memory_int#2)| |func_to_recursive_line_20_to_21_0_#in~b.base|) |func_to_recursive_line_20_to_21_0_#in~b.offset|) 6)) (and (= |#memory_int#0| |old(#memory_int#0)|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_int#1| |old(#memory_int#1)|))) [2023-11-22 21:40:27,591 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 56) no Hoare annotation was computed. [2023-11-22 21:40:27,592 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 39 57) no Hoare annotation was computed. [2023-11-22 21:40:27,592 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (or (not (= (select (select |old(#memory_int#2)| |func_to_recursive_line_20_to_21_0_#in~b.base|) |func_to_recursive_line_20_to_21_0_#in~b.offset|) 6)) (let ((.cse1 (select |old(#memory_int#1)| func_to_recursive_line_20_to_21_0_~a.base)) (.cse0 (select (select |#memory_int#1| func_to_recursive_line_20_to_21_0_~a.base) func_to_recursive_line_20_to_21_0_~a.offset))) (and (= func_to_recursive_line_20_to_21_0_~a.base |func_to_recursive_line_20_to_21_0_#in~a.base|) (= |func_to_recursive_line_20_to_21_0_#in~a.offset| func_to_recursive_line_20_to_21_0_~a.offset) (<= .cse0 (+ (select .cse1 func_to_recursive_line_20_to_21_0_~a.offset) 1)) (= |#memory_int#1| (store |old(#memory_int#1)| func_to_recursive_line_20_to_21_0_~a.base (store .cse1 func_to_recursive_line_20_to_21_0_~a.offset .cse0))) (= |func_to_recursive_line_20_to_21_0_#in~b.offset| func_to_recursive_line_20_to_21_0_~b.offset) (<= .cse0 6) (= (select (select |#memory_int#2| |func_to_recursive_line_20_to_21_0_#in~b.base|) |func_to_recursive_line_20_to_21_0_#in~b.offset|) 6) (= func_to_recursive_line_20_to_21_0_~b.base |func_to_recursive_line_20_to_21_0_#in~b.base|)))) [2023-11-22 21:40:27,592 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_20_to_21_0EXIT(lines 39 57) no Hoare annotation was computed. [2023-11-22 21:40:27,592 INFO L895 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: (and (= (select (select |#memory_int#1| |ULTIMATE.start_main_~#a~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (= (select (select |#memory_int#2| |ULTIMATE.start_main_~#b~0#1.base|) 0) 6)) [2023-11-22 21:40:27,592 INFO L899 garLoopResultBuilder]: For program point L67-2(lines 67 73) no Hoare annotation was computed. [2023-11-22 21:40:27,592 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-22 21:40:27,592 INFO L899 garLoopResultBuilder]: For program point L65-1(line 65) no Hoare annotation was computed. [2023-11-22 21:40:27,593 INFO L899 garLoopResultBuilder]: For program point L67-4(lines 67 73) no Hoare annotation was computed. [2023-11-22 21:40:27,593 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 69) no Hoare annotation was computed. [2023-11-22 21:40:27,593 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-22 21:40:27,593 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2023-11-22 21:40:27,593 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-11-22 21:40:27,593 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (and (<= (select (select |#memory_int#2| func_to_recursive_line_21_to_21_0_~b.base) func_to_recursive_line_21_to_21_0_~b.offset) 6) (= |func_to_recursive_line_21_to_21_0_#in~b.offset| func_to_recursive_line_21_to_21_0_~b.offset) (= |#memory_int#1| |old(#memory_int#1)|) (= func_to_recursive_line_21_to_21_0_~b.base |func_to_recursive_line_21_to_21_0_#in~b.base|) (= |#memory_int#2| (store |old(#memory_int#2)| func_to_recursive_line_21_to_21_0_~b.base (let ((.cse0 (select |old(#memory_int#2)| func_to_recursive_line_21_to_21_0_~b.base))) (store .cse0 func_to_recursive_line_21_to_21_0_~b.offset (+ (select .cse0 func_to_recursive_line_21_to_21_0_~b.offset) 1)))))) [2023-11-22 21:40:27,594 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_21_to_21_0EXIT(lines 23 37) no Hoare annotation was computed. [2023-11-22 21:40:27,594 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 23 37) the Hoare annotation is: (and (= |#memory_int#0| |old(#memory_int#0)|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_int#1| |old(#memory_int#1)|)) [2023-11-22 21:40:27,594 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 36) no Hoare annotation was computed. [2023-11-22 21:40:27,594 INFO L899 garLoopResultBuilder]: For program point L25-1(lines 23 37) no Hoare annotation was computed. [2023-11-22 21:40:27,597 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2023-11-22 21:40:27,599 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 21:40:27,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:40:27 BoogieIcfgContainer [2023-11-22 21:40:27,602 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 21:40:27,603 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 21:40:27,603 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 21:40:27,603 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 21:40:27,603 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:40:12" (3/4) ... [2023-11-22 21:40:27,605 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-22 21:40:27,608 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_21_0 [2023-11-22 21:40:27,608 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_21_to_21_0 [2023-11-22 21:40:27,612 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-22 21:40:27,612 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-22 21:40:27,613 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-22 21:40:27,613 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-22 21:40:27,693 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-22 21:40:27,694 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-22 21:40:27,694 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 21:40:27,694 INFO L158 Benchmark]: Toolchain (without parser) took 16101.77ms. Allocated memory was 165.7MB in the beginning and 249.6MB in the end (delta: 83.9MB). Free memory was 138.2MB in the beginning and 108.9MB in the end (delta: 29.3MB). Peak memory consumption was 113.2MB. Max. memory is 16.1GB. [2023-11-22 21:40:27,695 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 165.7MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 21:40:27,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.22ms. Allocated memory is still 165.7MB. Free memory was 138.2MB in the beginning and 128.2MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-22 21:40:27,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.99ms. Allocated memory is still 165.7MB. Free memory was 128.2MB in the beginning and 126.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 21:40:27,695 INFO L158 Benchmark]: Boogie Preprocessor took 36.78ms. Allocated memory is still 165.7MB. Free memory was 126.1MB in the beginning and 124.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 21:40:27,696 INFO L158 Benchmark]: RCFGBuilder took 331.04ms. Allocated memory is still 165.7MB. Free memory was 124.8MB in the beginning and 111.5MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-22 21:40:27,696 INFO L158 Benchmark]: TraceAbstraction took 15377.62ms. Allocated memory was 165.7MB in the beginning and 249.6MB in the end (delta: 83.9MB). Free memory was 110.9MB in the beginning and 114.1MB in the end (delta: -3.2MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. [2023-11-22 21:40:27,696 INFO L158 Benchmark]: Witness Printer took 91.05ms. Allocated memory is still 249.6MB. Free memory was 114.1MB in the beginning and 108.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-22 21:40:27,698 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.19ms. Allocated memory is still 165.7MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.22ms. Allocated memory is still 165.7MB. Free memory was 138.2MB in the beginning and 128.2MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.99ms. Allocated memory is still 165.7MB. Free memory was 128.2MB in the beginning and 126.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.78ms. Allocated memory is still 165.7MB. Free memory was 126.1MB in the beginning and 124.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 331.04ms. Allocated memory is still 165.7MB. Free memory was 124.8MB in the beginning and 111.5MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15377.62ms. Allocated memory was 165.7MB in the beginning and 249.6MB in the end (delta: 83.9MB). Free memory was 110.9MB in the beginning and 114.1MB in the end (delta: -3.2MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. * Witness Printer took 91.05ms. Allocated memory is still 249.6MB. Free memory was 114.1MB in the beginning and 108.9MB 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 - PositiveResult [Line: 69]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 577 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 496 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 944 IncrementalHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 81 mSDtfsCounter, 944 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 407 GetRequests, 252 SyntacticMatches, 3 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=5, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 46 PreInvPairs, 48 NumberOfFragments, 232 HoareAnnotationTreeSize, 46 FomulaSimplifications, 14 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 53 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 361 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 406 ConstructedInterpolants, 8 QuantifiedInterpolants, 2550 SizeOfPredicates, 33 NumberOfNonLiveVariables, 908 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 401/587 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-22 21:40:27,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE