./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 3289d67d 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-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 08:01:26,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 08:01:26,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 08:01:26,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 08:01:26,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 08:01:26,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 08:01:26,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 08:01:26,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 08:01:26,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 08:01:26,650 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 08:01:26,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 08:01:26,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 08:01:26,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 08:01:26,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 08:01:26,652 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 08:01:26,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 08:01:26,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 08:01:26,653 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 08:01:26,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 08:01:26,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 08:01:26,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 08:01:26,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 08:01:26,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 08:01:26,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 08:01:26,659 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 08:01:26,659 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 08:01:26,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 08:01:26,660 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 08:01:26,660 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 08:01:26,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 08:01:26,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 08:01:26,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 08:01:26,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:01:26,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 08:01:26,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 08:01:26,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 08:01:26,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 08:01:26,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 08:01:26,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 08:01:26,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 08:01:26,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 08:01:26,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 08:01:26,668 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-16 08:01:26,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 08:01:26,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 08:01:26,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 08:01:26,971 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 08:01:26,972 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 08:01:26,973 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-16 08:01:28,491 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 08:01:28,664 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 08:01:28,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-b.c [2024-11-16 08:01:28,672 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ad2ebda5/e6ad86d9e567409980bc50cc0ced0b70/FLAGa8050771b [2024-11-16 08:01:29,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ad2ebda5/e6ad86d9e567409980bc50cc0ced0b70 [2024-11-16 08:01:29,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 08:01:29,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 08:01:29,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 08:01:29,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 08:01:29,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 08:01:29,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:01:29" (1/1) ... [2024-11-16 08:01:29,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@716b0e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:29, skipping insertion in model container [2024-11-16 08:01:29,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:01:29" (1/1) ... [2024-11-16 08:01:29,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 08:01:29,266 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-16 08:01:29,271 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-16 08:01:29,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:01:29,282 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 08:01:29,300 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-16 08:01:29,301 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-16 08:01:29,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:01:29,318 INFO L204 MainTranslator]: Completed translation [2024-11-16 08:01:29,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:29 WrapperNode [2024-11-16 08:01:29,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 08:01:29,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 08:01:29,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 08:01:29,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 08:01:29,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:29" (1/1) ... [2024-11-16 08:01:29,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:29" (1/1) ... [2024-11-16 08:01:29,349 INFO L138 Inliner]: procedures = 13, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 79 [2024-11-16 08:01:29,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 08:01:29,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 08:01:29,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 08:01:29,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 08:01:29,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:29" (1/1) ... [2024-11-16 08:01:29,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:29" (1/1) ... [2024-11-16 08:01:29,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:29" (1/1) ... [2024-11-16 08:01:29,376 INFO L175 MemorySlicer]: Split 18 memory accesses to 5 slices as follows [2, 5, 3, 4, 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, 0, 1, 1]. [2024-11-16 08:01:29,377 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:29" (1/1) ... [2024-11-16 08:01:29,377 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:29" (1/1) ... [2024-11-16 08:01:29,383 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:29" (1/1) ... [2024-11-16 08:01:29,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:29" (1/1) ... [2024-11-16 08:01:29,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:29" (1/1) ... [2024-11-16 08:01:29,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:29" (1/1) ... [2024-11-16 08:01:29,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 08:01:29,389 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 08:01:29,389 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 08:01:29,389 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 08:01:29,390 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:29" (1/1) ... [2024-11-16 08:01:29,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:01:29,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:01:29,422 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-16 08:01:29,441 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-16 08:01:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 08:01:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 08:01:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 08:01:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 08:01:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-16 08:01:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-16 08:01:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 08:01:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 08:01:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 08:01:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 08:01:29,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-16 08:01:29,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-16 08:01:29,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 08:01:29,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 08:01:29,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 08:01:29,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 08:01:29,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 08:01:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-16 08:01:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-16 08:01:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 08:01:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_12_to_15_0 [2024-11-16 08:01:29,550 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_12_to_15_0 [2024-11-16 08:01:29,657 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 08:01:29,659 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 08:01:29,790 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L38: call ULTIMATE.dealloc(main_~#n~0#1.base, main_~#n~0#1.offset);havoc main_~#n~0#1.base, main_~#n~0#1.offset;call ULTIMATE.dealloc(main_~#v~0#1.base, main_~#v~0#1.offset);havoc main_~#v~0#1.base, main_~#v~0#1.offset;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset;call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-16 08:01:29,832 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-16 08:01:29,832 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 08:01:29,844 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 08:01:29,844 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 08:01:29,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:01:29 BoogieIcfgContainer [2024-11-16 08:01:29,844 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 08:01:29,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 08:01:29,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 08:01:29,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 08:01:29,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:01:29" (1/3) ... [2024-11-16 08:01:29,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b43abf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:01:29, skipping insertion in model container [2024-11-16 08:01:29,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:29" (2/3) ... [2024-11-16 08:01:29,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b43abf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:01:29, skipping insertion in model container [2024-11-16 08:01:29,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:01:29" (3/3) ... [2024-11-16 08:01:29,851 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_linear-inequality-inv-b.c [2024-11-16 08:01:29,866 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 08:01:29,867 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 08:01:29,922 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 08:01:29,932 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;@a33337c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 08:01:29,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 08:01:29,939 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.4) internal successors, (21), 18 states have internal predecessors, (21), 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-16 08:01:29,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-16 08:01:29,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:01:29,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:01:29,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:01:29,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:01:29,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1519671576, now seen corresponding path program 1 times [2024-11-16 08:01:29,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:01:29,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647389650] [2024-11-16 08:01:29,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:01:29,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:01:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:01:30,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:01:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:01:30,626 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-16 08:01:30,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:01:30,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647389650] [2024-11-16 08:01:30,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647389650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:01:30,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:01:30,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:01:30,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096480605] [2024-11-16 08:01:30,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:01:30,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:01:30,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:01:30,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:01:30,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:01:30,661 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.4) internal successors, (21), 18 states have internal predecessors, (21), 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-16 08:01:30,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:01:30,733 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2024-11-16 08:01:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 08:01:30,736 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-16 08:01:30,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:01:30,743 INFO L225 Difference]: With dead ends: 30 [2024-11-16 08:01:30,743 INFO L226 Difference]: Without dead ends: 15 [2024-11-16 08:01:30,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:01:30,751 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:01:30,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 51 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:01:30,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-16 08:01:30,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-16 08:01:30,781 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-16 08:01:30,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-16 08:01:30,783 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2024-11-16 08:01:30,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:01:30,783 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-16 08:01:30,784 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-16 08:01:30,784 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-16 08:01:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-16 08:01:30,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:01:30,786 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:01:30,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 08:01:30,786 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:01:30,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:01:30,787 INFO L85 PathProgramCache]: Analyzing trace with hash -364994800, now seen corresponding path program 1 times [2024-11-16 08:01:30,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:01:30,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850924081] [2024-11-16 08:01:30,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:01:30,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:01:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:01:31,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 08:01:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:01:31,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 08:01:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:01:31,847 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-16 08:01:31,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:01:31,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850924081] [2024-11-16 08:01:31,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850924081] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:01:31,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832962160] [2024-11-16 08:01:31,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:01:31,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:01:31,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:01:31,857 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-16 08:01:31,864 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-16 08:01:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:01:32,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-16 08:01:32,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:01:32,301 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 [2024-11-16 08:01:32,364 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-16 08:01:32,409 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 21 treesize of output 13 [2024-11-16 08:01:32,414 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 17 treesize of output 9 [2024-11-16 08:01:32,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:01:32,441 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 08:01:32,875 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 11 treesize of output 7 [2024-11-16 08:01:33,010 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 80 treesize of output 76 [2024-11-16 08:01:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 08:01:33,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832962160] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 08:01:33,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 08:01:33,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2024-11-16 08:01:33,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102446803] [2024-11-16 08:01:33,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 08:01:33,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-16 08:01:33,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:01:33,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-16 08:01:33,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-11-16 08:01:33,570 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 21 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-16 08:01:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:01:33,917 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-11-16 08:01:33,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 08:01:33,918 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 16 [2024-11-16 08:01:33,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:01:33,919 INFO L225 Difference]: With dead ends: 25 [2024-11-16 08:01:33,919 INFO L226 Difference]: Without dead ends: 19 [2024-11-16 08:01:33,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2024-11-16 08:01:33,921 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:01:33,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 72 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:01:33,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-16 08:01:33,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-16 08:01:33,932 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-16 08:01:33,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2024-11-16 08:01:33,933 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2024-11-16 08:01:33,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:01:33,933 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-11-16 08:01:33,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-16 08:01:33,934 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2024-11-16 08:01:33,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-16 08:01:33,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:01:33,935 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:01:33,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 08:01:34,136 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-16 08:01:34,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:01:34,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:01:34,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1642325280, now seen corresponding path program 2 times [2024-11-16 08:01:34,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:01:34,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516277420] [2024-11-16 08:01:34,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:01:34,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:01:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 08:01:34,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 08:01:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 08:01:34,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 08:01:34,245 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 08:01:34,247 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-16 08:01:34,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-16 08:01:34,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 08:01:34,253 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-11-16 08:01:34,299 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 08:01:34,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 08:01:34 BoogieIcfgContainer [2024-11-16 08:01:34,304 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 08:01:34,307 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 08:01:34,307 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 08:01:34,307 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 08:01:34,308 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:01:29" (3/4) ... [2024-11-16 08:01:34,308 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 08:01:34,367 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 08:01:34,367 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 08:01:34,367 INFO L158 Benchmark]: Toolchain (without parser) took 5307.65ms. Allocated memory was 176.2MB in the beginning and 234.9MB in the end (delta: 58.7MB). Free memory was 105.5MB in the beginning and 85.3MB in the end (delta: 20.2MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. [2024-11-16 08:01:34,368 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 176.2MB. Free memory was 131.6MB in the beginning and 131.6MB in the end (delta: 21.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 08:01:34,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.35ms. Allocated memory is still 176.2MB. Free memory was 105.2MB in the beginning and 92.7MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 08:01:34,368 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.79ms. Allocated memory is still 176.2MB. Free memory was 92.7MB in the beginning and 91.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 08:01:34,368 INFO L158 Benchmark]: Boogie Preprocessor took 37.72ms. Allocated memory is still 176.2MB. Free memory was 91.0MB in the beginning and 89.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 08:01:34,369 INFO L158 Benchmark]: IcfgBuilder took 455.56ms. Allocated memory is still 176.2MB. Free memory was 89.1MB in the beginning and 135.0MB in the end (delta: -45.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 08:01:34,369 INFO L158 Benchmark]: TraceAbstraction took 4457.78ms. Allocated memory was 176.2MB in the beginning and 234.9MB in the end (delta: 58.7MB). Free memory was 134.3MB in the beginning and 88.5MB in the end (delta: 45.9MB). Peak memory consumption was 105.9MB. Max. memory is 16.1GB. [2024-11-16 08:01:34,371 INFO L158 Benchmark]: Witness Printer took 60.33ms. Allocated memory is still 234.9MB. Free memory was 88.5MB in the beginning and 85.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 08:01:34,373 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.24ms. Allocated memory is still 176.2MB. Free memory was 131.6MB in the beginning and 131.6MB in the end (delta: 21.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.35ms. Allocated memory is still 176.2MB. Free memory was 105.2MB in the beginning and 92.7MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.79ms. Allocated memory is still 176.2MB. Free memory was 92.7MB in the beginning and 91.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.72ms. Allocated memory is still 176.2MB. Free memory was 91.0MB in the beginning and 89.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 455.56ms. Allocated memory is still 176.2MB. Free memory was 89.1MB in the beginning and 135.0MB in the end (delta: -45.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4457.78ms. Allocated memory was 176.2MB in the beginning and 234.9MB in the end (delta: 58.7MB). Free memory was 134.3MB in the beginning and 88.5MB in the end (delta: 45.9MB). Peak memory consumption was 105.9MB. Max. memory is 16.1GB. * Witness Printer took 60.33ms. Allocated memory is still 234.9MB. Free memory was 88.5MB in the beginning and 85.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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)={8:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={5:0}] [L22] EXPR \read(*i) [L22] EXPR \read(*n) VAL [\old(i)={8:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={5:0}, i={8:0}, n={6:0}, s={7:0}, v={5: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)={8:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={5:0}] [L22] EXPR \read(*i) [L22] EXPR \read(*n) VAL [\old(i)={8:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={5:0}, i={8:0}, n={6:0}, s={7:0}, v={5: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)={8:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={5:0}] [L22] EXPR \read(*i) [L22] EXPR \read(*n) VAL [\old(i)={8:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={5:0}, i={8:0}, n={6:0}, s={7:0}, v={5:0}] [L22] COND FALSE !((*i) < (*n)) [L29] RET func_to_recursive_line_12_to_15_0(v, n, s, i) VAL [\old(i)={8:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={5:0}, i={8:0}, n={6:0}, s={7:0}, v={5:0}] [L29] RET func_to_recursive_line_12_to_15_0(v, n, s, i) VAL [\old(i)={8:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={5:0}, i={8:0}, n={6:0}, s={7:0}, v={5:0}] [L49] RET func_to_recursive_line_12_to_15_0(&v, &n, &s, &i) VAL [i={8:0}, n={6:0}, s={7:0}, v={5:0}] [L50] EXPR \read(s) [L50] EXPR \read(v) [L50] COND TRUE s < v [L52] reach_error() VAL [i={8: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, 21 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 126 IncrementalHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 23 mSDtfsCounter, 126 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred 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.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 64 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 55 ConstructedInterpolants, 5 QuantifiedInterpolants, 887 SizeOfPredicates, 10 NumberOfNonLiveVariables, 182 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2/12 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-16 08:01:34,406 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