./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 e3035f98bbb3ff84987fa13edbd40518c4756dd57350bdb439e24cd050f366e4 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-25 00:10:51,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:10:51,492 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 00:10:51,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:10:51,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:10:51,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:10:51,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:10:51,520 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:10:51,521 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:10:51,521 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:10:51,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:10:51,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:10:51,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:10:51,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:10:51,523 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:10:51,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:10:51,526 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:10:51,526 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:10:51,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 00:10:51,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:10:51,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:10:51,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:10:51,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:10:51,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:10:51,530 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:10:51,530 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:10:51,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:10:51,531 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:10:51,531 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:10:51,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:10:51,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:10:51,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:10:51,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:10:51,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:10:51,532 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:10:51,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:10:51,533 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 00:10:51,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 00:10:51,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:10:51,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:10:51,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:10:51,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:10:51,535 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 -> e3035f98bbb3ff84987fa13edbd40518c4756dd57350bdb439e24cd050f366e4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 00:10:51,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:10:51,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:10:51,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:10:51,842 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:10:51,843 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:10:51,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c [2024-09-25 00:10:53,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:10:53,510 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:10:53,510 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c [2024-09-25 00:10:53,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/ff06050c2/dd58398d6bb741c5841d6d166cea57fb/FLAG3ec2a59cf [2024-09-25 00:10:53,537 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/ff06050c2/dd58398d6bb741c5841d6d166cea57fb [2024-09-25 00:10:53,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:10:53,540 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:10:53,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:10:53,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:10:53,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:10:53,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:10:53" (1/1) ... [2024-09-25 00:10:53,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1818f3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:53, skipping insertion in model container [2024-09-25 00:10:53,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:10:53" (1/1) ... [2024-09-25 00:10:53,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:10:53,731 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[2334,2347] [2024-09-25 00:10:53,744 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[3766,3779] [2024-09-25 00:10:53,750 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[5247,5260] [2024-09-25 00:10:53,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:10:53,766 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:10:53,792 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[2334,2347] [2024-09-25 00:10:53,800 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[3766,3779] [2024-09-25 00:10:53,805 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[5247,5260] [2024-09-25 00:10:53,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:10:53,844 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:10:53,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:53 WrapperNode [2024-09-25 00:10:53,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:10:53,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:10:53,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:10:53,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:10:53,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:53" (1/1) ... [2024-09-25 00:10:53,863 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:53" (1/1) ... [2024-09-25 00:10:53,868 INFO L138 Inliner]: procedures = 16, calls = 30, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:10:53,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:10:53,869 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:10:53,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:10:53,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:10:53,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:53" (1/1) ... [2024-09-25 00:10:53,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:53" (1/1) ... [2024-09-25 00:10:53,881 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:53" (1/1) ... [2024-09-25 00:10:53,899 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-09-25 00:10:53,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:53" (1/1) ... [2024-09-25 00:10:53,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:53" (1/1) ... [2024-09-25 00:10:53,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:53" (1/1) ... [2024-09-25 00:10:53,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:53" (1/1) ... [2024-09-25 00:10:53,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:53" (1/1) ... [2024-09-25 00:10:53,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:53" (1/1) ... [2024-09-25 00:10:53,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:10:53,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:10:53,916 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:10:53,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:10:53,917 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:53" (1/1) ... [2024-09-25 00:10:53,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:10:53,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:10:53,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 00:10:53,961 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 00:10:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:10:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:10:54,012 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:10:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 00:10:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-25 00:10:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-25 00:10:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-25 00:10:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-25 00:10:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-25 00:10:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-25 00:10:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:10:54,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:10:54,015 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_22_0 [2024-09-25 00:10:54,015 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_22_0 [2024-09-25 00:10:54,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:10:54,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:10:54,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-25 00:10:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-25 00:10:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-25 00:10:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-25 00:10:54,112 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:10:54,114 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:10:54,409 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-09-25 00:10:54,409 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:10:54,432 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:10:54,433 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 00:10:54,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:10:54 BoogieIcfgContainer [2024-09-25 00:10:54,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:10:54,436 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:10:54,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:10:54,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:10:54,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:10:53" (1/3) ... [2024-09-25 00:10:54,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5788d383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:10:54, skipping insertion in model container [2024-09-25 00:10:54,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:53" (2/3) ... [2024-09-25 00:10:54,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5788d383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:10:54, skipping insertion in model container [2024-09-25 00:10:54,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:10:54" (3/3) ... [2024-09-25 00:10:54,441 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_4.i.v+nlh-reducer.c [2024-09-25 00:10:54,457 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:10:54,457 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-09-25 00:10:54,518 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:10:54,524 INFO L336 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=All, 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;@370ba1ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:10:54,524 INFO L337 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-09-25 00:10:54,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 35 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 00:10:54,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-25 00:10:54,538 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:10:54,539 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:10:54,539 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:10:54,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:54,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1270915702, now seen corresponding path program 1 times [2024-09-25 00:10:54,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:10:54,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088926955] [2024-09-25 00:10:54,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:54,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:10:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:55,068 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:10:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:55,095 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:10:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:10:55,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:10:55,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088926955] [2024-09-25 00:10:55,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088926955] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:10:55,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:10:55,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 00:10:55,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109067261] [2024-09-25 00:10:55,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:10:55,223 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 00:10:55,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:10:55,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 00:10:55,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-25 00:10:55,284 INFO L87 Difference]: Start difference. First operand has 42 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 35 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:10:55,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:10:55,686 INFO L93 Difference]: Finished difference Result 83 states and 115 transitions. [2024-09-25 00:10:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 00:10:55,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-09-25 00:10:55,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:10:55,694 INFO L225 Difference]: With dead ends: 83 [2024-09-25 00:10:55,694 INFO L226 Difference]: Without dead ends: 44 [2024-09-25 00:10:55,697 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-09-25 00:10:55,700 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:10:55,701 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 81 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:10:55,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-25 00:10:55,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2024-09-25 00:10:55,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 32 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 00:10:55,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-09-25 00:10:55,738 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 18 [2024-09-25 00:10:55,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:10:55,739 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-09-25 00:10:55,739 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:10:55,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:55,740 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2024-09-25 00:10:55,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-25 00:10:55,741 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:10:55,741 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:10:55,742 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 00:10:55,742 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:10:55,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:55,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1839939650, now seen corresponding path program 1 times [2024-09-25 00:10:55,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:10:55,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297554522] [2024-09-25 00:10:55,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:55,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:10:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:55,899 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:10:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:55,914 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:10:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:55,936 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:10:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 00:10:55,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:10:55,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297554522] [2024-09-25 00:10:55,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297554522] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:10:55,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:10:55,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:10:55,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735403331] [2024-09-25 00:10:55,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:10:55,946 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:10:55,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:10:55,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:10:55,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:10:55,948 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 00:10:56,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:10:56,098 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-09-25 00:10:56,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 00:10:56,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-09-25 00:10:56,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:10:56,100 INFO L225 Difference]: With dead ends: 46 [2024-09-25 00:10:56,100 INFO L226 Difference]: Without dead ends: 41 [2024-09-25 00:10:56,100 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-09-25 00:10:56,101 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 36 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:10:56,102 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 55 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:10:56,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-25 00:10:56,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-09-25 00:10:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 00:10:56,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-09-25 00:10:56,112 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 23 [2024-09-25 00:10:56,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:10:56,112 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-09-25 00:10:56,112 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 00:10:56,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:56,113 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-09-25 00:10:56,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-25 00:10:56,113 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:10:56,113 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:10:56,114 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 00:10:56,114 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:10:56,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:56,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1050861701, now seen corresponding path program 1 times [2024-09-25 00:10:56,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:10:56,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286694640] [2024-09-25 00:10:56,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:56,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:10:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:56,164 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:10:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:56,182 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:10:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:56,194 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:10:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 00:10:56,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:10:56,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286694640] [2024-09-25 00:10:56,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286694640] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:10:56,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:10:56,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:10:56,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398237095] [2024-09-25 00:10:56,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:10:56,202 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:10:56,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:10:56,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:10:56,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:10:56,204 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 00:10:56,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:10:56,337 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2024-09-25 00:10:56,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 00:10:56,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-25 00:10:56,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:10:56,340 INFO L225 Difference]: With dead ends: 66 [2024-09-25 00:10:56,340 INFO L226 Difference]: Without dead ends: 46 [2024-09-25 00:10:56,340 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-25 00:10:56,342 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:10:56,342 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 46 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:10:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-25 00:10:56,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2024-09-25 00:10:56,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 32 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 00:10:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-09-25 00:10:56,355 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 24 [2024-09-25 00:10:56,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:10:56,355 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-09-25 00:10:56,356 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 00:10:56,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-09-25 00:10:56,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-25 00:10:56,357 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:10:56,357 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:10:56,358 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 00:10:56,358 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:10:56,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:56,358 INFO L85 PathProgramCache]: Analyzing trace with hash 987138752, now seen corresponding path program 1 times [2024-09-25 00:10:56,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:10:56,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321468185] [2024-09-25 00:10:56,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:56,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:10:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:56,465 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:10:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:56,477 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:10:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:56,488 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:10:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 00:10:56,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:10:56,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321468185] [2024-09-25 00:10:56,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321468185] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:10:56,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:10:56,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 00:10:56,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074166300] [2024-09-25 00:10:56,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:10:56,494 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 00:10:56,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:10:56,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 00:10:56,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 00:10:56,498 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 00:10:56,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:10:56,656 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-09-25 00:10:56,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 00:10:56,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-25 00:10:56,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:10:56,657 INFO L225 Difference]: With dead ends: 43 [2024-09-25 00:10:56,657 INFO L226 Difference]: Without dead ends: 41 [2024-09-25 00:10:56,658 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-25 00:10:56,659 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:10:56,659 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 77 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:10:56,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-25 00:10:56,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-25 00:10:56,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 00:10:56,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-09-25 00:10:56,674 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 24 [2024-09-25 00:10:56,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:10:56,675 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-09-25 00:10:56,675 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 00:10:56,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:56,678 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-09-25 00:10:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-25 00:10:56,679 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:10:56,679 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:10:56,679 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-25 00:10:56,679 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:10:56,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:56,680 INFO L85 PathProgramCache]: Analyzing trace with hash 593726069, now seen corresponding path program 1 times [2024-09-25 00:10:56,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:10:56,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98513708] [2024-09-25 00:10:56,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:56,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:10:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:56,724 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:10:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:56,735 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:10:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:56,744 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:10:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:56,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 00:10:56,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:10:56,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98513708] [2024-09-25 00:10:56,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98513708] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:10:56,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:10:56,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:10:56,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858601318] [2024-09-25 00:10:56,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:10:56,753 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:10:56,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:10:56,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:10:56,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:10:56,757 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 00:10:56,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:10:56,880 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2024-09-25 00:10:56,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 00:10:56,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-09-25 00:10:56,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:10:56,881 INFO L225 Difference]: With dead ends: 62 [2024-09-25 00:10:56,881 INFO L226 Difference]: Without dead ends: 42 [2024-09-25 00:10:56,882 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-25 00:10:56,883 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:10:56,883 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 46 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:10:56,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-25 00:10:56,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-09-25 00:10:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 00:10:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-09-25 00:10:56,893 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 25 [2024-09-25 00:10:56,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:10:56,893 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-09-25 00:10:56,893 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 00:10:56,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-09-25 00:10:56,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-25 00:10:56,895 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:10:56,895 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:10:56,895 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-25 00:10:56,895 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:10:56,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:56,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1283728479, now seen corresponding path program 1 times [2024-09-25 00:10:56,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:10:56,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394253891] [2024-09-25 00:10:56,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:56,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:10:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:57,286 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:10:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:57,297 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:10:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:57,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:10:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:10:57,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:10:57,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394253891] [2024-09-25 00:10:57,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394253891] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:10:57,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765605573] [2024-09-25 00:10:57,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:57,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:10:57,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:10:57,570 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:10:57,572 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 00:10:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:57,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-25 00:10:57,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:10:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:10:57,928 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:10:58,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:10:58,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765605573] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:10:58,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:10:58,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 24 [2024-09-25 00:10:58,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480000289] [2024-09-25 00:10:58,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:10:58,467 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 00:10:58,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:10:58,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 00:10:58,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2024-09-25 00:10:58,469 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 24 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 6 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2024-09-25 00:10:59,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:10:59,057 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2024-09-25 00:10:59,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 00:10:59,058 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 6 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 30 [2024-09-25 00:10:59,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:10:59,059 INFO L225 Difference]: With dead ends: 70 [2024-09-25 00:10:59,059 INFO L226 Difference]: Without dead ends: 47 [2024-09-25 00:10:59,060 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=1045, Unknown=0, NotChecked=0, Total=1260 [2024-09-25 00:10:59,061 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 46 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:10:59,062 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 205 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:10:59,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-25 00:10:59,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2024-09-25 00:10:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.21875) internal successors, (39), 34 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-25 00:10:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2024-09-25 00:10:59,076 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 30 [2024-09-25 00:10:59,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:10:59,076 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-09-25 00:10:59,076 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 6 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2024-09-25 00:10:59,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:59,077 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2024-09-25 00:10:59,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-25 00:10:59,079 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:10:59,079 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:10:59,098 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 00:10:59,283 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 00:10:59,284 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:10:59,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:59,285 INFO L85 PathProgramCache]: Analyzing trace with hash -334098889, now seen corresponding path program 2 times [2024-09-25 00:10:59,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:10:59,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107143263] [2024-09-25 00:10:59,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:59,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:10:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:00,237 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:11:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:00,247 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:11:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:00,823 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:11:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:01,188 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:11:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:01,443 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:11:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:01,621 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:11:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-25 00:11:01,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:11:01,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107143263] [2024-09-25 00:11:01,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107143263] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:11:01,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457180450] [2024-09-25 00:11:01,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:11:01,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:11:01,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:11:01,705 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:11:01,707 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 00:11:02,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-25 00:11:02,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:11:02,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-25 00:11:02,297 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:11:05,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-25 00:11:05,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-25 00:11:05,377 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-25 00:11:05,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-25 00:11:05,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-25 00:11:05,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-25 00:11:05,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-25 00:11:05,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-25 00:11:05,386 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-25 00:11:05,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:11:05,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 880 treesize of output 504 [2024-09-25 00:11:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-09-25 00:11:05,837 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 00:11:05,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457180450] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:11:05,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 00:11:05,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2024-09-25 00:11:05,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642100790] [2024-09-25 00:11:05,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:11:05,841 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 00:11:05,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:11:05,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 00:11:05,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2024-09-25 00:11:05,843 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 00:11:06,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:11:06,130 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2024-09-25 00:11:06,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-25 00:11:06,131 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2024-09-25 00:11:06,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:11:06,132 INFO L225 Difference]: With dead ends: 60 [2024-09-25 00:11:06,134 INFO L226 Difference]: Without dead ends: 41 [2024-09-25 00:11:06,135 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2024-09-25 00:11:06,136 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 32 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:11:06,136 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 73 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:11:06,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-25 00:11:06,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-09-25 00:11:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-25 00:11:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-09-25 00:11:06,160 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 45 [2024-09-25 00:11:06,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:11:06,160 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-09-25 00:11:06,160 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 00:11:06,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:11:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-09-25 00:11:06,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-25 00:11:06,165 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:11:06,166 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:11:06,187 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 00:11:06,369 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 00:11:06,371 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:11:06,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:11:06,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1876014347, now seen corresponding path program 1 times [2024-09-25 00:11:06,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:11:06,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189019493] [2024-09-25 00:11:06,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:11:06,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:11:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:06,481 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:11:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:06,494 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:11:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:06,513 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:11:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:06,525 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:11:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:06,535 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:11:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:06,540 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:11:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:06,544 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-09-25 00:11:06,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:11:06,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189019493] [2024-09-25 00:11:06,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189019493] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:11:06,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:11:06,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-25 00:11:06,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385468260] [2024-09-25 00:11:06,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:11:06,547 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 00:11:06,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:11:06,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 00:11:06,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-25 00:11:06,549 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 00:11:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:11:06,704 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2024-09-25 00:11:06,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 00:11:06,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-09-25 00:11:06,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:11:06,705 INFO L225 Difference]: With dead ends: 39 [2024-09-25 00:11:06,705 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 00:11:06,706 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-09-25 00:11:06,706 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 21 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:11:06,707 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 38 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:11:06,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 00:11:06,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 00:11:06,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-25 00:11:06,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 00:11:06,708 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2024-09-25 00:11:06,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:11:06,708 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 00:11:06,708 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 00:11:06,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:11:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 00:11:06,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 00:11:06,716 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-09-25 00:11:06,717 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-09-25 00:11:06,717 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-09-25 00:11:06,717 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-25 00:11:06,720 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-09-25 00:11:06,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 00:11:07,204 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 00:11:07,217 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 00:11:07,218 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-25 00:11:07,218 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-25 00:11:07,219 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 00:11:07,219 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-25 00:11:07,219 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-25 00:11:07,219 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset [2024-09-25 00:11:07,222 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 00:11:07,223 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-25 00:11:07,223 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-25 00:11:07,223 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 00:11:07,223 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-25 00:11:07,223 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-25 00:11:07,223 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset [2024-09-25 00:11:07,224 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset [2024-09-25 00:11:07,224 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 00:11:07,224 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-25 00:11:07,225 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-25 00:11:07,225 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 00:11:07,225 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-25 00:11:07,225 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-25 00:11:07,225 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset [2024-09-25 00:11:07,226 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset [2024-09-25 00:11:07,226 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset [2024-09-25 00:11:07,229 WARN L155 FloydHoareUtils]: Requires clause for func_to_recursive_line_20_to_22_0 contained old-variable. Original clause: (and (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_int#1| |old(#memory_int#1)|)) Eliminated clause: true [2024-09-25 00:11:07,231 WARN L155 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (and (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_int#1| |old(#memory_int#1)|)) Eliminated clause: true [2024-09-25 00:11:07,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 12:11:07 BoogieIcfgContainer [2024-09-25 00:11:07,231 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 00:11:07,232 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 00:11:07,232 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 00:11:07,232 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 00:11:07,233 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:10:54" (3/4) ... [2024-09-25 00:11:07,235 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 00:11:07,305 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 00:11:07,305 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 00:11:07,306 INFO L158 Benchmark]: Toolchain (without parser) took 13765.12ms. Allocated memory was 184.5MB in the beginning and 388.0MB in the end (delta: 203.4MB). Free memory was 149.6MB in the beginning and 130.2MB in the end (delta: 19.4MB). Peak memory consumption was 223.9MB. Max. memory is 16.1GB. [2024-09-25 00:11:07,306 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 119.5MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:11:07,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.27ms. Allocated memory is still 184.5MB. Free memory was 149.6MB in the beginning and 136.0MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-25 00:11:07,306 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.45ms. Allocated memory is still 184.5MB. Free memory was 136.0MB in the beginning and 135.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:11:07,307 INFO L158 Benchmark]: Boogie Preprocessor took 46.04ms. Allocated memory is still 184.5MB. Free memory was 135.0MB in the beginning and 132.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:11:07,307 INFO L158 Benchmark]: RCFGBuilder took 517.16ms. Allocated memory is still 184.5MB. Free memory was 132.9MB in the beginning and 115.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-09-25 00:11:07,307 INFO L158 Benchmark]: TraceAbstraction took 12795.99ms. Allocated memory was 184.5MB in the beginning and 388.0MB in the end (delta: 203.4MB). Free memory was 114.0MB in the beginning and 132.3MB in the end (delta: -18.3MB). Peak memory consumption was 186.2MB. Max. memory is 16.1GB. [2024-09-25 00:11:07,308 INFO L158 Benchmark]: Witness Printer took 73.15ms. Allocated memory is still 388.0MB. Free memory was 132.3MB in the beginning and 130.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:11:07,310 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.20ms. Allocated memory is still 119.5MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.27ms. Allocated memory is still 184.5MB. Free memory was 149.6MB in the beginning and 136.0MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.45ms. Allocated memory is still 184.5MB. Free memory was 136.0MB in the beginning and 135.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.04ms. Allocated memory is still 184.5MB. Free memory was 135.0MB in the beginning and 132.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 517.16ms. Allocated memory is still 184.5MB. Free memory was 132.9MB in the beginning and 115.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 12795.99ms. Allocated memory was 184.5MB in the beginning and 388.0MB in the end (delta: 203.4MB). Free memory was 114.0MB in the beginning and 132.3MB in the end (delta: -18.3MB). Peak memory consumption was 186.2MB. Max. memory is 16.1GB. * Witness Printer took 73.15ms. Allocated memory is still 388.0MB. Free memory was 132.3MB in the beginning and 130.2MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 88]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 125]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 170]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 42 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 274 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 262 mSDsluCounter, 621 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 470 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 978 IncrementalHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 151 mSDtfsCounter, 978 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=6, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 24 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 310 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 329 ConstructedInterpolants, 0 QuantifiedInterpolants, 1573 SizeOfPredicates, 13 NumberOfNonLiveVariables, 333 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 120/166 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 155]: Location Invariant Derived location invariant: (((__tmp_155_0 == \old(__tmp_155_0)) && (main__loop_entered == 0)) || (((((long long) main__index2 + 1) % 4294967296) <= 99999) && ((((4294967295 + main__index1) % 4294967296) + 1) <= (((long long) main__index2 + 1) % 4294967296)))) - InvariantResult [Line: 111]: Location Invariant Derived location invariant: ((((main____CPAchecker_TMP_0 != 0) && ((((long long) main__index2 + 1) % 4294967296) <= 99999)) && (((long long) main__index1 + 1) <= main__index2)) && ((((4294967295 + main__index1) % 4294967296) + 1) <= (((long long) main__index2 + 1) % 4294967296))) - InvariantResult [Line: 155]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 93]: Location Invariant Derived location invariant: ((((long long) main__index1 + 1) <= main__index2) && (main__index2 <= 99999)) - InvariantResult [Line: 160]: Location Invariant Derived location invariant: ((((((long long) main__index2 + 1) % 4294967296) <= 99999) && ((((4294967295 + main__index1) % 4294967296) + 1) <= (((long long) main__index2 + 1) % 4294967296))) || ((((long long) main__index1 + 1) <= main__index2) && (main__index2 <= 99999))) - InvariantResult [Line: 72]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 74]: Location Invariant Derived location invariant: (((((__tmp_155_0 == \old(__tmp_155_0)) && (main____CPAchecker_TMP_0 == 1)) && (((long long) main__index1 + 1) <= main__index2)) && (main__index2 <= 99999)) && (main__loop_entered == 0)) - InvariantResult [Line: 109]: Location Invariant Derived location invariant: 0 RESULT: Ultimate proved your program to be correct! [2024-09-25 00:11:07,344 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE