./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.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 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-25 00:12:31,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:12:31,916 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 00:12:31,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:12:31,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:12:31,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:12:31,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:12:31,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:12:31,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:12:31,953 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:12:31,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:12:31,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:12:31,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:12:31,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:12:31,957 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:12:31,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:12:31,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:12:31,958 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:12:31,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 00:12:31,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:12:31,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:12:31,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:12:31,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:12:31,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:12:31,963 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:12:31,963 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:12:31,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:12:31,964 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:12:31,964 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:12:31,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:12:31,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:12:31,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:12:31,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:12:31,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:12:31,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:12:31,965 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:12:31,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 00:12:31,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 00:12:31,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:12:31,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:12:31,969 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:12:31,969 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:12:31,976 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 -> 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 00:12:32,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:12:32,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:12:32,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:12:32,311 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:12:32,312 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:12:32,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2024-09-25 00:12:33,837 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:12:34,051 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:12:34,052 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2024-09-25 00:12:34,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a5e52575c/2ddd87f1b8374acaae28174b02ee2970/FLAGaa56b3ccf [2024-09-25 00:12:34,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a5e52575c/2ddd87f1b8374acaae28174b02ee2970 [2024-09-25 00:12:34,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:12:34,081 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:12:34,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:12:34,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:12:34,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:12:34,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:12:34" (1/1) ... [2024-09-25 00:12:34,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113f49fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:12:34, skipping insertion in model container [2024-09-25 00:12:34,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:12:34" (1/1) ... [2024-09-25 00:12:34,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:12:34,316 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2024-09-25 00:12:34,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:12:34,345 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:12:34,361 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2024-09-25 00:12:34,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:12:34,380 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:12:34,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:12:34 WrapperNode [2024-09-25 00:12:34,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:12:34,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:12:34,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:12:34,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:12:34,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:12:34" (1/1) ... [2024-09-25 00:12:34,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:12:34" (1/1) ... [2024-09-25 00:12:34,408 INFO L138 Inliner]: procedures = 13, calls = 29, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:12:34,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:12:34,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:12:34,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:12:34,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:12:34,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:12:34" (1/1) ... [2024-09-25 00:12:34,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:12:34" (1/1) ... [2024-09-25 00:12:34,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:12:34" (1/1) ... [2024-09-25 00:12:34,445 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 6, 6]. 43 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 1]. The 4 writes are split as follows [0, 2, 2]. [2024-09-25 00:12:34,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:12:34" (1/1) ... [2024-09-25 00:12:34,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:12:34" (1/1) ... [2024-09-25 00:12:34,451 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:12:34" (1/1) ... [2024-09-25 00:12:34,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:12:34" (1/1) ... [2024-09-25 00:12:34,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:12:34" (1/1) ... [2024-09-25 00:12:34,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:12:34" (1/1) ... [2024-09-25 00:12:34,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:12:34,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:12:34,468 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:12:34,468 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:12:34,469 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:12:34" (1/1) ... [2024-09-25 00:12:34,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:12:34,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:12:34,516 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 00:12:34,522 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 00:12:34,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:12:34,573 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:12:34,573 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:12:34,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 00:12:34,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-25 00:12:34,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-25 00:12:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-25 00:12:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-25 00:12:34,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-25 00:12:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-25 00:12:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:12:34,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:12:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2024-09-25 00:12:34,577 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2024-09-25 00:12:34,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:12:34,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:12:34,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-25 00:12:34,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-25 00:12:34,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-25 00:12:34,578 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2024-09-25 00:12:34,578 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2024-09-25 00:12:34,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-25 00:12:34,671 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:12:34,674 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:12:34,867 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-25 00:12:34,868 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:12:34,903 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:12:34,903 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 00:12:34,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:12:34 BoogieIcfgContainer [2024-09-25 00:12:34,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:12:34,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:12:34,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:12:34,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:12:34,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:12:34" (1/3) ... [2024-09-25 00:12:34,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4392579e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:12:34, skipping insertion in model container [2024-09-25 00:12:34,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:12:34" (2/3) ... [2024-09-25 00:12:34,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4392579e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:12:34, skipping insertion in model container [2024-09-25 00:12:34,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:12:34" (3/3) ... [2024-09-25 00:12:34,917 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2024-09-25 00:12:34,933 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:12:34,933 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 00:12:34,992 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:12:35,002 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;@3c0071d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:12:35,003 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 00:12:35,007 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 00:12:35,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-25 00:12:35,015 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:12:35,016 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:12:35,017 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:12:35,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:12:35,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1880927793, now seen corresponding path program 1 times [2024-09-25 00:12:35,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:12:35,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527645408] [2024-09-25 00:12:35,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:12:35,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:12:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:35,489 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:12:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:35,524 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:12:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:35,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:12:35,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:12:35,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527645408] [2024-09-25 00:12:35,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527645408] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:12:35,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:12:35,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 00:12:35,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298649689] [2024-09-25 00:12:35,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:12:35,652 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 00:12:35,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:12:35,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 00:12:35,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 00:12:35,685 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:12:35,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:12:35,863 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-09-25 00:12:35,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 00:12:35,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 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 14 [2024-09-25 00:12:35,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:12:35,876 INFO L225 Difference]: With dead ends: 40 [2024-09-25 00:12:35,879 INFO L226 Difference]: Without dead ends: 27 [2024-09-25 00:12:35,882 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-25 00:12:35,887 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:12:35,888 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 63 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:12:35,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-25 00:12:35,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2024-09-25 00:12:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-25 00:12:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-09-25 00:12:35,940 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2024-09-25 00:12:35,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:12:35,940 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-09-25 00:12:35,941 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:12:35,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:12:35,942 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-09-25 00:12:35,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-25 00:12:35,945 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:12:35,945 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:12:35,946 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 00:12:35,946 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:12:35,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:12:35,946 INFO L85 PathProgramCache]: Analyzing trace with hash 259605890, now seen corresponding path program 1 times [2024-09-25 00:12:35,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:12:35,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833153231] [2024-09-25 00:12:35,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:12:35,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:12:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:36,189 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:12:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:36,213 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:12:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:36,338 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:36,397 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-25 00:12:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 00:12:36,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:12:36,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833153231] [2024-09-25 00:12:36,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833153231] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:12:36,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:12:36,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 00:12:36,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45157111] [2024-09-25 00:12:36,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:12:36,411 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 00:12:36,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:12:36,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 00:12:36,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-25 00:12:36,414 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 00:12:36,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:12:36,569 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2024-09-25 00:12:36,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 00:12:36,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2024-09-25 00:12:36,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:12:36,574 INFO L225 Difference]: With dead ends: 46 [2024-09-25 00:12:36,574 INFO L226 Difference]: Without dead ends: 27 [2024-09-25 00:12:36,575 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-09-25 00:12:36,576 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:12:36,576 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:12:36,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-25 00:12:36,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-25 00:12:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-09-25 00:12:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-09-25 00:12:36,588 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 25 [2024-09-25 00:12:36,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:12:36,588 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-09-25 00:12:36,588 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 00:12:36,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:12:36,589 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-09-25 00:12:36,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-25 00:12:36,590 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:12:36,590 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:12:36,590 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 00:12:36,590 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:12:36,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:12:36,591 INFO L85 PathProgramCache]: Analyzing trace with hash 889705653, now seen corresponding path program 1 times [2024-09-25 00:12:36,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:12:36,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188652902] [2024-09-25 00:12:36,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:12:36,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:12:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:36,855 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:12:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:36,873 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:12:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:37,008 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:37,167 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:37,235 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 00:12:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 00:12:37,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:12:37,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188652902] [2024-09-25 00:12:37,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188652902] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:12:37,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767036467] [2024-09-25 00:12:37,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:12:37,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:12:37,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:12:37,246 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:12:37,247 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 00:12:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:37,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-09-25 00:12:37,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:12:37,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-25 00:12:37,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-09-25 00:12:37,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 00:12:37,637 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:12:38,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 00:12:38,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767036467] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:12:38,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:12:38,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2024-09-25 00:12:38,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872655712] [2024-09-25 00:12:38,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:12:38,240 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-25 00:12:38,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:12:38,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-25 00:12:38,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-09-25 00:12:38,244 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 23 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 8 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (10), 4 states have call predecessors, (10), 8 states have call successors, (10) [2024-09-25 00:12:38,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:12:38,533 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2024-09-25 00:12:38,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-25 00:12:38,534 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 8 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (10), 4 states have call predecessors, (10), 8 states have call successors, (10) Word has length 30 [2024-09-25 00:12:38,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:12:38,536 INFO L225 Difference]: With dead ends: 50 [2024-09-25 00:12:38,536 INFO L226 Difference]: Without dead ends: 29 [2024-09-25 00:12:38,537 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2024-09-25 00:12:38,538 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:12:38,539 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 109 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:12:38,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-25 00:12:38,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-25 00:12:38,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-25 00:12:38,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-09-25 00:12:38,547 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 30 [2024-09-25 00:12:38,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:12:38,547 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-09-25 00:12:38,548 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 8 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (10), 4 states have call predecessors, (10), 8 states have call successors, (10) [2024-09-25 00:12:38,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:12:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-09-25 00:12:38,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-25 00:12:38,549 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:12:38,549 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:12:38,569 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-25 00:12:38,750 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:12:38,750 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:12:38,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:12:38,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1706437626, now seen corresponding path program 2 times [2024-09-25 00:12:38,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:12:38,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22984571] [2024-09-25 00:12:38,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:12:38,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:12:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:39,027 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:12:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:39,035 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:12:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:39,186 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:39,317 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:39,397 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:39,435 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 00:12:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-25 00:12:39,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:12:39,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22984571] [2024-09-25 00:12:39,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22984571] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:12:39,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572489355] [2024-09-25 00:12:39,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:12:39,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:12:39,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:12:39,443 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:12:39,446 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 00:12:39,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:12:39,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:12:39,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-25 00:12:39,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:12:39,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-25 00:12:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-25 00:12:39,720 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:12:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-25 00:12:40,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572489355] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:12:40,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:12:40,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 26 [2024-09-25 00:12:40,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243127363] [2024-09-25 00:12:40,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:12:40,172 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-25 00:12:40,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:12:40,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-25 00:12:40,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2024-09-25 00:12:40,176 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 26 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 10 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2024-09-25 00:12:40,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:12:40,563 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2024-09-25 00:12:40,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 00:12:40,564 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 10 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) Word has length 35 [2024-09-25 00:12:40,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:12:40,565 INFO L225 Difference]: With dead ends: 56 [2024-09-25 00:12:40,565 INFO L226 Difference]: Without dead ends: 33 [2024-09-25 00:12:40,566 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2024-09-25 00:12:40,567 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 44 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:12:40,568 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 87 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:12:40,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-25 00:12:40,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-09-25 00:12:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2024-09-25 00:12:40,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-09-25 00:12:40,581 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 35 [2024-09-25 00:12:40,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:12:40,581 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-09-25 00:12:40,581 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 10 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2024-09-25 00:12:40,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:12:40,582 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-09-25 00:12:40,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-09-25 00:12:40,585 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:12:40,585 INFO L216 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:12:40,605 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 00:12:40,791 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:12:40,792 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:12:40,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:12:40,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1700016267, now seen corresponding path program 3 times [2024-09-25 00:12:40,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:12:40,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261385933] [2024-09-25 00:12:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:12:40,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:12:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:41,209 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:12:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:41,216 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:12:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:41,518 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:41,677 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:41,808 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:41,890 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:41,935 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:12:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:41,947 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:41,954 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:41,961 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:41,966 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:41,969 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:12:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 8 proven. 75 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-09-25 00:12:41,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:12:41,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261385933] [2024-09-25 00:12:41,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261385933] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:12:41,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429010590] [2024-09-25 00:12:41,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 00:12:41,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:12:41,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:12:41,975 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-25 00:12:41,977 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-25 00:12:42,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-25 00:12:42,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:12:42,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-09-25 00:12:42,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:12:42,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-25 00:12:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-09-25 00:12:42,331 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:12:43,176 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-09-25 00:12:43,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429010590] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:12:43,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:12:43,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 14] total 34 [2024-09-25 00:12:43,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583901246] [2024-09-25 00:12:43,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:12:43,177 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-09-25 00:12:43,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:12:43,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-09-25 00:12:43,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2024-09-25 00:12:43,179 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 34 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 28 states have internal predecessors, (50), 13 states have call successors, (19), 7 states have call predecessors, (19), 12 states have return successors, (19), 12 states have call predecessors, (19), 13 states have call successors, (19) [2024-09-25 00:12:43,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:12:43,680 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2024-09-25 00:12:43,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-25 00:12:43,682 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 28 states have internal predecessors, (50), 13 states have call successors, (19), 7 states have call predecessors, (19), 12 states have return successors, (19), 12 states have call predecessors, (19), 13 states have call successors, (19) Word has length 66 [2024-09-25 00:12:43,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:12:43,684 INFO L225 Difference]: With dead ends: 64 [2024-09-25 00:12:43,684 INFO L226 Difference]: Without dead ends: 37 [2024-09-25 00:12:43,685 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=286, Invalid=1694, Unknown=0, NotChecked=0, Total=1980 [2024-09-25 00:12:43,686 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 43 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 00:12:43,686 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 148 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 00:12:43,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-25 00:12:43,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-25 00:12:43,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 10 states have return successors, (12), 10 states have call predecessors, (12), 5 states have call successors, (12) [2024-09-25 00:12:43,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-09-25 00:12:43,698 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 66 [2024-09-25 00:12:43,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:12:43,698 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-09-25 00:12:43,698 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 28 states have internal predecessors, (50), 13 states have call successors, (19), 7 states have call predecessors, (19), 12 states have return successors, (19), 12 states have call predecessors, (19), 13 states have call successors, (19) [2024-09-25 00:12:43,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:12:43,699 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-09-25 00:12:43,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-09-25 00:12:43,700 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:12:43,700 INFO L216 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:12:43,719 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 00:12:43,904 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:12:43,905 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:12:43,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:12:43,905 INFO L85 PathProgramCache]: Analyzing trace with hash -515831498, now seen corresponding path program 4 times [2024-09-25 00:12:43,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:12:43,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910240808] [2024-09-25 00:12:43,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:12:43,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:12:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:44,566 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:12:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:44,573 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:12:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:45,080 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:45,286 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:45,437 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:45,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:45,592 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:45,636 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 00:12:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:45,662 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:45,671 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:45,677 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:45,682 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:45,685 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:45,688 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 00:12:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:45,696 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:45,702 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:45,708 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:45,712 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:45,715 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:45,717 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 00:12:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 12 proven. 212 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2024-09-25 00:12:45,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:12:45,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910240808] [2024-09-25 00:12:45,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910240808] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:12:45,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931077116] [2024-09-25 00:12:45,720 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 00:12:45,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:12:45,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:12:45,721 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:12:45,722 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 00:12:45,851 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 00:12:45,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:12:45,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-09-25 00:12:45,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:12:45,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-25 00:12:46,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-09-25 00:12:46,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-09-25 00:12:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-09-25 00:12:46,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:12:46,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-09-25 00:12:46,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931077116] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:12:46,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:12:46,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2024-09-25 00:12:46,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182548752] [2024-09-25 00:12:46,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 00:12:46,821 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 00:12:46,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:12:46,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 00:12:46,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2024-09-25 00:12:46,823 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 24 states, 19 states have (on average 2.263157894736842) internal successors, (43), 21 states have internal predecessors, (43), 9 states have call successors, (15), 4 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 9 states have call successors, (16) [2024-09-25 00:12:47,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:12:47,287 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2024-09-25 00:12:47,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-25 00:12:47,287 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 2.263157894736842) internal successors, (43), 21 states have internal predecessors, (43), 9 states have call successors, (15), 4 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 9 states have call successors, (16) Word has length 107 [2024-09-25 00:12:47,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:12:47,288 INFO L225 Difference]: With dead ends: 75 [2024-09-25 00:12:47,289 INFO L226 Difference]: Without dead ends: 44 [2024-09-25 00:12:47,290 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2024-09-25 00:12:47,290 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:12:47,291 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 99 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:12:47,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-25 00:12:47,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-09-25 00:12:47,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 12 states have return successors, (15), 13 states have call predecessors, (15), 5 states have call successors, (15) [2024-09-25 00:12:47,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-09-25 00:12:47,300 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 107 [2024-09-25 00:12:47,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:12:47,300 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-09-25 00:12:47,301 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 2.263157894736842) internal successors, (43), 21 states have internal predecessors, (43), 9 states have call successors, (15), 4 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 9 states have call successors, (16) [2024-09-25 00:12:47,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:12:47,301 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-09-25 00:12:47,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-09-25 00:12:47,302 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:12:47,302 INFO L216 NwaCegarLoop]: trace histogram [18, 18, 15, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:12:47,318 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 00:12:47,506 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:12:47,507 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:12:47,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:12:47,507 INFO L85 PathProgramCache]: Analyzing trace with hash -313299501, now seen corresponding path program 1 times [2024-09-25 00:12:47,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:12:47,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302029927] [2024-09-25 00:12:47,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:12:47,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:12:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:48,310 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:12:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:48,317 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:12:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:48,937 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,150 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,335 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,466 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,542 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,606 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,644 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 00:12:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,666 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,673 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,680 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,685 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,690 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,693 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,697 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 00:12:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,710 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,720 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,729 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,736 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,742 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,747 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,750 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 00:12:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,753 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 14 proven. 307 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2024-09-25 00:12:49,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:12:49,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302029927] [2024-09-25 00:12:49,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302029927] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:12:49,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835502295] [2024-09-25 00:12:49,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:12:49,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:12:49,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:12:49,756 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:12:49,758 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 00:12:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:49,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-09-25 00:12:49,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:12:49,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-25 00:12:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2024-09-25 00:12:50,223 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:12:51,464 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 717 trivial. 0 not checked. [2024-09-25 00:12:51,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835502295] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:12:51,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:12:51,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 18] total 41 [2024-09-25 00:12:51,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171432598] [2024-09-25 00:12:51,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:12:51,466 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-09-25 00:12:51,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:12:51,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-09-25 00:12:51,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1428, Unknown=0, NotChecked=0, Total=1640 [2024-09-25 00:12:51,468 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 41 states, 32 states have (on average 1.78125) internal successors, (57), 34 states have internal predecessors, (57), 15 states have call successors, (21), 8 states have call predecessors, (21), 16 states have return successors, (24), 17 states have call predecessors, (24), 15 states have call successors, (24) [2024-09-25 00:12:51,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:12:51,980 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2024-09-25 00:12:51,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-25 00:12:51,985 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 32 states have (on average 1.78125) internal successors, (57), 34 states have internal predecessors, (57), 15 states have call successors, (21), 8 states have call predecessors, (21), 16 states have return successors, (24), 17 states have call predecessors, (24), 15 states have call successors, (24) Word has length 122 [2024-09-25 00:12:51,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:12:51,986 INFO L225 Difference]: With dead ends: 80 [2024-09-25 00:12:51,986 INFO L226 Difference]: Without dead ends: 43 [2024-09-25 00:12:51,987 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=2456, Unknown=0, NotChecked=0, Total=2862 [2024-09-25 00:12:51,993 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 47 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 00:12:51,993 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 178 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 00:12:51,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-25 00:12:52,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-09-25 00:12:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 13 states have return successors, (15), 13 states have call predecessors, (15), 5 states have call successors, (15) [2024-09-25 00:12:52,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-09-25 00:12:52,010 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 122 [2024-09-25 00:12:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:12:52,010 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-09-25 00:12:52,011 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 32 states have (on average 1.78125) internal successors, (57), 34 states have internal predecessors, (57), 15 states have call successors, (21), 8 states have call predecessors, (21), 16 states have return successors, (24), 17 states have call predecessors, (24), 15 states have call successors, (24) [2024-09-25 00:12:52,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:12:52,015 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-09-25 00:12:52,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-09-25 00:12:52,016 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:12:52,016 INFO L216 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:12:52,038 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 00:12:52,216 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 00:12:52,217 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:12:52,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:12:52,217 INFO L85 PathProgramCache]: Analyzing trace with hash -525253801, now seen corresponding path program 5 times [2024-09-25 00:12:52,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:12:52,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93622795] [2024-09-25 00:12:52,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:12:52,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:12:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:53,118 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:12:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:53,127 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:12:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:54,078 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:54,100 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:54,108 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:54,115 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:54,121 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:54,125 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:54,128 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:54,131 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:12:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:54,673 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:54,687 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:54,693 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:54,700 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:54,705 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:54,709 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:54,712 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:54,715 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:12:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:55,000 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:55,014 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:55,022 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:55,028 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:55,034 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:55,039 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:55,042 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:55,045 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:12:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:55,199 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:55,217 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:55,225 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:55,232 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:55,236 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:55,256 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:55,259 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:55,261 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:12:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 1808 trivial. 0 not checked. [2024-09-25 00:12:55,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:12:55,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93622795] [2024-09-25 00:12:55,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93622795] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:12:55,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516030983] [2024-09-25 00:12:55,288 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 00:12:55,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:12:55,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:12:55,293 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:12:55,296 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 00:12:56,102 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2024-09-25 00:12:56,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:12:56,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-09-25 00:12:56,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:12:56,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-25 00:12:56,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-09-25 00:12:56,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-09-25 00:12:56,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1819 trivial. 0 not checked. [2024-09-25 00:12:56,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:12:56,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-09-25 00:12:57,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516030983] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:12:57,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:12:57,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 26 [2024-09-25 00:12:57,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994518406] [2024-09-25 00:12:57,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 00:12:57,072 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-25 00:12:57,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:12:57,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-25 00:12:57,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2024-09-25 00:12:57,074 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 26 states, 20 states have (on average 1.8) internal successors, (36), 22 states have internal predecessors, (36), 10 states have call successors, (14), 4 states have call predecessors, (14), 10 states have return successors, (14), 13 states have call predecessors, (14), 10 states have call successors, (14) [2024-09-25 00:12:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:12:57,395 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2024-09-25 00:12:57,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-25 00:12:57,396 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 20 states have (on average 1.8) internal successors, (36), 22 states have internal predecessors, (36), 10 states have call successors, (14), 4 states have call predecessors, (14), 10 states have return successors, (14), 13 states have call predecessors, (14), 10 states have call successors, (14) Word has length 178 [2024-09-25 00:12:57,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:12:57,398 INFO L225 Difference]: With dead ends: 58 [2024-09-25 00:12:57,398 INFO L226 Difference]: Without dead ends: 55 [2024-09-25 00:12:57,399 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2024-09-25 00:12:57,399 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:12:57,400 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 80 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:12:57,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-25 00:12:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2024-09-25 00:12:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 15 states have return successors, (19), 16 states have call predecessors, (19), 5 states have call successors, (19) [2024-09-25 00:12:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-09-25 00:12:57,418 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 178 [2024-09-25 00:12:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:12:57,419 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-09-25 00:12:57,419 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 20 states have (on average 1.8) internal successors, (36), 22 states have internal predecessors, (36), 10 states have call successors, (14), 4 states have call predecessors, (14), 10 states have return successors, (14), 13 states have call predecessors, (14), 10 states have call successors, (14) [2024-09-25 00:12:57,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:12:57,419 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2024-09-25 00:12:57,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-09-25 00:12:57,424 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:12:57,424 INFO L216 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:12:57,446 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 00:12:57,624 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:12:57,625 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:12:57,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:12:57,625 INFO L85 PathProgramCache]: Analyzing trace with hash -525251879, now seen corresponding path program 2 times [2024-09-25 00:12:57,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:12:57,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223886344] [2024-09-25 00:12:57,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:12:57,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:12:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:58,607 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:12:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:58,615 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:12:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:59,436 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:59,452 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:59,460 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:59,466 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:59,472 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:59,477 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:59,481 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:59,483 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:12:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:59,968 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:59,981 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:59,989 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:59,996 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:00,002 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:00,005 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:00,008 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:00,010 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:13:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:00,300 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:00,313 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:00,324 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:00,333 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:00,340 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:00,347 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:00,351 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:00,354 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:13:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:00,469 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:00,482 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:00,492 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:00,498 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:00,503 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:00,507 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:00,510 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:00,512 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:13:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 1810 trivial. 0 not checked. [2024-09-25 00:13:00,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:13:00,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223886344] [2024-09-25 00:13:00,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223886344] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:13:00,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18297485] [2024-09-25 00:13:00,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:13:00,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:13:00,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:13:00,555 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:13:00,556 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 00:13:00,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:13:00,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:13:00,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-09-25 00:13:00,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:13:00,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-25 00:13:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1822 trivial. 0 not checked. [2024-09-25 00:13:01,133 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:13:02,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1788 trivial. 0 not checked. [2024-09-25 00:13:02,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18297485] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:13:02,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:13:02,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 22] total 42 [2024-09-25 00:13:02,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93386024] [2024-09-25 00:13:02,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:13:02,713 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-09-25 00:13:02,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:13:02,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-09-25 00:13:02,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1417, Unknown=0, NotChecked=0, Total=1722 [2024-09-25 00:13:02,714 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 42 states, 32 states have (on average 1.59375) internal successors, (51), 34 states have internal predecessors, (51), 17 states have call successors, (21), 9 states have call predecessors, (21), 12 states have return successors, (23), 17 states have call predecessors, (23), 17 states have call successors, (23) [2024-09-25 00:13:03,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:13:03,155 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2024-09-25 00:13:03,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-25 00:13:03,156 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 32 states have (on average 1.59375) internal successors, (51), 34 states have internal predecessors, (51), 17 states have call successors, (21), 9 states have call predecessors, (21), 12 states have return successors, (23), 17 states have call predecessors, (23), 17 states have call successors, (23) Word has length 178 [2024-09-25 00:13:03,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:13:03,158 INFO L225 Difference]: With dead ends: 52 [2024-09-25 00:13:03,158 INFO L226 Difference]: Without dead ends: 47 [2024-09-25 00:13:03,159 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 395 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=444, Invalid=2006, Unknown=0, NotChecked=0, Total=2450 [2024-09-25 00:13:03,163 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:13:03,164 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 178 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:13:03,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-25 00:13:03,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-09-25 00:13:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.12) internal successors, (28), 27 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 15 states have return successors, (17), 15 states have call predecessors, (17), 5 states have call successors, (17) [2024-09-25 00:13:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2024-09-25 00:13:03,182 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 178 [2024-09-25 00:13:03,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:13:03,184 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2024-09-25 00:13:03,184 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 32 states have (on average 1.59375) internal successors, (51), 34 states have internal predecessors, (51), 17 states have call successors, (21), 9 states have call predecessors, (21), 12 states have return successors, (23), 17 states have call predecessors, (23), 17 states have call successors, (23) [2024-09-25 00:13:03,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:13:03,185 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2024-09-25 00:13:03,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-09-25 00:13:03,191 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:13:03,191 INFO L216 NwaCegarLoop]: trace histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:13:03,211 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-25 00:13:03,391 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:13:03,392 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:13:03,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:13:03,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1830036763, now seen corresponding path program 6 times [2024-09-25 00:13:03,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:13:03,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654568879] [2024-09-25 00:13:03,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:13:03,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:13:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:04,619 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:13:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:04,628 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:13:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:05,465 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:05,477 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:05,484 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:05,489 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:05,494 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:05,497 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:05,500 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:05,501 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:13:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:06,128 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:06,146 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:06,154 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:06,160 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:06,164 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:06,167 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:06,170 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:06,172 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:13:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:06,797 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:06,812 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:06,818 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:06,822 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:06,825 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:06,828 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:06,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:06,831 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:13:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,183 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,195 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,202 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,208 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,212 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,216 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,219 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,221 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:13:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,449 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,465 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,471 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,476 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,479 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,482 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,484 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:13:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,614 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,723 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,794 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,852 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,895 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,929 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:07,985 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:08,067 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:13:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:08,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 937 proven. 34 refuted. 0 times theorem prover too weak. 3232 trivial. 0 not checked. [2024-09-25 00:13:08,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:13:08,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654568879] [2024-09-25 00:13:08,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654568879] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:13:08,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85281172] [2024-09-25 00:13:08,081 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-25 00:13:08,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:13:08,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:13:08,083 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:13:08,085 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-25 00:13:16,128 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2024-09-25 00:13:16,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:13:16,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 136 conjuncts are in the unsatisfiable core [2024-09-25 00:13:16,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:13:16,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-25 00:13:16,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-09-25 00:13:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 1171 proven. 81 refuted. 0 times theorem prover too weak. 2951 trivial. 0 not checked. [2024-09-25 00:13:16,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:13:17,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-09-25 00:13:18,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-09-25 00:13:18,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-09-25 00:13:18,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-09-25 00:13:19,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-09-25 00:13:19,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85281172] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:13:19,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:13:19,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 25 [2024-09-25 00:13:19,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187263037] [2024-09-25 00:13:19,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 00:13:19,599 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-25 00:13:19,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:13:19,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-25 00:13:19,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2024-09-25 00:13:19,601 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 25 states, 21 states have (on average 2.142857142857143) internal successors, (45), 24 states have internal predecessors, (45), 9 states have call successors, (17), 3 states have call predecessors, (17), 11 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-09-25 00:13:20,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:13:20,113 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2024-09-25 00:13:20,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-25 00:13:20,114 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 2.142857142857143) internal successors, (45), 24 states have internal predecessors, (45), 9 states have call successors, (17), 3 states have call predecessors, (17), 11 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) Word has length 260 [2024-09-25 00:13:20,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:13:20,115 INFO L225 Difference]: With dead ends: 52 [2024-09-25 00:13:20,115 INFO L226 Difference]: Without dead ends: 49 [2024-09-25 00:13:20,116 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=1608, Unknown=0, NotChecked=0, Total=1806 [2024-09-25 00:13:20,116 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:13:20,117 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 226 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:13:20,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-25 00:13:20,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2024-09-25 00:13:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.08) internal successors, (27), 27 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 15 states have return successors, (17), 15 states have call predecessors, (17), 5 states have call successors, (17) [2024-09-25 00:13:20,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2024-09-25 00:13:20,127 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 260 [2024-09-25 00:13:20,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:13:20,128 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-09-25 00:13:20,128 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 2.142857142857143) internal successors, (45), 24 states have internal predecessors, (45), 9 states have call successors, (17), 3 states have call predecessors, (17), 11 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-09-25 00:13:20,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:13:20,128 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2024-09-25 00:13:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-09-25 00:13:20,131 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:13:20,131 INFO L216 NwaCegarLoop]: trace histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:13:20,162 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-25 00:13:20,331 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:13:20,332 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:13:20,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:13:20,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1830038685, now seen corresponding path program 3 times [2024-09-25 00:13:20,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:13:20,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315462513] [2024-09-25 00:13:20,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:13:20,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:13:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:20,958 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:13:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:20,964 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:13:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:21,574 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:21,582 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:21,587 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:21,591 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:21,594 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:21,597 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:21,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:21,600 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:13:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,009 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,020 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,026 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,032 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,037 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,041 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,044 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,046 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:13:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,335 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,343 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,347 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,351 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,354 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,357 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,358 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,359 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:13:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,524 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,535 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,542 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,548 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,553 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,556 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,559 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,561 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:13:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,714 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,727 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,733 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,739 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,746 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,750 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,753 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,757 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:13:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,880 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,895 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,904 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,913 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,918 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,925 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,928 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:13:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,929 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:13:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 4165 trivial. 0 not checked. [2024-09-25 00:13:22,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:13:22,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315462513] [2024-09-25 00:13:22,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315462513] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:13:22,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841435222] [2024-09-25 00:13:22,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 00:13:22,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:13:22,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:13:22,984 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:13:22,986 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-25 00:13:26,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2024-09-25 00:13:26,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:13:26,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-09-25 00:13:26,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:13:26,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-09-25 00:13:26,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 1186 proven. 18 refuted. 0 times theorem prover too weak. 2999 trivial. 0 not checked. [2024-09-25 00:13:26,611 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:13:27,491 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-25 00:13:27,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-09-25 00:13:27,844 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-25 00:13:27,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-09-25 00:13:28,102 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-25 00:13:28,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-09-25 00:13:28,294 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-25 00:13:28,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-09-25 00:13:28,428 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-25 00:13:28,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-09-25 00:13:37,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 6 proven. 38 refuted. 0 times theorem prover too weak. 4159 trivial. 0 not checked. [2024-09-25 00:13:37,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841435222] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:13:37,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:13:37,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 26 [2024-09-25 00:13:37,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937317542] [2024-09-25 00:13:37,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:13:37,169 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-25 00:13:37,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:13:37,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-25 00:13:37,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=565, Unknown=2, NotChecked=0, Total=650 [2024-09-25 00:13:37,170 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 26 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2024-09-25 00:13:41,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-25 00:13:41,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:13:41,539 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2024-09-25 00:13:41,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-25 00:13:41,539 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 260 [2024-09-25 00:13:41,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:13:41,540 INFO L225 Difference]: With dead ends: 51 [2024-09-25 00:13:41,540 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 00:13:41,541 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 607 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=176, Invalid=1012, Unknown=2, NotChecked=0, Total=1190 [2024-09-25 00:13:41,542 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 17 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:13:41,542 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 60 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 327 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2024-09-25 00:13:41,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 00:13:41,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 00:13:41,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-25 00:13:41,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 00:13:41,543 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 260 [2024-09-25 00:13:41,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:13:41,547 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 00:13:41,547 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2024-09-25 00:13:41,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:13:41,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 00:13:41,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 00:13:41,551 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 00:13:41,578 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-25 00:13:41,751 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-25 00:13:41,755 INFO L408 BasicCegarLoop]: Path program histogram: [6, 3, 1, 1] [2024-09-25 00:13:41,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 00:13:43,232 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 00:13:43,238 WARN L155 FloydHoareUtils]: Requires clause for func_to_recursive_line_20_to_21_0 contained old-variable. Original clause: (and (= |#memory_int#2| |old(#memory_int#2)|) (= (select (select |old(#memory_int#2)| |func_to_recursive_line_20_to_21_0_#in~b.base|) |func_to_recursive_line_20_to_21_0_#in~b.offset|) 6) (= |#memory_int#1| |old(#memory_int#1)|)) Eliminated clause: (= (select (select |#memory_int#2| |func_to_recursive_line_20_to_21_0_#in~b.base|) |func_to_recursive_line_20_to_21_0_#in~b.offset|) 6) [2024-09-25 00:13:43,245 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 00:13:43,245 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-25 00:13:43,246 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-09-25 00:13:43,248 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 00:13:43,248 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-25 00:13:43,248 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-09-25 00:13:43,249 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 00:13:43,249 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-25 00:13:43,249 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-09-25 00:13:43,249 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 00:13:43,249 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 00:13:43,249 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 00:13:43,250 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 00:13:43,250 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 00:13:43,250 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-25 00:13:43,250 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-09-25 00:13:43,250 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 00:13:43,250 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-09-25 00:13:43,251 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-09-25 00:13:43,251 WARN L155 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (and (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_int#1| |old(#memory_int#1)|)) Eliminated clause: true [2024-09-25 00:13:43,254 WARN L155 FloydHoareUtils]: Requires clause for func_to_recursive_line_21_to_21_0 contained old-variable. Original clause: (and (= |#memory_int#2| |old(#memory_int#2)|) (exists ((|v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_67| Int) (|v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_67| Int)) (<= (select (select |#memory_int#1| |v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_67|) |v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_67|) 5))) Eliminated clause: (exists ((|v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_67| Int) (|v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_67| Int)) (<= (select (select |#memory_int#1| |v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_67|) |v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_67|) 5)) [2024-09-25 00:13:43,256 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-25 00:13:43,257 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 00:13:43,257 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-25 00:13:43,257 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-09-25 00:13:43,257 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 00:13:43,257 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-09-25 00:13:43,258 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-09-25 00:13:43,258 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 00:13:43,258 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 00:13:43,258 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-25 00:13:43,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 12:13:43 BoogieIcfgContainer [2024-09-25 00:13:43,258 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 00:13:43,259 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 00:13:43,259 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 00:13:43,259 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 00:13:43,260 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:12:34" (3/4) ... [2024-09-25 00:13:43,262 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 00:13:43,313 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 00:13:43,313 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 00:13:43,314 INFO L158 Benchmark]: Toolchain (without parser) took 69232.69ms. Allocated memory was 159.4MB in the beginning and 1.0GB in the end (delta: 857.7MB). Free memory was 82.8MB in the beginning and 385.4MB in the end (delta: -302.6MB). Peak memory consumption was 554.0MB. Max. memory is 16.1GB. [2024-09-25 00:13:43,314 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:13:43,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.09ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 122.2MB in the end (delta: -39.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-25 00:13:43,315 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.76ms. Allocated memory is still 159.4MB. Free memory was 121.6MB in the beginning and 120.9MB in the end (delta: 621.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:13:43,317 INFO L158 Benchmark]: Boogie Preprocessor took 57.62ms. Allocated memory is still 159.4MB. Free memory was 120.9MB in the beginning and 118.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:13:43,317 INFO L158 Benchmark]: RCFGBuilder took 436.07ms. Allocated memory is still 159.4MB. Free memory was 118.8MB in the beginning and 104.8MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-25 00:13:43,318 INFO L158 Benchmark]: TraceAbstraction took 68352.93ms. Allocated memory was 159.4MB in the beginning and 1.0GB in the end (delta: 857.7MB). Free memory was 104.2MB in the beginning and 388.6MB in the end (delta: -284.4MB). Peak memory consumption was 575.6MB. Max. memory is 16.1GB. [2024-09-25 00:13:43,318 INFO L158 Benchmark]: Witness Printer took 54.58ms. Allocated memory is still 1.0GB. Free memory was 387.5MB in the beginning and 385.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:13:43,319 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.22ms. Allocated memory is still 159.4MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.09ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 122.2MB in the end (delta: -39.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.76ms. Allocated memory is still 159.4MB. Free memory was 121.6MB in the beginning and 120.9MB in the end (delta: 621.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.62ms. Allocated memory is still 159.4MB. Free memory was 120.9MB in the beginning and 118.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 436.07ms. Allocated memory is still 159.4MB. Free memory was 118.8MB in the beginning and 104.8MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 68352.93ms. Allocated memory was 159.4MB in the beginning and 1.0GB in the end (delta: 857.7MB). Free memory was 104.2MB in the beginning and 388.6MB in the end (delta: -284.4MB). Peak memory consumption was 575.6MB. Max. memory is 16.1GB. * Witness Printer took 54.58ms. Allocated memory is still 1.0GB. Free memory was 387.5MB in the beginning and 385.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - 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[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - 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[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 69]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.8s, OverallIterations: 11, TraceHistogramMax: 42, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 325 mSDsluCounter, 1292 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1121 mSDsCounter, 232 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3090 IncrementalHoareTripleChecker+Invalid, 3324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 232 mSolverCounterUnsat, 171 mSDtfsCounter, 3090 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2671 GetRequests, 2301 SyntacticMatches, 7 SemanticMatches, 363 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3851 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=8, InterpolantAutomatonStates: 166, 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, 11 MinimizatonAttempts, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 12.1s SatisfiabilityAnalysisTime, 42.9s InterpolantComputationTime, 2511 NumberOfCodeBlocks, 2458 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 3176 ConstructedInterpolants, 38 QuantifiedInterpolants, 10781 SizeOfPredicates, 107 NumberOfNonLiveVariables, 5010 ConjunctsInSsa, 525 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 32994/34038 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-25 00:13:43,369 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE