./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 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-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 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 19:58:34,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 19:58:34,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 19:58:34,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 19:58:34,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 19:58:34,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 19:58:34,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 19:58:34,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 19:58:34,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 19:58:34,472 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 19:58:34,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 19:58:34,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 19:58:34,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 19:58:34,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 19:58:34,477 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 19:58:34,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 19:58:34,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 19:58:34,478 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 19:58:34,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 19:58:34,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 19:58:34,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 19:58:34,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 19:58:34,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 19:58:34,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 19:58:34,481 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 19:58:34,481 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 19:58:34,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 19:58:34,481 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 19:58:34,481 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 19:58:34,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 19:58:34,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 19:58:34,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 19:58:34,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:58:34,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 19:58:34,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 19:58:34,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 19:58:34,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 19:58:34,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 19:58:34,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 19:58:34,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 19:58:34,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 19:58:34,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 19:58:34,487 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.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 19:58:34,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 19:58:34,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 19:58:34,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 19:58:34,824 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 19:58:34,824 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 19:58:34,825 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-12 19:58:36,428 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 19:58:36,619 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 19:58:36,620 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2024-09-12 19:58:36,627 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/4715346df/78be35998050491eadfcc0de32c91134/FLAG33a9acd19 [2024-09-12 19:58:36,639 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/4715346df/78be35998050491eadfcc0de32c91134 [2024-09-12 19:58:36,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 19:58:36,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 19:58:36,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 19:58:36,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 19:58:36,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 19:58:36,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:58:36" (1/1) ... [2024-09-12 19:58:36,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199efbe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:58:36, skipping insertion in model container [2024-09-12 19:58:36,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:58:36" (1/1) ... [2024-09-12 19:58:36,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 19:58:36,858 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2024-09-12 19:58:36,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:58:36,883 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 19:58:36,900 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2024-09-12 19:58:36,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:58:36,918 INFO L204 MainTranslator]: Completed translation [2024-09-12 19:58:36,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:58:36 WrapperNode [2024-09-12 19:58:36,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 19:58:36,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 19:58:36,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 19:58:36,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 19:58:36,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:58:36" (1/1) ... [2024-09-12 19:58:36,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:58:36" (1/1) ... [2024-09-12 19:58:36,943 INFO L138 Inliner]: procedures = 13, calls = 29, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 19:58:36,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 19:58:36,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 19:58:36,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 19:58:36,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 19:58:36,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:58:36" (1/1) ... [2024-09-12 19:58:36,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:58:36" (1/1) ... [2024-09-12 19:58:36,961 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:58:36" (1/1) ... [2024-09-12 19:58:36,980 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-12 19:58:36,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:58:36" (1/1) ... [2024-09-12 19:58:36,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:58:36" (1/1) ... [2024-09-12 19:58:36,986 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:58:36" (1/1) ... [2024-09-12 19:58:36,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:58:36" (1/1) ... [2024-09-12 19:58:36,997 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:58:36" (1/1) ... [2024-09-12 19:58:36,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:58:36" (1/1) ... [2024-09-12 19:58:37,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 19:58:37,005 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 19:58:37,005 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 19:58:37,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 19:58:37,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:58:36" (1/1) ... [2024-09-12 19:58:37,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:58:37,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:58:37,051 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-12 19:58:37,058 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-12 19:58:37,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 19:58:37,107 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 19:58:37,107 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 19:58:37,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 19:58:37,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-12 19:58:37,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-12 19:58:37,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-12 19:58:37,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-12 19:58:37,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-12 19:58:37,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-12 19:58:37,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 19:58:37,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 19:58:37,110 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2024-09-12 19:58:37,110 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2024-09-12 19:58:37,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 19:58:37,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 19:58:37,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-12 19:58:37,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-12 19:58:37,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-12 19:58:37,112 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2024-09-12 19:58:37,113 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2024-09-12 19:58:37,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-12 19:58:37,206 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 19:58:37,209 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 19:58:37,426 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-09-12 19:58:37,427 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 19:58:37,456 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 19:58:37,456 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 19:58:37,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:58:37 BoogieIcfgContainer [2024-09-12 19:58:37,457 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 19:58:37,459 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 19:58:37,459 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 19:58:37,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 19:58:37,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 07:58:36" (1/3) ... [2024-09-12 19:58:37,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa6525f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:58:37, skipping insertion in model container [2024-09-12 19:58:37,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:58:36" (2/3) ... [2024-09-12 19:58:37,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa6525f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:58:37, skipping insertion in model container [2024-09-12 19:58:37,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:58:37" (3/3) ... [2024-09-12 19:58:37,466 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2024-09-12 19:58:37,484 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 19:58:37,485 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-09-12 19:58:37,557 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 19:58:37,568 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;@7e3bd96b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 19:58:37,569 INFO L337 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-09-12 19:58:37,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 26 states have internal predecessors, (28), 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-12 19:58:37,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 19:58:37,581 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:58:37,583 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:58:37,583 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_21_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:58:37,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:37,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1808801138, now seen corresponding path program 1 times [2024-09-12 19:58:37,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:58:37,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575590804] [2024-09-12 19:58:37,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:37,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:58:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:38,201 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:58:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:38,211 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-12 19:58:38,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:58:38,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575590804] [2024-09-12 19:58:38,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575590804] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:58:38,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:58:38,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 19:58:38,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251801576] [2024-09-12 19:58:38,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:58:38,220 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 19:58:38,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:58:38,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 19:58:38,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 19:58:38,249 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 26 states have internal predecessors, (28), 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, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:58:38,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:58:38,400 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2024-09-12 19:58:38,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 19:58:38,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-12 19:58:38,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:58:38,414 INFO L225 Difference]: With dead ends: 69 [2024-09-12 19:58:38,414 INFO L226 Difference]: Without dead ends: 36 [2024-09-12 19:58:38,418 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-12 19:58:38,421 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:58:38,423 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 145 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:58:38,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-12 19:58:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-09-12 19:58:38,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.35) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 19:58:38,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-09-12 19:58:38,479 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 12 [2024-09-12 19:58:38,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:58:38,481 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-09-12 19:58:38,481 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:58:38,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:38,482 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-09-12 19:58:38,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-12 19:58:38,485 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:58:38,485 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:58:38,486 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 19:58:38,486 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_21_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:58:38,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:38,487 INFO L85 PathProgramCache]: Analyzing trace with hash 238260506, now seen corresponding path program 1 times [2024-09-12 19:58:38,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:58:38,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715473840] [2024-09-12 19:58:38,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:38,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:58:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:38,589 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:58:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:38,598 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-12 19:58:38,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:58:38,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715473840] [2024-09-12 19:58:38,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715473840] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:58:38,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:58:38,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 19:58:38,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69754051] [2024-09-12 19:58:38,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:58:38,605 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 19:58:38,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:58:38,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 19:58:38,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 19:58:38,607 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:58:38,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:58:38,647 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-09-12 19:58:38,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 19:58:38,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-09-12 19:58:38,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:58:38,650 INFO L225 Difference]: With dead ends: 34 [2024-09-12 19:58:38,650 INFO L226 Difference]: Without dead ends: 33 [2024-09-12 19:58:38,650 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 19:58:38,651 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:58:38,652 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:58:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-12 19:58:38,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-09-12 19:58:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.3) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 19:58:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-09-12 19:58:38,667 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 13 [2024-09-12 19:58:38,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:58:38,667 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-09-12 19:58:38,668 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:58:38,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:38,669 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-09-12 19:58:38,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 19:58:38,670 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:58:38,670 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:58:38,670 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 19:58:38,671 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:58:38,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:38,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1956452191, now seen corresponding path program 1 times [2024-09-12 19:58:38,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:58:38,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408431554] [2024-09-12 19:58:38,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:38,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:58:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:38,818 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:58:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:38,829 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:58:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:38,888 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-12 19:58:38,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:58:38,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408431554] [2024-09-12 19:58:38,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408431554] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:58:38,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:58:38,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 19:58:38,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559253195] [2024-09-12 19:58:38,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:58:38,890 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 19:58:38,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:58:38,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 19:58:38,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 19:58:38,892 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. 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-12 19:58:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:58:39,050 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2024-09-12 19:58:39,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 19:58:39,054 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-12 19:58:39,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:58:39,058 INFO L225 Difference]: With dead ends: 42 [2024-09-12 19:58:39,058 INFO L226 Difference]: Without dead ends: 37 [2024-09-12 19:58:39,058 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-12 19:58:39,059 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:58:39,060 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 70 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:58:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-12 19:58:39,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-12 19:58:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 5 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-12 19:58:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-09-12 19:58:39,078 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 14 [2024-09-12 19:58:39,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:58:39,079 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-09-12 19:58:39,079 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-12 19:58:39,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-09-12 19:58:39,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 19:58:39,082 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:58:39,082 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:58:39,082 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 19:58:39,083 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_21_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:58:39,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:39,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1180937659, now seen corresponding path program 1 times [2024-09-12 19:58:39,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:58:39,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506940296] [2024-09-12 19:58:39,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:39,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:58:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:39,281 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:58:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:58:39,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:58:39,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506940296] [2024-09-12 19:58:39,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506940296] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:58:39,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:58:39,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 19:58:39,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059830295] [2024-09-12 19:58:39,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:58:39,288 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 19:58:39,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:58:39,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 19:58:39,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 19:58:39,290 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:58:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:58:39,416 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2024-09-12 19:58:39,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 19:58:39,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-12 19:58:39,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:58:39,418 INFO L225 Difference]: With dead ends: 41 [2024-09-12 19:58:39,420 INFO L226 Difference]: Without dead ends: 40 [2024-09-12 19:58:39,420 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-09-12 19:58:39,423 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 11 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:58:39,424 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 128 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:58:39,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-12 19:58:39,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2024-09-12 19:58:39,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 5 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-12 19:58:39,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-09-12 19:58:39,442 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 17 [2024-09-12 19:58:39,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:58:39,443 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-09-12 19:58:39,444 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:58:39,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:39,444 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-09-12 19:58:39,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-12 19:58:39,445 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:58:39,445 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] [2024-09-12 19:58:39,446 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 19:58:39,446 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:58:39,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:39,447 INFO L85 PathProgramCache]: Analyzing trace with hash -829981186, now seen corresponding path program 1 times [2024-09-12 19:58:39,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:58:39,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442030808] [2024-09-12 19:58:39,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:39,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:58:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:39,624 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:58:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:39,637 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:58:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:39,645 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:39,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:58:39,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:58:39,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442030808] [2024-09-12 19:58:39,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442030808] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:58:39,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:58:39,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 19:58:39,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574620922] [2024-09-12 19:58:39,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:58:39,653 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 19:58:39,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:58:39,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 19:58:39,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-12 19:58:39,656 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:58:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:58:39,788 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2024-09-12 19:58:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 19:58:39,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-12 19:58:39,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:58:39,790 INFO L225 Difference]: With dead ends: 45 [2024-09-12 19:58:39,790 INFO L226 Difference]: Without dead ends: 41 [2024-09-12 19:58:39,791 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-09-12 19:58:39,795 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:58:39,795 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 108 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:58:39,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-12 19:58:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-12 19:58:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-12 19:58:39,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-09-12 19:58:39,812 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 22 [2024-09-12 19:58:39,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:58:39,813 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-09-12 19:58:39,813 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:58:39,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-09-12 19:58:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-12 19:58:39,814 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:58:39,814 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, 1, 1, 1, 1] [2024-09-12 19:58:39,814 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 19:58:39,815 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:58:39,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:39,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1541777967, now seen corresponding path program 1 times [2024-09-12 19:58:39,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:58:39,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306134525] [2024-09-12 19:58:39,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:39,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:58:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:40,041 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:58:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:40,053 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:58:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:40,191 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:40,341 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:40,396 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-12 19:58:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:40,400 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-12 19:58:40,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:58:40,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306134525] [2024-09-12 19:58:40,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306134525] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:58:40,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623295774] [2024-09-12 19:58:40,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:40,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:58:40,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:58:40,403 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-12 19:58:40,405 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-12 19:58:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:40,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-09-12 19:58:40,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:58:40,588 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-12 19:58:40,850 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 36 treesize of output 13 [2024-09-12 19:58:40,854 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-12 19:58:40,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:58:41,494 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-12 19:58:41,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623295774] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:58:41,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:58:41,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2024-09-12 19:58:41,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610746327] [2024-09-12 19:58:41,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:58:41,496 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-12 19:58:41,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:58:41,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-12 19:58:41,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2024-09-12 19:58:41,498 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 25 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 21 states have internal predecessors, (41), 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-12 19:58:41,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:58:41,853 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2024-09-12 19:58:41,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-12 19:58:41,854 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 21 states have internal predecessors, (41), 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 34 [2024-09-12 19:58:41,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:58:41,855 INFO L225 Difference]: With dead ends: 75 [2024-09-12 19:58:41,855 INFO L226 Difference]: Without dead ends: 43 [2024-09-12 19:58:41,856 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2024-09-12 19:58:41,857 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:58:41,857 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 157 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:58:41,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-12 19:58:41,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-09-12 19:58:41,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-12 19:58:41,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-09-12 19:58:41,868 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 34 [2024-09-12 19:58:41,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:58:41,869 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-09-12 19:58:41,869 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 21 states have internal predecessors, (41), 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-12 19:58:41,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:41,869 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-09-12 19:58:41,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-12 19:58:41,870 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:58:41,871 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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] [2024-09-12 19:58:41,889 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 19:58:42,075 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-12 19:58:42,076 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:58:42,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:42,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1323769296, now seen corresponding path program 2 times [2024-09-12 19:58:42,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:58:42,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366257433] [2024-09-12 19:58:42,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:42,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:58:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:42,350 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:58:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:42,357 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:58:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:42,527 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:42,706 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:42,848 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:42,896 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-12 19:58:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:42,901 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 19:58:42,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:58:42,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366257433] [2024-09-12 19:58:42,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366257433] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:58:42,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636106100] [2024-09-12 19:58:42,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 19:58:42,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:58:42,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:58:42,905 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-12 19:58:42,907 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-12 19:58:42,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 19:58:42,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:58:42,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-12 19:58:42,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:58:43,003 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-12 19:58:43,245 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-12 19:58:43,246 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:58:43,753 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-12 19:58:43,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636106100] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:58:43,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:58:43,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 11] total 32 [2024-09-12 19:58:43,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272782488] [2024-09-12 19:58:43,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:58:43,755 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-12 19:58:43,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:58:43,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-12 19:58:43,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=864, Unknown=0, NotChecked=0, Total=992 [2024-09-12 19:58:43,756 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 32 states, 25 states have (on average 2.12) internal successors, (53), 27 states have internal predecessors, (53), 11 states have call successors, (14), 6 states have call predecessors, (14), 9 states have return successors, (13), 8 states have call predecessors, (13), 11 states have call successors, (13) [2024-09-12 19:58:44,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:58:44,371 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2024-09-12 19:58:44,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-12 19:58:44,372 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 25 states have (on average 2.12) internal successors, (53), 27 states have internal predecessors, (53), 11 states have call successors, (14), 6 states have call predecessors, (14), 9 states have return successors, (13), 8 states have call predecessors, (13), 11 states have call successors, (13) Word has length 41 [2024-09-12 19:58:44,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:58:44,374 INFO L225 Difference]: With dead ends: 81 [2024-09-12 19:58:44,374 INFO L226 Difference]: Without dead ends: 47 [2024-09-12 19:58:44,375 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=268, Invalid=1624, Unknown=0, NotChecked=0, Total=1892 [2024-09-12 19:58:44,376 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 19:58:44,376 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 136 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 19:58:44,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-12 19:58:44,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-09-12 19:58:44,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 7 states have call successors, (7), 6 states have call predecessors, (7), 8 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-12 19:58:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-09-12 19:58:44,399 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 41 [2024-09-12 19:58:44,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:58:44,400 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-09-12 19:58:44,400 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 25 states have (on average 2.12) internal successors, (53), 27 states have internal predecessors, (53), 11 states have call successors, (14), 6 states have call predecessors, (14), 9 states have return successors, (13), 8 states have call predecessors, (13), 11 states have call successors, (13) [2024-09-12 19:58:44,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:44,401 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-09-12 19:58:44,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-09-12 19:58:44,405 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:58:44,405 INFO L216 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:58:44,423 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 19:58:44,605 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-12 19:58:44,606 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:58:44,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:44,606 INFO L85 PathProgramCache]: Analyzing trace with hash -889111766, now seen corresponding path program 1 times [2024-09-12 19:58:44,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:58:44,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490640221] [2024-09-12 19:58:44,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:44,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:58:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:44,843 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:58:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:44,853 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:58:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:44,864 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:44,870 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:44,881 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:44,884 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-12 19:58:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:44,895 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:44,900 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:44,904 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:44,907 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-09-12 19:58:44,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:58:44,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490640221] [2024-09-12 19:58:44,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490640221] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:58:44,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891257193] [2024-09-12 19:58:44,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:44,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:58:44,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:58:44,909 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-12 19:58:44,911 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-12 19:58:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:45,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-09-12 19:58:45,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:58:45,023 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-12 19:58:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 94 proven. 15 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-09-12 19:58:45,408 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:58:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 3 proven. 124 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-09-12 19:58:46,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891257193] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:58:46,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:58:46,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 21] total 38 [2024-09-12 19:58:46,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799396728] [2024-09-12 19:58:46,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:58:46,918 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-09-12 19:58:46,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:58:46,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-09-12 19:58:46,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2024-09-12 19:58:46,920 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 38 states, 31 states have (on average 2.0) internal successors, (62), 31 states have internal predecessors, (62), 11 states have call successors, (19), 9 states have call predecessors, (19), 10 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2024-09-12 19:58:47,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:58:47,582 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2024-09-12 19:58:47,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-12 19:58:47,583 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 2.0) internal successors, (62), 31 states have internal predecessors, (62), 11 states have call successors, (19), 9 states have call predecessors, (19), 10 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) Word has length 68 [2024-09-12 19:58:47,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:58:47,584 INFO L225 Difference]: With dead ends: 87 [2024-09-12 19:58:47,584 INFO L226 Difference]: Without dead ends: 49 [2024-09-12 19:58:47,586 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=373, Invalid=2279, Unknown=0, NotChecked=0, Total=2652 [2024-09-12 19:58:47,586 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 19:58:47,587 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 219 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 19:58:47,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-12 19:58:47,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-09-12 19:58:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 32 states have internal predecessors, (34), 8 states have call successors, (8), 6 states have call predecessors, (8), 9 states have return successors, (14), 10 states have call predecessors, (14), 7 states have call successors, (14) [2024-09-12 19:58:47,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2024-09-12 19:58:47,599 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 68 [2024-09-12 19:58:47,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:58:47,599 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2024-09-12 19:58:47,599 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 2.0) internal successors, (62), 31 states have internal predecessors, (62), 11 states have call successors, (19), 9 states have call predecessors, (19), 10 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2024-09-12 19:58:47,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:47,600 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2024-09-12 19:58:47,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-09-12 19:58:47,601 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:58:47,602 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:58:47,620 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 19:58:47,806 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-12 19:58:47,807 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:58:47,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:47,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1233101978, now seen corresponding path program 1 times [2024-09-12 19:58:47,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:58:47,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911829243] [2024-09-12 19:58:47,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:47,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:58:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:47,896 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:58:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:47,904 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:58:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:47,913 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:47,921 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:47,930 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:47,938 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:47,941 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-12 19:58:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:47,957 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:47,964 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:47,971 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:47,977 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-09-12 19:58:47,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:58:47,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911829243] [2024-09-12 19:58:47,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911829243] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:58:47,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:58:47,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 19:58:47,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107197085] [2024-09-12 19:58:47,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:58:47,983 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 19:58:47,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:58:47,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 19:58:47,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 19:58:47,985 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:58:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:58:48,056 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2024-09-12 19:58:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 19:58:48,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 83 [2024-09-12 19:58:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:58:48,058 INFO L225 Difference]: With dead ends: 49 [2024-09-12 19:58:48,058 INFO L226 Difference]: Without dead ends: 48 [2024-09-12 19:58:48,058 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 19:58:48,059 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:58:48,059 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 80 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:58:48,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-12 19:58:48,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-09-12 19:58:48,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 9 states have return successors, (14), 10 states have call predecessors, (14), 7 states have call successors, (14) [2024-09-12 19:58:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2024-09-12 19:58:48,072 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 83 [2024-09-12 19:58:48,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:58:48,074 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2024-09-12 19:58:48,074 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:58:48,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2024-09-12 19:58:48,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-09-12 19:58:48,077 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:58:48,078 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:58:48,078 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-12 19:58:48,078 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:58:48,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:48,079 INFO L85 PathProgramCache]: Analyzing trace with hash -704384533, now seen corresponding path program 3 times [2024-09-12 19:58:48,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:58:48,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915557358] [2024-09-12 19:58:48,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:48,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:58:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:48,760 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:58:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:48,770 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:58:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:49,250 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:49,492 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:49,659 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:49,773 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:49,846 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:49,885 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-12 19:58:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:49,897 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:49,905 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:49,912 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:49,917 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:49,922 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:49,924 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-12 19:58:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:49,928 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 4 proven. 152 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-09-12 19:58:49,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:58:49,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915557358] [2024-09-12 19:58:49,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915557358] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:58:49,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293888066] [2024-09-12 19:58:49,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 19:58:49,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:58:49,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:58:49,931 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-12 19:58:49,933 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-12 19:58:50,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-12 19:58:50,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:58:50,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-09-12 19:58:50,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:58:50,068 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-12 19:58:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2024-09-12 19:58:50,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:58:51,388 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-09-12 19:58:51,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293888066] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:58:51,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:58:51,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 16] total 37 [2024-09-12 19:58:51,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082641928] [2024-09-12 19:58:51,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:58:51,390 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-09-12 19:58:51,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:58:51,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-09-12 19:58:51,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1149, Unknown=0, NotChecked=0, Total=1332 [2024-09-12 19:58:51,392 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 37 states, 30 states have (on average 2.1) internal successors, (63), 31 states have internal predecessors, (63), 12 states have call successors, (18), 7 states have call predecessors, (18), 13 states have return successors, (20), 13 states have call predecessors, (20), 12 states have call successors, (20) [2024-09-12 19:58:51,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:58:51,874 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2024-09-12 19:58:51,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-12 19:58:51,875 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 30 states have (on average 2.1) internal successors, (63), 31 states have internal predecessors, (63), 12 states have call successors, (18), 7 states have call predecessors, (18), 13 states have return successors, (20), 13 states have call predecessors, (20), 12 states have call successors, (20) Word has length 96 [2024-09-12 19:58:51,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:58:51,877 INFO L225 Difference]: With dead ends: 91 [2024-09-12 19:58:51,877 INFO L226 Difference]: Without dead ends: 52 [2024-09-12 19:58:51,878 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=350, Invalid=2100, Unknown=0, NotChecked=0, Total=2450 [2024-09-12 19:58:51,879 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 40 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:58:51,879 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 111 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:58:51,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-12 19:58:51,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-09-12 19:58:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 6 states have call predecessors, (8), 11 states have return successors, (16), 12 states have call predecessors, (16), 7 states have call successors, (16) [2024-09-12 19:58:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2024-09-12 19:58:51,891 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 96 [2024-09-12 19:58:51,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:58:51,891 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2024-09-12 19:58:51,891 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 30 states have (on average 2.1) internal successors, (63), 31 states have internal predecessors, (63), 12 states have call successors, (18), 7 states have call predecessors, (18), 13 states have return successors, (20), 13 states have call predecessors, (20), 12 states have call successors, (20) [2024-09-12 19:58:51,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:51,892 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2024-09-12 19:58:51,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-09-12 19:58:51,896 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:58:51,896 INFO L216 NwaCegarLoop]: trace histogram [18, 18, 15, 15, 15, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:58:51,914 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 19:58:52,097 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:58:52,097 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:58:52,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:52,098 INFO L85 PathProgramCache]: Analyzing trace with hash -811383675, now seen corresponding path program 4 times [2024-09-12 19:58:52,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:58:52,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682918279] [2024-09-12 19:58:52,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:52,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:58:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:53,114 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:58:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:53,124 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:58:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:53,923 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,205 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,427 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,563 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,686 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,769 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,809 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-12 19:58:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,838 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,848 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,855 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,861 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,866 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,870 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,872 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-12 19:58:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,885 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,893 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,900 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,907 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,912 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,916 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,918 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-12 19:58:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 6 proven. 411 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2024-09-12 19:58:54,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:58:54,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682918279] [2024-09-12 19:58:54,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682918279] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:58:54,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128520831] [2024-09-12 19:58:54,922 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 19:58:54,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:58:54,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:58:54,924 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-12 19:58:54,926 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-12 19:58:55,108 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 19:58:55,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:58:55,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-09-12 19:58:55,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:58:55,128 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-12 19:58:55,442 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 36 treesize of output 13 [2024-09-12 19:58:55,475 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-12 19:58:55,494 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 949 trivial. 0 not checked. [2024-09-12 19:58:55,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:58:56,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128520831] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:58:56,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 19:58:56,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2024-09-12 19:58:56,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930115001] [2024-09-12 19:58:56,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 19:58:56,088 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-12 19:58:56,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:58:56,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-12 19:58:56,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2024-09-12 19:58:56,090 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 25 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 8 states have call successors, (14), 4 states have call predecessors, (14), 12 states have return successors, (17), 12 states have call predecessors, (17), 8 states have call successors, (17) [2024-09-12 19:58:56,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:58:56,430 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2024-09-12 19:58:56,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-12 19:58:56,431 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 8 states have call successors, (14), 4 states have call predecessors, (14), 12 states have return successors, (17), 12 states have call predecessors, (17), 8 states have call successors, (17) Word has length 158 [2024-09-12 19:58:56,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:58:56,432 INFO L225 Difference]: With dead ends: 102 [2024-09-12 19:58:56,432 INFO L226 Difference]: Without dead ends: 59 [2024-09-12 19:58:56,433 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=1364, Unknown=0, NotChecked=0, Total=1640 [2024-09-12 19:58:56,433 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 45 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:58:56,434 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 55 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:58:56,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-12 19:58:56,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2024-09-12 19:58:56,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 8 states have call successors, (8), 6 states have call predecessors, (8), 13 states have return successors, (20), 15 states have call predecessors, (20), 7 states have call successors, (20) [2024-09-12 19:58:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2024-09-12 19:58:56,446 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 158 [2024-09-12 19:58:56,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:58:56,447 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2024-09-12 19:58:56,447 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 8 states have call successors, (14), 4 states have call predecessors, (14), 12 states have return successors, (17), 12 states have call predecessors, (17), 8 states have call successors, (17) [2024-09-12 19:58:56,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:56,448 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2024-09-12 19:58:56,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-09-12 19:58:56,449 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:58:56,449 INFO L216 NwaCegarLoop]: trace histogram [21, 21, 18, 18, 18, 18, 18, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:58:56,467 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-12 19:58:56,650 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-12 19:58:56,650 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:58:56,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:56,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1444348366, now seen corresponding path program 1 times [2024-09-12 19:58:56,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:58:56,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717012125] [2024-09-12 19:58:56,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:56,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:58:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:57,312 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:58:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:57,318 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:58:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,087 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,120 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,132 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,137 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,140 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,142 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:58:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,565 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,583 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,591 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,597 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,604 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,608 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,611 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,613 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:58:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,768 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,785 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,792 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,798 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,803 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,807 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,810 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:58:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,812 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:58:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2024-09-12 19:58:58,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:58:58,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717012125] [2024-09-12 19:58:58,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717012125] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:58:58,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922687801] [2024-09-12 19:58:58,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:58,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:58:58,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:58:58,855 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-12 19:58:58,857 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-12 19:58:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:59,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-09-12 19:58:59,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:58:59,066 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-12 19:58:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2024-09-12 19:58:59,422 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:59:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 1299 trivial. 0 not checked. [2024-09-12 19:59:00,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922687801] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:59:00,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:59:00,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 21] total 42 [2024-09-12 19:59:00,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812135077] [2024-09-12 19:59:00,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:59:00,880 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-09-12 19:59:00,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:59:00,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-09-12 19:59:00,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1429, Unknown=0, NotChecked=0, Total=1722 [2024-09-12 19:59:00,881 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 42 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 35 states have internal predecessors, (58), 15 states have call successors, (19), 8 states have call predecessors, (19), 10 states have return successors, (19), 14 states have call predecessors, (19), 15 states have call successors, (19) [2024-09-12 19:59:01,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:59:01,231 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2024-09-12 19:59:01,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-12 19:59:01,232 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 35 states have internal predecessors, (58), 15 states have call successors, (19), 8 states have call predecessors, (19), 10 states have return successors, (19), 14 states have call predecessors, (19), 15 states have call successors, (19) Word has length 179 [2024-09-12 19:59:01,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:59:01,233 INFO L225 Difference]: With dead ends: 65 [2024-09-12 19:59:01,233 INFO L226 Difference]: Without dead ends: 58 [2024-09-12 19:59:01,234 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 382 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=426, Invalid=1926, Unknown=0, NotChecked=0, Total=2352 [2024-09-12 19:59:01,234 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 48 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:59:01,235 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 116 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:59:01,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-12 19:59:01,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-09-12 19:59:01,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 8 states have call successors, (8), 6 states have call predecessors, (8), 14 states have return successors, (19), 15 states have call predecessors, (19), 7 states have call successors, (19) [2024-09-12 19:59:01,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2024-09-12 19:59:01,248 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 179 [2024-09-12 19:59:01,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:59:01,248 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2024-09-12 19:59:01,248 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 35 states have internal predecessors, (58), 15 states have call successors, (19), 8 states have call predecessors, (19), 10 states have return successors, (19), 14 states have call predecessors, (19), 15 states have call successors, (19) [2024-09-12 19:59:01,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:59:01,249 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2024-09-12 19:59:01,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2024-09-12 19:59:01,251 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:59:01,252 INFO L216 NwaCegarLoop]: trace histogram [35, 35, 30, 30, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:59:01,270 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-12 19:59:01,452 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-12 19:59:01,452 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:59:01,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:59:01,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1454653656, now seen corresponding path program 5 times [2024-09-12 19:59:01,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:59:01,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792663283] [2024-09-12 19:59:01,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:59:01,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:59:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:03,050 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:59:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:03,059 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:59:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:04,498 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:04,520 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:04,530 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:04,536 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:04,541 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:04,550 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:04,553 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:04,555 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:05,543 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:05,558 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:05,565 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:05,571 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:05,576 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:05,579 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:05,582 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:05,584 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,159 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,174 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,181 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,186 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,191 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,194 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,196 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,199 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,538 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,554 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,561 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,566 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,571 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,575 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,577 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,578 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,776 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,791 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,798 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,805 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,810 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,813 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,816 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,817 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:06,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3795 backedges. 21 proven. 47 refuted. 0 times theorem prover too weak. 3727 trivial. 0 not checked. [2024-09-12 19:59:06,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:59:06,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792663283] [2024-09-12 19:59:06,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792663283] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:59:06,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508957143] [2024-09-12 19:59:06,846 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-12 19:59:06,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:59:06,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:59:06,849 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-12 19:59:06,850 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-12 19:59:08,181 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2024-09-12 19:59:08,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:59:08,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-09-12 19:59:08,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:59:08,201 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-12 19:59:08,614 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 36 treesize of output 13 [2024-09-12 19:59:08,637 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-12 19:59:08,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3795 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 3756 trivial. 0 not checked. [2024-09-12 19:59:08,641 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:59:09,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508957143] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:59:09,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 19:59:09,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 31 [2024-09-12 19:59:09,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321943157] [2024-09-12 19:59:09,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 19:59:09,863 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-09-12 19:59:09,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:59:09,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-09-12 19:59:09,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=933, Unknown=0, NotChecked=0, Total=1190 [2024-09-12 19:59:09,864 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 31 states, 25 states have (on average 1.84) internal successors, (46), 27 states have internal predecessors, (46), 10 states have call successors, (14), 4 states have call predecessors, (14), 12 states have return successors, (16), 15 states have call predecessors, (16), 10 states have call successors, (16) [2024-09-12 19:59:10,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:59:10,164 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2024-09-12 19:59:10,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-12 19:59:10,165 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 1.84) internal successors, (46), 27 states have internal predecessors, (46), 10 states have call successors, (14), 4 states have call predecessors, (14), 12 states have return successors, (16), 15 states have call predecessors, (16), 10 states have call successors, (16) Word has length 289 [2024-09-12 19:59:10,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:59:10,166 INFO L225 Difference]: With dead ends: 69 [2024-09-12 19:59:10,167 INFO L226 Difference]: Without dead ends: 66 [2024-09-12 19:59:10,167 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=340, Invalid=1220, Unknown=0, NotChecked=0, Total=1560 [2024-09-12 19:59:10,168 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 38 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:59:10,169 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 68 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:59:10,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-12 19:59:10,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2024-09-12 19:59:10,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 8 states have call successors, (8), 6 states have call predecessors, (8), 15 states have return successors, (22), 17 states have call predecessors, (22), 7 states have call successors, (22) [2024-09-12 19:59:10,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2024-09-12 19:59:10,189 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 289 [2024-09-12 19:59:10,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:59:10,189 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2024-09-12 19:59:10,190 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 1.84) internal successors, (46), 27 states have internal predecessors, (46), 10 states have call successors, (14), 4 states have call predecessors, (14), 12 states have return successors, (16), 15 states have call predecessors, (16), 10 states have call successors, (16) [2024-09-12 19:59:10,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:59:10,191 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2024-09-12 19:59:10,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2024-09-12 19:59:10,194 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:59:10,195 INFO L216 NwaCegarLoop]: trace histogram [35, 35, 30, 30, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:59:10,218 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-12 19:59:10,395 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:59:10,396 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:59:10,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:59:10,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1454655578, now seen corresponding path program 2 times [2024-09-12 19:59:10,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:59:10,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071790214] [2024-09-12 19:59:10,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:59:10,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:59:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:11,909 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:59:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:11,915 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:59:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:13,202 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:13,226 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:13,235 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:13,243 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:13,249 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:13,254 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:13,257 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:13,260 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:14,339 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:14,354 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:14,360 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:14,366 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:14,374 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:14,378 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:14,381 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:14,383 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:14,919 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:14,935 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:14,944 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:14,950 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:14,956 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:14,960 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:14,963 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:14,965 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:15,312 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:15,329 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:15,337 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:15,343 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:15,348 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:15,352 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:15,355 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:15,357 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:15,514 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:15,531 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:15,538 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:15,544 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:15,550 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:15,554 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:15,557 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:15,559 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:15,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3795 backedges. 24 proven. 35 refuted. 0 times theorem prover too weak. 3736 trivial. 0 not checked. [2024-09-12 19:59:15,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:59:15,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071790214] [2024-09-12 19:59:15,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071790214] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:59:15,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774265233] [2024-09-12 19:59:15,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 19:59:15,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:59:15,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:59:15,613 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-12 19:59:15,616 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-12 19:59:15,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 19:59:15,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:59:15,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-09-12 19:59:15,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:59:15,985 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-12 19:59:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3795 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 3760 trivial. 0 not checked. [2024-09-12 19:59:16,438 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:59:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3795 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2024-09-12 19:59:19,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774265233] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:59:19,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:59:19,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 31] total 53 [2024-09-12 19:59:19,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555589625] [2024-09-12 19:59:19,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:59:19,615 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-09-12 19:59:19,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:59:19,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-09-12 19:59:19,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=476, Invalid=2280, Unknown=0, NotChecked=0, Total=2756 [2024-09-12 19:59:19,617 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 53 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 44 states have internal predecessors, (71), 18 states have call successors, (23), 10 states have call predecessors, (23), 14 states have return successors, (27), 20 states have call predecessors, (27), 18 states have call successors, (27) [2024-09-12 19:59:20,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:59:20,165 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2024-09-12 19:59:20,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-12 19:59:20,166 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 44 states have internal predecessors, (71), 18 states have call successors, (23), 10 states have call predecessors, (23), 14 states have return successors, (27), 20 states have call predecessors, (27), 18 states have call successors, (27) Word has length 289 [2024-09-12 19:59:20,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:59:20,167 INFO L225 Difference]: With dead ends: 65 [2024-09-12 19:59:20,167 INFO L226 Difference]: Without dead ends: 60 [2024-09-12 19:59:20,169 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 628 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=691, Invalid=2969, Unknown=0, NotChecked=0, Total=3660 [2024-09-12 19:59:20,170 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 51 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 19:59:20,170 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 167 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 19:59:20,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-12 19:59:20,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-09-12 19:59:20,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 8 states have call successors, (8), 6 states have call predecessors, (8), 15 states have return successors, (20), 16 states have call predecessors, (20), 7 states have call successors, (20) [2024-09-12 19:59:20,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2024-09-12 19:59:20,182 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 289 [2024-09-12 19:59:20,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:59:20,183 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2024-09-12 19:59:20,183 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 44 states have internal predecessors, (71), 18 states have call successors, (23), 10 states have call predecessors, (23), 14 states have return successors, (27), 20 states have call predecessors, (27), 18 states have call successors, (27) [2024-09-12 19:59:20,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:59:20,183 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2024-09-12 19:59:20,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-09-12 19:59:20,187 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:59:20,187 INFO L216 NwaCegarLoop]: trace histogram [42, 42, 36, 36, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:59:20,209 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-12 19:59:20,388 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:59:20,388 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:59:20,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:59:20,389 INFO L85 PathProgramCache]: Analyzing trace with hash -984693309, now seen corresponding path program 6 times [2024-09-12 19:59:20,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:59:20,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940946607] [2024-09-12 19:59:20,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:59:20,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:59:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:21,498 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:59:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:21,505 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:59:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:22,524 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:22,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:22,545 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:22,551 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:22,558 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:22,562 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:22,564 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:22,566 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:23,363 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:23,376 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:23,383 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:23,388 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:23,393 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:23,397 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:23,400 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:23,402 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,011 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,021 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,026 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,031 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,036 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,043 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,044 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,403 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,415 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,421 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,427 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,430 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,434 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,436 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,437 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,762 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,811 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,820 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,827 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,834 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,839 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,845 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:24,847 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:25,058 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:25,216 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:25,296 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:25,354 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:25,393 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:25,427 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:25,492 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:25,542 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:25,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5493 backedges. 1307 proven. 44 refuted. 0 times theorem prover too weak. 4142 trivial. 0 not checked. [2024-09-12 19:59:25,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:59:25,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940946607] [2024-09-12 19:59:25,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940946607] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:59:25,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470138377] [2024-09-12 19:59:25,565 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-12 19:59:25,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:59:25,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:59:25,568 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-12 19:59:25,570 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-12 19:59:34,335 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2024-09-12 19:59:34,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:59:34,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 156 conjuncts are in the unsatisfiable core [2024-09-12 19:59:34,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:59:34,447 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-12 19:59:34,806 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-12 19:59:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5493 backedges. 1531 proven. 91 refuted. 0 times theorem prover too weak. 3871 trivial. 0 not checked. [2024-09-12 19:59:34,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:59:35,780 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-12 19:59:36,202 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-12 19:59:36,577 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-12 19:59:36,947 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-12 19:59:37,242 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-12 19:59:37,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470138377] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:59:37,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 19:59:37,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 25 [2024-09-12 19:59:37,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323677357] [2024-09-12 19:59:37,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 19:59:37,988 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-12 19:59:37,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:59:37,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-12 19:59:37,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2024-09-12 19:59:37,989 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 25 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 24 states have internal predecessors, (54), 8 states have call successors, (17), 3 states have call predecessors, (17), 11 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) [2024-09-12 19:59:38,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:59:38,519 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2024-09-12 19:59:38,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-12 19:59:38,519 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 24 states have internal predecessors, (54), 8 states have call successors, (17), 3 states have call predecessors, (17), 11 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) Word has length 344 [2024-09-12 19:59:38,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:59:38,520 INFO L225 Difference]: With dead ends: 65 [2024-09-12 19:59:38,520 INFO L226 Difference]: Without dead ends: 62 [2024-09-12 19:59:38,521 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=209, Invalid=1683, Unknown=0, NotChecked=0, Total=1892 [2024-09-12 19:59:38,522 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 29 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 19:59:38,522 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 304 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 19:59:38,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-12 19:59:38,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2024-09-12 19:59:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 37 states have internal predecessors, (38), 8 states have call successors, (8), 6 states have call predecessors, (8), 15 states have return successors, (20), 16 states have call predecessors, (20), 7 states have call successors, (20) [2024-09-12 19:59:38,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2024-09-12 19:59:38,535 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 344 [2024-09-12 19:59:38,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:59:38,536 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2024-09-12 19:59:38,536 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 24 states have internal predecessors, (54), 8 states have call successors, (17), 3 states have call predecessors, (17), 11 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) [2024-09-12 19:59:38,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:59:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2024-09-12 19:59:38,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-09-12 19:59:38,538 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:59:38,538 INFO L216 NwaCegarLoop]: trace histogram [42, 42, 36, 36, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:59:38,566 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-12 19:59:38,738 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-12 19:59:38,739 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:59:38,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:59:38,739 INFO L85 PathProgramCache]: Analyzing trace with hash -984691387, now seen corresponding path program 3 times [2024-09-12 19:59:38,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:59:38,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630897591] [2024-09-12 19:59:38,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:59:38,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:59:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:39,535 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:59:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:39,542 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:59:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:40,201 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:40,211 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:40,218 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:40,223 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:40,229 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:40,233 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:40,235 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:40,236 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:40,763 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:40,776 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:40,782 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:40,788 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:40,793 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:40,797 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:40,800 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:40,802 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,163 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,175 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,181 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,185 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,190 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,193 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,196 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,197 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,450 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,465 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,472 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,477 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,480 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,482 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,484 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,631 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,645 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,652 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,658 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,663 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,666 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,668 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,669 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,807 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:59:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,818 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,823 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,827 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,833 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,835 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:59:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,836 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 19:59:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:59:41,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5493 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 5445 trivial. 0 not checked. [2024-09-12 19:59:41,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:59:41,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630897591] [2024-09-12 19:59:41,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630897591] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:59:41,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564501636] [2024-09-12 19:59:41,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 19:59:41,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:59:41,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:59:41,896 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:59:41,898 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-12 19:59:47,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2024-09-12 19:59:47,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:59:47,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 1223 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-09-12 19:59:47,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:59:47,108 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-12 19:59:47,481 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-12 19:59:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5493 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 5440 trivial. 0 not checked. [2024-09-12 19:59:47,502 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:59:48,191 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 8 treesize of output 4 [2024-09-12 19:59:48,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564501636] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:59:48,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 19:59:48,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2024-09-12 19:59:48,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309879041] [2024-09-12 19:59:48,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 19:59:48,530 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-12 19:59:48,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:59:48,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-12 19:59:48,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2024-09-12 19:59:48,532 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 26 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 22 states have internal predecessors, (44), 8 states have call successors, (13), 4 states have call predecessors, (13), 10 states have return successors, (15), 13 states have call predecessors, (15), 8 states have call successors, (15) [2024-09-12 19:59:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:59:49,154 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2024-09-12 19:59:49,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-12 19:59:49,155 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 22 states have internal predecessors, (44), 8 states have call successors, (13), 4 states have call predecessors, (13), 10 states have return successors, (15), 13 states have call predecessors, (15), 8 states have call successors, (15) Word has length 344 [2024-09-12 19:59:49,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:59:49,160 INFO L225 Difference]: With dead ends: 62 [2024-09-12 19:59:49,160 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 19:59:49,161 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=1680, Unknown=0, NotChecked=0, Total=1892 [2024-09-12 19:59:49,162 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 19:59:49,162 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 146 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 19:59:49,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 19:59:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 19:59:49,163 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-12 19:59:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 19:59:49,163 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 344 [2024-09-12 19:59:49,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:59:49,163 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 19:59:49,163 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 22 states have internal predecessors, (44), 8 states have call successors, (13), 4 states have call predecessors, (13), 10 states have return successors, (15), 13 states have call predecessors, (15), 8 states have call successors, (15) [2024-09-12 19:59:49,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:59:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 19:59:49,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 19:59:49,169 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-09-12 19:59:49,170 INFO L785 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 5 remaining) [2024-09-12 19:59:49,170 INFO L785 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 5 remaining) [2024-09-12 19:59:49,170 INFO L785 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_21_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 5 remaining) [2024-09-12 19:59:49,170 INFO L785 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_21_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 5 remaining) [2024-09-12 19:59:49,198 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-12 19:59:49,371 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-12 19:59:49,375 INFO L408 BasicCegarLoop]: Path program histogram: [6, 3, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:59:49,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 19:59:52,534 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 19:59:52,550 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-12 19:59:52,551 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-09-12 19:59:52,552 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-12 19:59:52,552 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-09-12 19:59:52,552 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-12 19:59:52,552 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-09-12 19:59:52,552 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-12 19:59:52,552 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-09-12 19:59:52,553 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-09-12 19:59:52,553 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-09-12 19:59:52,553 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-09-12 19:59:52,554 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~a!base,]]] [2024-09-12 19:59:52,554 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-09-12 19:59:52,554 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~a!base,]]] [2024-09-12 19:59:52,554 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-09-12 19:59:52,554 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-09-12 19:59:52,554 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-12 19:59:52,555 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-09-12 19:59:52,555 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-12 19:59:52,555 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-09-12 19:59:52,555 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-12 19:59:52,555 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-09-12 19:59:52,560 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-12 19:59:52,560 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-09-12 19:59:52,560 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-09-12 19:59:52,561 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-09-12 19:59:52,561 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-12 19:59:52,561 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-09-12 19:59:52,562 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-09-12 19:59:52,562 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-09-12 19:59:52,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 07:59:52 BoogieIcfgContainer [2024-09-12 19:59:52,562 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 19:59:52,563 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 19:59:52,563 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 19:59:52,563 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 19:59:52,563 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:58:37" (3/4) ... [2024-09-12 19:59:52,566 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 19:59:52,570 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 19:59:52,570 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_21_0 [2024-09-12 19:59:52,570 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 19:59:52,570 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_21_to_21_0 [2024-09-12 19:59:52,576 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-09-12 19:59:52,577 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-12 19:59:52,577 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-12 19:59:52,577 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 19:59:52,675 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 19:59:52,676 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 19:59:52,676 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 19:59:52,676 INFO L158 Benchmark]: Toolchain (without parser) took 76033.14ms. Allocated memory was 54.5MB in the beginning and 1.3GB in the end (delta: 1.3GB). Free memory was 21.7MB in the beginning and 630.5MB in the end (delta: -608.7MB). Peak memory consumption was 658.6MB. Max. memory is 16.1GB. [2024-09-12 19:59:52,676 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 41.9MB. Free memory was 18.4MB in the beginning and 18.3MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 19:59:52,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.61ms. Allocated memory is still 54.5MB. Free memory was 21.6MB in the beginning and 24.7MB in the end (delta: -3.1MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2024-09-12 19:59:52,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.66ms. Allocated memory is still 54.5MB. Free memory was 24.6MB in the beginning and 23.7MB in the end (delta: 883.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 19:59:52,677 INFO L158 Benchmark]: Boogie Preprocessor took 55.98ms. Allocated memory is still 54.5MB. Free memory was 23.7MB in the beginning and 21.7MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 19:59:52,677 INFO L158 Benchmark]: RCFGBuilder took 452.49ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 21.7MB in the beginning and 34.1MB in the end (delta: -12.4MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2024-09-12 19:59:52,677 INFO L158 Benchmark]: TraceAbstraction took 75103.68ms. Allocated memory was 67.1MB in the beginning and 1.3GB in the end (delta: 1.3GB). Free memory was 33.5MB in the beginning and 635.7MB in the end (delta: -602.2MB). Peak memory consumption was 651.3MB. Max. memory is 16.1GB. [2024-09-12 19:59:52,677 INFO L158 Benchmark]: Witness Printer took 113.08ms. Allocated memory is still 1.3GB. Free memory was 635.7MB in the beginning and 630.5MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-12 19:59:52,679 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 41.9MB. Free memory was 18.4MB in the beginning and 18.3MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.61ms. Allocated memory is still 54.5MB. Free memory was 21.6MB in the beginning and 24.7MB in the end (delta: -3.1MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.66ms. Allocated memory is still 54.5MB. Free memory was 24.6MB in the beginning and 23.7MB in the end (delta: 883.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.98ms. Allocated memory is still 54.5MB. Free memory was 23.7MB in the beginning and 21.7MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 452.49ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 21.7MB in the beginning and 34.1MB in the end (delta: -12.4MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. * TraceAbstraction took 75103.68ms. Allocated memory was 67.1MB in the beginning and 1.3GB in the end (delta: 1.3GB). Free memory was 33.5MB in the beginning and 635.7MB in the end (delta: -602.2MB). Peak memory consumption was 651.3MB. Max. memory is 16.1GB. * Witness Printer took 113.08ms. Allocated memory is still 1.3GB. Free memory was 635.7MB in the beginning and 630.5MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] - 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: 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: 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: 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: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~a!base,]]] - 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: 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: 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: 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: 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: 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: 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: 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,]]] * 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 - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 35 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 71.8s, OverallIterations: 16, TraceHistogramMax: 42, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 455 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 445 mSDsluCounter, 2090 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1789 mSDsCounter, 249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4512 IncrementalHoareTripleChecker+Invalid, 4761 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 249 mSolverCounterUnsat, 301 mSDtfsCounter, 4512 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3485 GetRequests, 3000 SyntacticMatches, 11 SemanticMatches, 474 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5701 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=13, InterpolantAutomatonStates: 222, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 14 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 15.2s SatisfiabilityAnalysisTime, 46.7s InterpolantComputationTime, 3845 NumberOfCodeBlocks, 3763 NumberOfCodeBlocksAsserted, 115 NumberOfCheckSat, 4520 ConstructedInterpolants, 0 QuantifiedInterpolants, 16275 SizeOfPredicates, 119 NumberOfNonLiveVariables, 6640 ConjunctsInSsa, 708 ConjunctsInUnsatCore, 32 InterpolantComputations, 6 PerfectInterpolantSequences, 47277/48580 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 5 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-12 19:59:52,716 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