./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-b.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 c117c02695ddb101583ad96117955e242a853299846ac846441a25e3775ce242 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:22:49,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:22:49,331 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:22:49,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:22:49,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:22:49,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:22:49,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:22:49,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:22:49,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:22:49,361 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:22:49,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:22:49,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:22:49,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:22:49,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:22:49,363 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:22:49,363 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:22:49,363 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:22:49,364 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:22:49,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:22:49,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:22:49,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:22:49,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:22:49,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:22:49,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:22:49,365 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:22:49,366 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:22:49,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:22:49,366 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:22:49,366 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:22:49,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:22:49,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:22:49,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:22:49,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:22:49,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:22:49,370 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:22:49,370 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:22:49,370 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:22:49,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:22:49,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:22:49,371 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:22:49,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:22:49,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:22:49,375 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 -> c117c02695ddb101583ad96117955e242a853299846ac846441a25e3775ce242 [2024-11-08 15:22:49,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:22:49,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:22:49,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:22:49,606 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:22:49,606 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:22:49,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-b.c [2024-11-08 15:22:50,898 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:22:51,030 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:22:51,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-b.c [2024-11-08 15:22:51,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be015f899/565cea79fade4e5bad12eed452994cf9/FLAG3c9b9f2b8 [2024-11-08 15:22:51,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be015f899/565cea79fade4e5bad12eed452994cf9 [2024-11-08 15:22:51,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:22:51,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:22:51,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:22:51,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:22:51,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:22:51,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:22:51" (1/1) ... [2024-11-08 15:22:51,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d41d695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:51, skipping insertion in model container [2024-11-08 15:22:51,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:22:51" (1/1) ... [2024-11-08 15:22:51,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:22:51,669 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-b.c[1476,1489] [2024-11-08 15:22:51,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-b.c[1549,1562] [2024-11-08 15:22:51,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:22:51,679 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:22:51,691 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-b.c[1476,1489] [2024-11-08 15:22:51,692 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-b.c[1549,1562] [2024-11-08 15:22:51,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:22:51,718 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:22:51,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:51 WrapperNode [2024-11-08 15:22:51,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:22:51,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:22:51,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:22:51,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:22:51,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:51" (1/1) ... [2024-11-08 15:22:51,735 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:51" (1/1) ... [2024-11-08 15:22:51,756 INFO L138 Inliner]: procedures = 13, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 79 [2024-11-08 15:22:51,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:22:51,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:22:51,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:22:51,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:22:51,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:51" (1/1) ... [2024-11-08 15:22:51,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:51" (1/1) ... [2024-11-08 15:22:51,774 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:51" (1/1) ... [2024-11-08 15:22:51,783 INFO L175 MemorySlicer]: Split 18 memory accesses to 5 slices as follows [2, 4, 5, 3, 4]. 28 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 1, 1]. The 3 writes are split as follows [0, 1, 1, 0, 1]. [2024-11-08 15:22:51,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:51" (1/1) ... [2024-11-08 15:22:51,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:51" (1/1) ... [2024-11-08 15:22:51,788 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:51" (1/1) ... [2024-11-08 15:22:51,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:51" (1/1) ... [2024-11-08 15:22:51,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:51" (1/1) ... [2024-11-08 15:22:51,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:51" (1/1) ... [2024-11-08 15:22:51,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:22:51,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:22:51,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:22:51,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:22:51,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:51" (1/1) ... [2024-11-08 15:22:51,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:22:51,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:22:51,827 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:22:51,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:22:51,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:22:51,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:22:51,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 15:22:51,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 15:22:51,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 15:22:51,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 15:22:51,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 15:22:51,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 15:22:51,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 15:22:51,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 15:22:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 15:22:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 15:22:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:22:51,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:22:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 15:22:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 15:22:51,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 15:22:51,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 15:22:51,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 15:22:51,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 15:22:51,886 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_12_to_15_0 [2024-11-08 15:22:51,886 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_12_to_15_0 [2024-11-08 15:22:51,951 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:22:51,953 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:22:52,070 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-08 15:22:52,070 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:22:52,084 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:22:52,086 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:22:52,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:22:52 BoogieIcfgContainer [2024-11-08 15:22:52,086 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:22:52,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:22:52,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:22:52,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:22:52,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:22:51" (1/3) ... [2024-11-08 15:22:52,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7a60a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:22:52, skipping insertion in model container [2024-11-08 15:22:52,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:51" (2/3) ... [2024-11-08 15:22:52,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7a60a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:22:52, skipping insertion in model container [2024-11-08 15:22:52,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:22:52" (3/3) ... [2024-11-08 15:22:52,095 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_linear-inequality-inv-b.c [2024-11-08 15:22:52,108 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:22:52,108 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 15:22:52,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:22:52,154 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5dfecf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:22:52,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-08 15:22:52,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:22:52,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 15:22:52,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:22:52,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:22:52,164 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:22:52,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:22:52,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1751398402, now seen corresponding path program 1 times [2024-11-08 15:22:52,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:22:52,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183310371] [2024-11-08 15:22:52,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:22:52,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:22:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:52,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:22:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:22:52,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:22:52,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183310371] [2024-11-08 15:22:52,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183310371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:22:52,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:22:52,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:22:52,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274312885] [2024-11-08 15:22:52,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:22:52,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:22:52,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:22:52,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:22:52,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:22:52,620 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:22:52,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:22:52,682 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-11-08 15:22:52,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:22:52,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2024-11-08 15:22:52,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:22:52,690 INFO L225 Difference]: With dead ends: 28 [2024-11-08 15:22:52,690 INFO L226 Difference]: Without dead ends: 15 [2024-11-08 15:22:52,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:22:52,694 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:22:52,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 42 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:22:52,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-08 15:22:52,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-08 15:22:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:22:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-08 15:22:52,720 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2024-11-08 15:22:52,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:22:52,721 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-08 15:22:52,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:22:52,721 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-08 15:22:52,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 15:22:52,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:22:52,722 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:22:52,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:22:52,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:22:52,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:22:52,723 INFO L85 PathProgramCache]: Analyzing trace with hash -929951269, now seen corresponding path program 1 times [2024-11-08 15:22:52,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:22:52,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471587191] [2024-11-08 15:22:52,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:22:52,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:22:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:53,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:22:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:53,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:22:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:22:53,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:22:53,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471587191] [2024-11-08 15:22:53,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471587191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:22:53,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187633142] [2024-11-08 15:22:53,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:22:53,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:22:53,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:22:53,648 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:22:53,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 15:22:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:53,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-08 15:22:53,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:22:53,853 WARN L873 $PredicateComparison]: unable to prove that (exists ((func_to_recursive_line_12_to_15_0_~v.offset Int)) (let ((.cse1 (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) func_to_recursive_line_12_to_15_0_~v.offset))) (and (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (mod .cse1 256) (mod (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) 256))))) |c_#memory_int#2|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int#1)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) func_to_recursive_line_12_to_15_0_~v.offset .cse1)))))) is different from true [2024-11-08 15:22:53,914 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 17 [2024-11-08 15:22:53,931 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-08 15:22:53,931 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 1 case distinctions, treesize of input 23 treesize of output 15 [2024-11-08 15:22:53,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 15:22:53,998 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 43 treesize of output 35 [2024-11-08 15:22:54,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-08 15:22:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-08 15:22:54,053 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:22:54,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187633142] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:22:54,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 15:22:54,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2024-11-08 15:22:54,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503917815] [2024-11-08 15:22:54,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 15:22:54,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 15:22:54,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:22:54,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 15:22:54,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=199, Unknown=1, NotChecked=28, Total=272 [2024-11-08 15:22:54,444 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 15 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 15:22:54,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:22:54,685 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-11-08 15:22:54,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 15:22:54,685 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 16 [2024-11-08 15:22:54,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:22:54,686 INFO L225 Difference]: With dead ends: 25 [2024-11-08 15:22:54,686 INFO L226 Difference]: Without dead ends: 19 [2024-11-08 15:22:54,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=348, Unknown=1, NotChecked=38, Total=462 [2024-11-08 15:22:54,688 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:22:54,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 51 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 20 Unchecked, 0.1s Time] [2024-11-08 15:22:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-08 15:22:54,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-08 15:22:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 15:22:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2024-11-08 15:22:54,695 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2024-11-08 15:22:54,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:22:54,695 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-11-08 15:22:54,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 15:22:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2024-11-08 15:22:54,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 15:22:54,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:22:54,696 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:22:54,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 15:22:54,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:22:54,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:22:54,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:22:54,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1779672294, now seen corresponding path program 2 times [2024-11-08 15:22:54,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:22:54,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949232709] [2024-11-08 15:22:54,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:22:54,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:22:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:22:54,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 15:22:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:22:54,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 15:22:54,970 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 15:22:54,971 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-08 15:22:54,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-08 15:22:54,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:22:54,975 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-11-08 15:22:55,009 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:22:55,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:22:55 BoogieIcfgContainer [2024-11-08 15:22:55,016 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:22:55,017 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:22:55,017 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:22:55,017 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:22:55,017 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:22:52" (3/4) ... [2024-11-08 15:22:55,018 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 15:22:55,063 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:22:55,063 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:22:55,063 INFO L158 Benchmark]: Toolchain (without parser) took 3592.26ms. Allocated memory was 138.4MB in the beginning and 220.2MB in the end (delta: 81.8MB). Free memory was 68.5MB in the beginning and 132.0MB in the end (delta: -63.5MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-11-08 15:22:55,064 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 138.4MB. Free memory is still 101.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:22:55,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.32ms. Allocated memory was 138.4MB in the beginning and 182.5MB in the end (delta: 44.0MB). Free memory was 68.3MB in the beginning and 153.5MB in the end (delta: -85.2MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-11-08 15:22:55,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.08ms. Allocated memory is still 182.5MB. Free memory was 153.4MB in the beginning and 151.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:22:55,064 INFO L158 Benchmark]: Boogie Preprocessor took 35.45ms. Allocated memory is still 182.5MB. Free memory was 151.8MB in the beginning and 151.8MB in the end (delta: -5.5kB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2024-11-08 15:22:55,065 INFO L158 Benchmark]: RCFGBuilder took 293.69ms. Allocated memory is still 182.5MB. Free memory was 151.8MB in the beginning and 137.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 15:22:55,065 INFO L158 Benchmark]: TraceAbstraction took 2927.05ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 136.2MB in the beginning and 134.1MB in the end (delta: 2.1MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2024-11-08 15:22:55,065 INFO L158 Benchmark]: Witness Printer took 46.24ms. Allocated memory is still 220.2MB. Free memory was 134.1MB in the beginning and 132.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:22:55,067 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.17ms. Allocated memory is still 138.4MB. Free memory is still 101.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.32ms. Allocated memory was 138.4MB in the beginning and 182.5MB in the end (delta: 44.0MB). Free memory was 68.3MB in the beginning and 153.5MB in the end (delta: -85.2MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.08ms. Allocated memory is still 182.5MB. Free memory was 153.4MB in the beginning and 151.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.45ms. Allocated memory is still 182.5MB. Free memory was 151.8MB in the beginning and 151.8MB in the end (delta: -5.5kB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * RCFGBuilder took 293.69ms. Allocated memory is still 182.5MB. Free memory was 151.8MB in the beginning and 137.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2927.05ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 136.2MB in the beginning and 134.1MB in the end (delta: 2.1MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. * Witness Printer took 46.24ms. Allocated memory is still 220.2MB. Free memory was 134.1MB in the beginning and 132.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 52]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] unsigned char n = __VERIFIER_nondet_uchar(); [L38] unsigned char n = __VERIFIER_nondet_uchar(); [L39] EXPR \read(n) [L39] COND FALSE !(n == 0) [L46] unsigned char v = 0; [L46] unsigned char v = 0; [L47] unsigned char s = 0; [L47] unsigned char s = 0; [L48] unsigned int i = 0; [L48] unsigned int i = 0; [L49] CALL func_to_recursive_line_12_to_15_0(&v, &n, &s, &i) VAL [\old(i)={5:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={8:0}] [L22] EXPR \read(*i) [L22] EXPR \read(*n) VAL [\old(i)={5:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={8:0}, i={5:0}, n={6:0}, s={7:0}, v={8:0}] [L22] COND TRUE (*i) < (*n) [L25] *v = __VERIFIER_nondet_uchar() [L26] EXPR \read(*s) [L26] EXPR \read(*v) [L26] *s += *v [L27] EXPR \read(*i) [L27] ++(*i) [L27] ++(*i) [L29] CALL func_to_recursive_line_12_to_15_0(v, n, s, i) VAL [\old(i)={5:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={8:0}] [L22] EXPR \read(*i) [L22] EXPR \read(*n) VAL [\old(i)={5:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={8:0}, i={5:0}, n={6:0}, s={7:0}, v={8:0}] [L22] COND TRUE (*i) < (*n) [L25] *v = __VERIFIER_nondet_uchar() [L26] EXPR \read(*s) [L26] EXPR \read(*v) [L26] *s += *v [L27] EXPR \read(*i) [L27] ++(*i) [L27] ++(*i) [L29] CALL func_to_recursive_line_12_to_15_0(v, n, s, i) VAL [\old(i)={5:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={8:0}] [L22] EXPR \read(*i) [L22] EXPR \read(*n) VAL [\old(i)={5:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={8:0}, i={5:0}, n={6:0}, s={7:0}, v={8:0}] [L22] COND FALSE !((*i) < (*n)) [L29] RET func_to_recursive_line_12_to_15_0(v, n, s, i) VAL [\old(i)={5:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={8:0}, i={5:0}, n={6:0}, s={7:0}, v={8:0}] [L29] RET func_to_recursive_line_12_to_15_0(v, n, s, i) VAL [\old(i)={5:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={8:0}, i={5:0}, n={6:0}, s={7:0}, v={8:0}] [L49] RET func_to_recursive_line_12_to_15_0(&v, &n, &s, &i) VAL [i={5:0}, n={6:0}, s={7:0}, v={8:0}] [L50] EXPR \read(s) [L50] EXPR \read(v) [L50] COND TRUE s < v [L52] reach_error() VAL [i={5:0}, n={6:0}, s={7:0}] - UnprovableResult [Line: 60]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 20 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 24 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 15, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 64 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 40 ConstructedInterpolants, 4 QuantifiedInterpolants, 519 SizeOfPredicates, 9 NumberOfNonLiveVariables, 182 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 2/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-08 15:22:55,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE