./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+lhb-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 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1d5fa637 Calling Ultimate with: /root/.sdkman/candidates/java/current/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+lhb-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 8639f60502701b783590428cddba5bf44f8c35f715b0b6bf93574efbde24283f --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-1d5fa63-m [2024-09-13 09:51:39,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 09:51:39,647 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 09:51:39,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 09:51:39,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 09:51:39,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 09:51:39,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 09:51:39,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 09:51:39,683 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 09:51:39,684 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 09:51:39,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 09:51:39,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 09:51:39,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 09:51:39,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 09:51:39,689 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 09:51:39,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 09:51:39,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 09:51:39,691 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 09:51:39,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 09:51:39,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 09:51:39,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 09:51:39,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 09:51:39,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 09:51:39,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 09:51:39,693 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 09:51:39,693 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 09:51:39,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 09:51:39,693 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 09:51:39,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 09:51:39,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 09:51:39,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 09:51:39,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 09:51:39,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 09:51:39,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 09:51:39,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 09:51:39,698 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 09:51:39,698 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 09:51:39,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 09:51:39,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 09:51:39,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 09:51:39,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 09:51:39,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 09:51:39,700 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 -> 8639f60502701b783590428cddba5bf44f8c35f715b0b6bf93574efbde24283f 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 [2024-09-13 09:51:39,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 09:51:39,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 09:51:39,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 09:51:39,971 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 09:51:39,971 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 09:51:39,972 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+lhb-reducer.c [2024-09-13 09:51:41,463 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 09:51:41,673 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 09:51:41,673 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+lhb-reducer.c [2024-09-13 09:51:41,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/15fdf5541/ddfbe5f2ae5a49329b986fa6c19ce8ea/FLAG3454d3e6a [2024-09-13 09:51:41,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/15fdf5541/ddfbe5f2ae5a49329b986fa6c19ce8ea [2024-09-13 09:51:41,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 09:51:41,705 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 09:51:41,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 09:51:41,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 09:51:41,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 09:51:41,716 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 09:51:41" (1/1) ... [2024-09-13 09:51:41,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61fc12bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:51:41, skipping insertion in model container [2024-09-13 09:51:41,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 09:51:41" (1/1) ... [2024-09-13 09:51:41,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 09:51:41,932 WARN L247 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+lhb-reducer.c[2334,2347] [2024-09-13 09:51:41,945 WARN L247 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+lhb-reducer.c[3766,3779] [2024-09-13 09:51:41,953 WARN L247 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+lhb-reducer.c[5193,5206] [2024-09-13 09:51:41,957 WARN L247 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+lhb-reducer.c[7003,7016] [2024-09-13 09:51:41,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 09:51:41,971 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 09:51:41,988 WARN L247 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+lhb-reducer.c[2334,2347] [2024-09-13 09:51:41,992 WARN L247 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+lhb-reducer.c[3766,3779] [2024-09-13 09:51:41,994 WARN L247 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+lhb-reducer.c[5193,5206] [2024-09-13 09:51:41,997 WARN L247 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+lhb-reducer.c[7003,7016] [2024-09-13 09:51:42,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 09:51:42,023 INFO L204 MainTranslator]: Completed translation [2024-09-13 09:51:42,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:51:42 WrapperNode [2024-09-13 09:51:42,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 09:51:42,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 09:51:42,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 09:51:42,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 09:51:42,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:51:42" (1/1) ... [2024-09-13 09:51:42,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:51:42" (1/1) ... [2024-09-13 09:51:42,052 INFO L138 Inliner]: procedures = 16, calls = 35, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 09:51:42,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 09:51:42,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 09:51:42,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 09:51:42,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 09:51:42,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:51:42" (1/1) ... [2024-09-13 09:51:42,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:51:42" (1/1) ... [2024-09-13 09:51:42,066 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:51:42" (1/1) ... [2024-09-13 09:51:42,085 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 7, 5]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 2 writes are split as follows [0, 1, 1]. [2024-09-13 09:51:42,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:51:42" (1/1) ... [2024-09-13 09:51:42,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:51:42" (1/1) ... [2024-09-13 09:51:42,099 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:51:42" (1/1) ... [2024-09-13 09:51:42,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:51:42" (1/1) ... [2024-09-13 09:51:42,109 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:51:42" (1/1) ... [2024-09-13 09:51:42,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:51:42" (1/1) ... [2024-09-13 09:51:42,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 09:51:42,113 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 09:51:42,113 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 09:51:42,113 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 09:51:42,114 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:51:42" (1/1) ... [2024-09-13 09:51:42,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 09:51:42,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:51:42,149 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-13 09:51:42,150 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-13 09:51:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 09:51:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 09:51:42,196 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 09:51:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 09:51:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-13 09:51:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-13 09:51:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-13 09:51:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-13 09:51:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-13 09:51:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-13 09:51:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 09:51:42,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 09:51:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_22_0 [2024-09-13 09:51:42,198 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_22_0 [2024-09-13 09:51:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 09:51:42,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 09:51:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-13 09:51:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-13 09:51:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-13 09:51:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-13 09:51:42,295 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 09:51:42,297 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 09:51:42,596 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-09-13 09:51:42,596 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 09:51:42,614 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 09:51:42,615 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-13 09:51:42,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 09:51:42 BoogieIcfgContainer [2024-09-13 09:51:42,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 09:51:42,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 09:51:42,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 09:51:42,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 09:51:42,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 09:51:41" (1/3) ... [2024-09-13 09:51:42,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e6541c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 09:51:42, skipping insertion in model container [2024-09-13 09:51:42,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:51:42" (2/3) ... [2024-09-13 09:51:42,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e6541c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 09:51:42, skipping insertion in model container [2024-09-13 09:51:42,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 09:51:42" (3/3) ... [2024-09-13 09:51:42,628 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_4.i.v+lhb-reducer.c [2024-09-13 09:51:42,646 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 09:51:42,646 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-09-13 09:51:42,718 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 09:51:42,724 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;@428b105, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 09:51:42,724 INFO L337 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-09-13 09:51:42,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 41 states have internal predecessors, (58), 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-13 09:51:42,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-13 09:51:42,736 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:51:42,736 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-13 09:51:42,737 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:51:42,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:51:42,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1794195143, now seen corresponding path program 1 times [2024-09-13 09:51:42,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:51:42,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51705609] [2024-09-13 09:51:42,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:51:42,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:51:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:43,320 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:51:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:43,335 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:51:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:43,439 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-13 09:51:43,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:51:43,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51705609] [2024-09-13 09:51:43,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51705609] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:51:43,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:51:43,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-13 09:51:43,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303688134] [2024-09-13 09:51:43,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:51:43,447 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 09:51:43,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:51:43,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 09:51:43,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-13 09:51:43,473 INFO L87 Difference]: Start difference. First operand has 48 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 41 states have internal predecessors, (58), 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-13 09:51:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:51:43,948 INFO L93 Difference]: Finished difference Result 95 states and 132 transitions. [2024-09-13 09:51:43,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 09:51:43,951 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-13 09:51:43,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:51:43,956 INFO L225 Difference]: With dead ends: 95 [2024-09-13 09:51:43,956 INFO L226 Difference]: Without dead ends: 50 [2024-09-13 09:51:43,958 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-13 09:51:43,961 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 42 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 09:51:43,962 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 91 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 09:51:43,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-09-13 09:51:44,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2024-09-13 09:51:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 38 states have internal predecessors, (45), 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-13 09:51:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2024-09-13 09:51:44,006 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 18 [2024-09-13 09:51:44,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:51:44,007 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2024-09-13 09:51:44,007 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-13 09:51:44,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:51:44,008 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2024-09-13 09:51:44,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-13 09:51:44,010 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:51:44,010 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-13 09:51:44,010 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 09:51:44,010 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:51:44,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:51:44,011 INFO L85 PathProgramCache]: Analyzing trace with hash 961728510, now seen corresponding path program 1 times [2024-09-13 09:51:44,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:51:44,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051506656] [2024-09-13 09:51:44,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:51:44,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:51:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:44,264 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:51:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:44,274 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:51:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:44,442 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 09:51:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:44,514 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-13 09:51:44,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:51:44,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051506656] [2024-09-13 09:51:44,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051506656] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 09:51:44,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700034059] [2024-09-13 09:51:44,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:51:44,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:51:44,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:51:44,517 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-13 09:51:44,519 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-13 09:51:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:44,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-13 09:51:44,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:51:44,641 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-13 09:51:44,642 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 09:51:44,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700034059] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:51:44,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 09:51:44,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-09-13 09:51:44,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429802343] [2024-09-13 09:51:44,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:51:44,644 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 09:51:44,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:51:44,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 09:51:44,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-09-13 09:51:44,646 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-13 09:51:44,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:51:44,663 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2024-09-13 09:51:44,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 09:51:44,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 23 [2024-09-13 09:51:44,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:51:44,666 INFO L225 Difference]: With dead ends: 52 [2024-09-13 09:51:44,666 INFO L226 Difference]: Without dead ends: 42 [2024-09-13 09:51:44,667 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-09-13 09:51:44,668 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 09:51:44,669 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 72 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 09:51:44,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-13 09:51:44,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-09-13 09:51:44,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.3) internal successors, (39), 33 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-13 09:51:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2024-09-13 09:51:44,682 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 23 [2024-09-13 09:51:44,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:51:44,683 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2024-09-13 09:51:44,683 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-13 09:51:44,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:51:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2024-09-13 09:51:44,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 09:51:44,685 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:51:44,686 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-13 09:51:44,699 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 09:51:44,886 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:51:44,887 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:51:44,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:51:44,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1948863173, now seen corresponding path program 1 times [2024-09-13 09:51:44,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:51:44,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486596512] [2024-09-13 09:51:44,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:51:44,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:51:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:44,938 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:51:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:44,949 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:51:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:44,959 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 09:51:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:44,964 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-13 09:51:44,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:51:44,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486596512] [2024-09-13 09:51:44,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486596512] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:51:44,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:51:44,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 09:51:44,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068804332] [2024-09-13 09:51:44,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:51:44,967 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 09:51:44,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:51:44,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 09:51:44,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 09:51:44,968 INFO L87 Difference]: Start difference. First operand 40 states and 47 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-13 09:51:45,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:51:45,125 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2024-09-13 09:51:45,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 09:51:45,125 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-13 09:51:45,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:51:45,127 INFO L225 Difference]: With dead ends: 68 [2024-09-13 09:51:45,127 INFO L226 Difference]: Without dead ends: 47 [2024-09-13 09:51:45,127 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-13 09:51:45,128 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 09:51:45,129 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 49 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 09:51:45,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-13 09:51:45,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-09-13 09:51:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 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-13 09:51:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-09-13 09:51:45,139 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 24 [2024-09-13 09:51:45,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:51:45,140 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-09-13 09:51:45,140 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-13 09:51:45,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:51:45,140 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-09-13 09:51:45,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 09:51:45,141 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:51:45,141 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-13 09:51:45,141 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 09:51:45,141 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:51:45,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:51:45,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1884186912, now seen corresponding path program 1 times [2024-09-13 09:51:45,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:51:45,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848715725] [2024-09-13 09:51:45,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:51:45,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:51:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:45,203 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:51:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:45,214 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:51:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:45,222 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 09:51:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:45,228 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-13 09:51:45,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:51:45,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848715725] [2024-09-13 09:51:45,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848715725] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:51:45,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:51:45,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-13 09:51:45,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117569648] [2024-09-13 09:51:45,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:51:45,231 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 09:51:45,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:51:45,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 09:51:45,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-13 09:51:45,232 INFO L87 Difference]: Start difference. First operand 40 states and 46 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-13 09:51:45,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:51:45,382 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-09-13 09:51:45,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 09:51:45,383 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-13 09:51:45,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:51:45,384 INFO L225 Difference]: With dead ends: 44 [2024-09-13 09:51:45,384 INFO L226 Difference]: Without dead ends: 42 [2024-09-13 09:51:45,384 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-13 09:51:45,385 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 09:51:45,386 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 81 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 09:51:45,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-13 09:51:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-09-13 09:51:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.25) internal successors, (40), 35 states have internal predecessors, (40), 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-13 09:51:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-09-13 09:51:45,397 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 24 [2024-09-13 09:51:45,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:51:45,397 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-09-13 09:51:45,397 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-13 09:51:45,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:51:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-09-13 09:51:45,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-13 09:51:45,399 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:51:45,399 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-13 09:51:45,399 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 09:51:45,399 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:51:45,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:51:45,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1661598731, now seen corresponding path program 1 times [2024-09-13 09:51:45,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:51:45,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487144668] [2024-09-13 09:51:45,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:51:45,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:51:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:45,434 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:51:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:45,444 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:51:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:45,461 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 09:51:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:45,466 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-13 09:51:45,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:51:45,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487144668] [2024-09-13 09:51:45,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487144668] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:51:45,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:51:45,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 09:51:45,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462825537] [2024-09-13 09:51:45,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:51:45,467 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 09:51:45,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:51:45,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 09:51:45,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 09:51:45,468 INFO L87 Difference]: Start difference. First operand 42 states and 48 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-13 09:51:45,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:51:45,601 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2024-09-13 09:51:45,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 09:51:45,602 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-13 09:51:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:51:45,603 INFO L225 Difference]: With dead ends: 64 [2024-09-13 09:51:45,603 INFO L226 Difference]: Without dead ends: 43 [2024-09-13 09:51:45,603 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-13 09:51:45,604 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 09:51:45,604 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 49 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 09:51:45,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-13 09:51:45,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2024-09-13 09:51:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 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-13 09:51:45,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-09-13 09:51:45,620 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 25 [2024-09-13 09:51:45,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:51:45,622 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-09-13 09:51:45,622 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-13 09:51:45,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:51:45,622 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-09-13 09:51:45,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-13 09:51:45,624 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:51:45,624 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-13 09:51:45,624 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 09:51:45,624 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:51:45,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:51:45,625 INFO L85 PathProgramCache]: Analyzing trace with hash -898416001, now seen corresponding path program 1 times [2024-09-13 09:51:45,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:51:45,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579287585] [2024-09-13 09:51:45,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:51:45,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:51:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:45,860 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:51:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:45,870 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:51:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:46,051 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 09:51:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:46,131 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-13 09:51:46,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:51:46,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579287585] [2024-09-13 09:51:46,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579287585] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 09:51:46,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906555182] [2024-09-13 09:51:46,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:51:46,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:51:46,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:51:46,134 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-13 09:51:46,136 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-13 09:51:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:46,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-13 09:51:46,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:51:46,455 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-13 09:51:46,455 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 09:51:46,887 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-13 09:51:46,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906555182] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 09:51:46,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 09:51:46,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 24 [2024-09-13 09:51:46,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161939234] [2024-09-13 09:51:46,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 09:51:46,889 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-13 09:51:46,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:51:46,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-13 09:51:46,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2024-09-13 09:51:46,890 INFO L87 Difference]: Start difference. First operand 37 states and 42 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-13 09:51:47,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:51:47,494 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2024-09-13 09:51:47,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-13 09:51:47,495 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-13 09:51:47,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:51:47,496 INFO L225 Difference]: With dead ends: 72 [2024-09-13 09:51:47,497 INFO L226 Difference]: Without dead ends: 48 [2024-09-13 09:51:47,498 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=216, Invalid=1044, Unknown=0, NotChecked=0, Total=1260 [2024-09-13 09:51:47,499 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 09:51:47,499 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 252 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 09:51:47,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-13 09:51:47,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2024-09-13 09:51:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 35 states have internal predecessors, (40), 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-13 09:51:47,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-09-13 09:51:47,520 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 30 [2024-09-13 09:51:47,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:51:47,520 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-09-13 09:51:47,521 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-13 09:51:47,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:51:47,523 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-09-13 09:51:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-13 09:51:47,524 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:51:47,524 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-13 09:51:47,542 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 09:51:47,724 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-13 09:51:47,726 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:51:47,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:51:47,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1700403000, now seen corresponding path program 2 times [2024-09-13 09:51:47,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:51:47,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232971163] [2024-09-13 09:51:47,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:51:47,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:51:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:48,428 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:51:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:48,437 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:51:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:48,801 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 09:51:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:49,161 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 09:51:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:49,346 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 09:51:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:49,516 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 09:51:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:49,588 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-13 09:51:49,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:51:49,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232971163] [2024-09-13 09:51:49,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232971163] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 09:51:49,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634713864] [2024-09-13 09:51:49,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 09:51:49,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:51:49,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:51:49,591 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 09:51:49,593 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-13 09:51:49,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-13 09:51:49,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 09:51:49,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-13 09:51:49,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:51:50,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-13 09:51:50,955 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-13 09:51:50,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-13 09:51:50,959 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-13 09:51:50,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-13 09:51:50,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-13 09:51:50,978 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 521 treesize of output 287 [2024-09-13 09:51:51,466 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-13 09:51:51,467 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 09:51:51,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634713864] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:51:51,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 09:51:51,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2024-09-13 09:51:51,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758145390] [2024-09-13 09:51:51,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:51:51,468 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-13 09:51:51,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:51:51,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-13 09:51:51,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2024-09-13 09:51:51,470 INFO L87 Difference]: Start difference. First operand 46 states and 52 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-13 09:51:51,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:51:51,719 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2024-09-13 09:51:51,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-13 09:51:51,719 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-13 09:51:51,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:51:51,720 INFO L225 Difference]: With dead ends: 62 [2024-09-13 09:51:51,720 INFO L226 Difference]: Without dead ends: 41 [2024-09-13 09:51:51,721 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-13 09:51:51,722 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 09:51:51,722 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 63 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 09:51:51,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-13 09:51:51,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-09-13 09:51:51,738 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-13 09:51:51,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-09-13 09:51:51,739 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 45 [2024-09-13 09:51:51,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:51:51,740 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-09-13 09:51:51,740 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-13 09:51:51,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:51:51,741 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-09-13 09:51:51,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-13 09:51:51,743 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:51:51,743 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-13 09:51:51,759 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-13 09:51:51,943 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-13 09:51:51,944 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:51:51,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:51:51,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1823753126, now seen corresponding path program 1 times [2024-09-13 09:51:51,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:51:51,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282311325] [2024-09-13 09:51:51,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:51:51,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:51:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:52,061 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:51:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:52,072 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:51:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:52,085 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 09:51:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:52,095 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 09:51:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:52,106 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 09:51:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:52,110 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 09:51:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:51:52,113 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-13 09:51:52,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:51:52,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282311325] [2024-09-13 09:51:52,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282311325] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:51:52,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:51:52,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-13 09:51:52,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959186335] [2024-09-13 09:51:52,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:51:52,115 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-13 09:51:52,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:51:52,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-13 09:51:52,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-13 09:51:52,117 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-13 09:51:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:51:52,244 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2024-09-13 09:51:52,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-13 09:51:52,244 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-13 09:51:52,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:51:52,245 INFO L225 Difference]: With dead ends: 39 [2024-09-13 09:51:52,245 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 09:51:52,245 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-13 09:51:52,247 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-13 09:51:52,247 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-13 09:51:52,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 09:51:52,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 09:51:52,248 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-13 09:51:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 09:51:52,248 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2024-09-13 09:51:52,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:51:52,250 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 09:51:52,250 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-13 09:51:52,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:51:52,250 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 09:51:52,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 09:51:52,253 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-09-13 09:51:52,253 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-09-13 09:51:52,254 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-09-13 09:51:52,254 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-09-13 09:51:52,254 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-13 09:51:52,257 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-09-13 09:51:52,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-13 09:51:52,719 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 09:51:52,734 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-13 09:51:52,736 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-13 09:51:52,737 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-13 09:51:52,737 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-13 09:51:52,741 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-13 09:51:52,742 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-13 09:51:52,742 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-13 09:51:52,742 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-13 09:51:52,743 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-13 09:51:52,745 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-13 09:51:52,745 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-13 09:51:52,745 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-13 09:51:52,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 09:51:52 BoogieIcfgContainer [2024-09-13 09:51:52,752 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 09:51:52,753 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-13 09:51:52,753 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-13 09:51:52,753 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-13 09:51:52,753 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 09:51:42" (3/4) ... [2024-09-13 09:51:52,756 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-13 09:51:52,759 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-13 09:51:52,759 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_22_0 [2024-09-13 09:51:52,760 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-13 09:51:52,766 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-09-13 09:51:52,766 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-09-13 09:51:52,766 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-13 09:51:52,766 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-13 09:51:52,794 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((__tmp_155_0 == \old(__tmp_155_0)) && (main____CPAchecker_TMP_0 == 1)) && (((long long) (main__index1 % 4294967296) + 1) <= (main__index2 % 4294967296))) && (main__loop_entered == 0)) && (main__index2 <= (((main__index2 / 4294967296) * 4294967296) + 99999))) [2024-09-13 09:51:52,879 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-13 09:51:52,879 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-13 09:51:52,879 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-13 09:51:52,880 INFO L158 Benchmark]: Toolchain (without parser) took 11174.53ms. Allocated memory was 146.8MB in the beginning and 346.0MB in the end (delta: 199.2MB). Free memory was 73.6MB in the beginning and 218.9MB in the end (delta: -145.3MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. [2024-09-13 09:51:52,880 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 97.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 09:51:52,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.70ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 73.5MB in the beginning and 167.2MB in the end (delta: -93.8MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-09-13 09:51:52,880 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.92ms. Allocated memory is still 199.2MB. Free memory was 167.2MB in the beginning and 166.4MB in the end (delta: 853.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 09:51:52,880 INFO L158 Benchmark]: Boogie Preprocessor took 58.69ms. Allocated memory is still 199.2MB. Free memory was 166.4MB in the beginning and 164.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 09:51:52,881 INFO L158 Benchmark]: RCFGBuilder took 502.80ms. Allocated memory is still 199.2MB. Free memory was 164.3MB in the beginning and 144.3MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-09-13 09:51:52,881 INFO L158 Benchmark]: TraceAbstraction took 10134.40ms. Allocated memory was 199.2MB in the beginning and 346.0MB in the end (delta: 146.8MB). Free memory was 144.3MB in the beginning and 224.1MB in the end (delta: -79.8MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. [2024-09-13 09:51:52,881 INFO L158 Benchmark]: Witness Printer took 126.53ms. Allocated memory is still 346.0MB. Free memory was 224.1MB in the beginning and 218.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-13 09:51:52,884 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 97.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.70ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 73.5MB in the beginning and 167.2MB in the end (delta: -93.8MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.92ms. Allocated memory is still 199.2MB. Free memory was 167.2MB in the beginning and 166.4MB in the end (delta: 853.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.69ms. Allocated memory is still 199.2MB. Free memory was 166.4MB in the beginning and 164.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 502.80ms. Allocated memory is still 199.2MB. Free memory was 164.3MB in the beginning and 144.3MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10134.40ms. Allocated memory was 199.2MB in the beginning and 346.0MB in the end (delta: 146.8MB). Free memory was 144.3MB in the beginning and 224.1MB in the end (delta: -79.8MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. * Witness Printer took 126.53ms. Allocated memory is still 346.0MB. Free memory was 224.1MB in the beginning and 218.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] * 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: 167]: 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: 233]: 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, 48 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 254 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 244 mSDsluCounter, 695 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 514 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 983 IncrementalHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 181 mSDtfsCounter, 983 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, InterpolantAutomatonStates: 68, 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.5s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 333 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 351 ConstructedInterpolants, 0 QuantifiedInterpolants, 1634 SizeOfPredicates, 12 NumberOfNonLiveVariables, 486 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 121/170 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 4 specifications checked. All of them hold - InvariantResult [Line: 111]: Location Invariant Derived location invariant: ((((main____CPAchecker_TMP_0 != 0) && ((((long long) main__index2 + 1) % 4294967296) <= 99999)) && (((long long) (main__index1 % 4294967296) + 1) <= (main__index2 % 4294967296))) && ((((4294967295 + main__index1) % 4294967296) + 1) <= (((long long) main__index2 + 1) % 4294967296))) - InvariantResult [Line: 152]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 93]: Location Invariant Derived location invariant: ((((long long) (main__index1 % 4294967296) + 1) <= (main__index2 % 4294967296)) && ((main__index2 % 4294967296) <= 99999)) - InvariantResult [Line: 157]: 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 % 4294967296) + 1) <= (main__index2 % 4294967296)) && ((main__index2 % 4294967296) <= 99999))) - InvariantResult [Line: 69]: Location Invariant Derived location invariant: (((((long long) main__index2 + 1) % 4294967296) <= 99999) && ((((4294967295 + main__index1) % 4294967296) + 1) <= (((long long) main__index2 + 1) % 4294967296))) - 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 % 4294967296) + 1) <= (main__index2 % 4294967296))) && (main__loop_entered == 0)) && (main__index2 <= (((main__index2 / 4294967296) * 4294967296) + 99999))) - InvariantResult [Line: 109]: Location Invariant Derived location invariant: 0 RESULT: Ultimate proved your program to be correct! [2024-09-13 09:51:52,917 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE