./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_egcd3-ll.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_nla-digbench/recursified_egcd3-ll.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 31cf2fabf53e081c3004f39943d7e98ce7bd9dc5e02db94d5bcffe73b0927449 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 20:35:37,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:35:37,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:35:37,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:35:37,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:35:37,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:35:37,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:35:37,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:35:37,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:35:37,477 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:35:37,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:35:37,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:35:37,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:35:37,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:35:37,478 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:35:37,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:35:37,479 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:35:37,479 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:35:37,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:35:37,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:35:37,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:35:37,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:35:37,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:35:37,483 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:35:37,483 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:35:37,483 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:35:37,484 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:35:37,484 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:35:37,484 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:35:37,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:35:37,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:35:37,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:35:37,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:35:37,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:35:37,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:35:37,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:35:37,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:35:37,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:35:37,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:35:37,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:35:37,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:35:37,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:35:37,489 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 -> 31cf2fabf53e081c3004f39943d7e98ce7bd9dc5e02db94d5bcffe73b0927449 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 20:35:37,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:35:37,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:35:37,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:35:37,681 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:35:37,682 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:35:37,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_nla-digbench/recursified_egcd3-ll.c [2024-09-11 20:35:38,939 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:35:39,069 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:35:39,076 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_nla-digbench/recursified_egcd3-ll.c [2024-09-11 20:35:39,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c0af8e4ff/4eef4df582314b44bb45e16e705f1314/FLAG423805120 [2024-09-11 20:35:39,491 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c0af8e4ff/4eef4df582314b44bb45e16e705f1314 [2024-09-11 20:35:39,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:35:39,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:35:39,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:35:39,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:35:39,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:35:39,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:35:39" (1/1) ... [2024-09-11 20:35:39,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@346fa7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:35:39, skipping insertion in model container [2024-09-11 20:35:39,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:35:39" (1/1) ... [2024-09-11 20:35:39,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:35:39,678 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_nla-digbench/recursified_egcd3-ll.c[1052,1065] [2024-09-11 20:35:39,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:35:39,733 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:35:39,744 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_nla-digbench/recursified_egcd3-ll.c[1052,1065] [2024-09-11 20:35:39,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:35:39,800 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:35:39,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:35:39 WrapperNode [2024-09-11 20:35:39,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:35:39,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:35:39,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:35:39,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:35:39,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:35:39" (1/1) ... [2024-09-11 20:35:39,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:35:39" (1/1) ... [2024-09-11 20:35:39,827 INFO L138 Inliner]: procedures = 18, calls = 127, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 95 [2024-09-11 20:35:39,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:35:39,828 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:35:39,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:35:39,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:35:39,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:35:39" (1/1) ... [2024-09-11 20:35:39,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:35:39" (1/1) ... [2024-09-11 20:35:39,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:35:39" (1/1) ... [2024-09-11 20:35:39,867 INFO L175 MemorySlicer]: Split 77 memory accesses to 13 slices as follows [5, 2, 7, 6, 6, 5, 6, 6, 5, 9, 6, 7, 7]. 12 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. The 22 writes are split as follows [2, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1]. [2024-09-11 20:35:39,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:35:39" (1/1) ... [2024-09-11 20:35:39,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:35:39" (1/1) ... [2024-09-11 20:35:39,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:35:39" (1/1) ... [2024-09-11 20:35:39,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:35:39" (1/1) ... [2024-09-11 20:35:39,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:35:39" (1/1) ... [2024-09-11 20:35:39,881 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:35:39" (1/1) ... [2024-09-11 20:35:39,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:35:39,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:35:39,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:35:39,887 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:35:39,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:35:39" (1/1) ... [2024-09-11 20:35:39,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:35:39,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:35:39,929 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-11 20:35:39,932 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-11 20:35:39,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:35:39,977 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-11 20:35:39,978 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-11 20:35:39,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:35:39,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-11 20:35:39,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-11 20:35:39,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-11 20:35:39,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-09-11 20:35:39,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-09-11 20:35:39,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-09-11 20:35:39,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-09-11 20:35:39,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-09-11 20:35:39,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-09-11 20:35:39,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-09-11 20:35:39,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-09-11 20:35:39,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-09-11 20:35:39,982 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_47_to_56_0 [2024-09-11 20:35:39,982 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_47_to_56_0 [2024-09-11 20:35:39,982 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_33_to_70_0 [2024-09-11 20:35:39,982 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_33_to_70_0 [2024-09-11 20:35:39,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-11 20:35:39,982 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_40_to_59_0 [2024-09-11 20:35:39,983 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_40_to_59_0 [2024-09-11 20:35:39,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-11 20:35:39,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-11 20:35:39,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-11 20:35:39,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-11 20:35:39,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-09-11 20:35:39,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-09-11 20:35:39,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-09-11 20:35:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-09-11 20:35:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-09-11 20:35:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-09-11 20:35:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-09-11 20:35:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-09-11 20:35:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-09-11 20:35:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:35:39,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:35:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-11 20:35:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-11 20:35:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-11 20:35:39,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-11 20:35:39,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-09-11 20:35:39,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-09-11 20:35:39,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-09-11 20:35:39,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-09-11 20:35:39,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-09-11 20:35:39,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-09-11 20:35:39,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-09-11 20:35:39,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-09-11 20:35:39,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-09-11 20:35:39,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 20:35:39,989 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 20:35:39,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-11 20:35:40,130 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:35:40,133 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:35:40,346 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-09-11 20:35:40,346 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:35:40,381 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:35:40,381 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-11 20:35:40,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:35:40 BoogieIcfgContainer [2024-09-11 20:35:40,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:35:40,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:35:40,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:35:40,387 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:35:40,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:35:39" (1/3) ... [2024-09-11 20:35:40,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de48093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:35:40, skipping insertion in model container [2024-09-11 20:35:40,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:35:39" (2/3) ... [2024-09-11 20:35:40,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de48093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:35:40, skipping insertion in model container [2024-09-11 20:35:40,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:35:40" (3/3) ... [2024-09-11 20:35:40,390 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_egcd3-ll.c [2024-09-11 20:35:40,401 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:35:40,402 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:35:40,457 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:35:40,462 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;@4cac1ba2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:35:40,462 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:35:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 34 states have internal predecessors, (39), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-11 20:35:40,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-11 20:35:40,471 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:35:40,472 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:35:40,472 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:35:40,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:35:40,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1622724067, now seen corresponding path program 1 times [2024-09-11 20:35:40,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:35:40,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204677079] [2024-09-11 20:35:40,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:35:40,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:35:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:35:40,635 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:35:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:35:40,641 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:35:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:35:40,685 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-11 20:35:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:35:40,702 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-11 20:35:40,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:35:40,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204677079] [2024-09-11 20:35:40,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204677079] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:35:40,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:35:40,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 20:35:40,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895497456] [2024-09-11 20:35:40,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:35:40,708 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 20:35:40,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:35:40,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 20:35:40,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 20:35:40,726 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 34 states have internal predecessors, (39), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 20:35:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:35:40,914 INFO L93 Difference]: Finished difference Result 104 states and 149 transitions. [2024-09-11 20:35:40,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 20:35:40,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-09-11 20:35:40,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:35:40,924 INFO L225 Difference]: With dead ends: 104 [2024-09-11 20:35:40,925 INFO L226 Difference]: Without dead ends: 54 [2024-09-11 20:35:40,928 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 20:35:40,931 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:35:40,931 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 28 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:35:40,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-11 20:35:40,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2024-09-11 20:35:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 33 states have internal predecessors, (33), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-11 20:35:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2024-09-11 20:35:40,979 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 23 [2024-09-11 20:35:40,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:35:40,980 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-09-11 20:35:40,981 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 20:35:40,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:35:40,983 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-09-11 20:35:40,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-11 20:35:40,985 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:35:40,985 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:35:40,985 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:35:40,985 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:35:40,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:35:40,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1864870065, now seen corresponding path program 1 times [2024-09-11 20:35:40,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:35:40,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713752293] [2024-09-11 20:35:40,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:35:40,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:35:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:35:41,392 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:35:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:35:41,396 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:35:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:35:41,452 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-11 20:35:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:35:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:35:41,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:35:41,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713752293] [2024-09-11 20:35:41,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713752293] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:35:41,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:35:41,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-11 20:35:41,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212394514] [2024-09-11 20:35:41,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:35:41,531 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-11 20:35:41,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:35:41,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-11 20:35:41,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-09-11 20:35:41,534 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-11 20:35:42,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:35:42,047 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2024-09-11 20:35:42,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-11 20:35:42,048 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2024-09-11 20:35:42,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:35:42,050 INFO L225 Difference]: With dead ends: 62 [2024-09-11 20:35:42,050 INFO L226 Difference]: Without dead ends: 54 [2024-09-11 20:35:42,050 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-09-11 20:35:42,051 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:35:42,052 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 86 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:35:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-11 20:35:42,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2024-09-11 20:35:42,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 34 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2024-09-11 20:35:42,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2024-09-11 20:35:42,063 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 24 [2024-09-11 20:35:42,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:35:42,063 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2024-09-11 20:35:42,064 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-11 20:35:42,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:35:42,064 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2024-09-11 20:35:42,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-11 20:35:42,065 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:35:42,065 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:35:42,065 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 20:35:42,066 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:35:42,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:35:42,067 INFO L85 PathProgramCache]: Analyzing trace with hash -176414272, now seen corresponding path program 1 times [2024-09-11 20:35:42,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:35:42,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335215496] [2024-09-11 20:35:42,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:35:42,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:35:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:35:42,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [403587500] [2024-09-11 20:35:42,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:35:42,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:35:42,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:35:42,108 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-11 20:35:42,124 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-11 20:35:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:35:42,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 198 conjuncts are in the unsatisfiable core [2024-09-11 20:35:42,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:35:42,379 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-11 20:35:42,386 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-11 20:35:42,434 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-11 20:35:42,439 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-11 20:35:42,444 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 11 [2024-09-11 20:35:42,453 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 11 [2024-09-11 20:35:42,589 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-11 20:35:42,739 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 19 treesize of output 11 [2024-09-11 20:35:42,745 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 19 treesize of output 11 [2024-09-11 20:35:42,938 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 30 treesize of output 18 [2024-09-11 20:35:42,943 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 26 treesize of output 14 [2024-09-11 20:35:42,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 22 treesize of output 10 [2024-09-11 20:35:43,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:35:43,026 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:35:43,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:35:43,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335215496] [2024-09-11 20:35:43,027 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:35:43,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403587500] [2024-09-11 20:35:43,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403587500] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:35:43,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:35:43,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-09-11 20:35:43,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387046939] [2024-09-11 20:35:43,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:35:43,028 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-11 20:35:43,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:35:43,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-11 20:35:43,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2024-09-11 20:35:43,031 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:35:43,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:35:43,997 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2024-09-11 20:35:43,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-11 20:35:43,997 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-09-11 20:35:43,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:35:44,000 INFO L225 Difference]: With dead ends: 88 [2024-09-11 20:35:44,000 INFO L226 Difference]: Without dead ends: 84 [2024-09-11 20:35:44,001 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2024-09-11 20:35:44,002 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 38 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-11 20:35:44,003 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 397 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-11 20:35:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-11 20:35:44,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2024-09-11 20:35:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 55 states have internal predecessors, (55), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2024-09-11 20:35:44,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2024-09-11 20:35:44,031 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 28 [2024-09-11 20:35:44,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:35:44,032 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2024-09-11 20:35:44,032 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:35:44,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:35:44,032 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2024-09-11 20:35:44,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-11 20:35:44,033 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:35:44,033 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-11 20:35:44,047 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 20:35:44,233 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:35:44,234 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:35:44,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:35:44,235 INFO L85 PathProgramCache]: Analyzing trace with hash -466915291, now seen corresponding path program 1 times [2024-09-11 20:35:44,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:35:44,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645774886] [2024-09-11 20:35:44,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:35:44,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:35:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:35:44,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1486534201] [2024-09-11 20:35:44,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:35:44,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:35:44,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:35:44,290 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-11 20:35:44,291 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-11 20:35:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:35:44,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 187 conjuncts are in the unsatisfiable core [2024-09-11 20:35:44,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:35:44,462 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-11 20:35:44,463 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-11 20:35:44,495 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 11 [2024-09-11 20:35:44,499 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 11 [2024-09-11 20:35:44,504 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-11 20:35:44,509 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-11 20:35:44,601 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 27 treesize of output 19 [2024-09-11 20:35:44,605 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 11 [2024-09-11 20:35:44,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-11 20:35:44,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-09-11 20:35:44,857 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 19 treesize of output 11 [2024-09-11 20:35:44,859 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-11 20:35:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:35:44,910 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:35:45,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:35:45,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:35:45,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645774886] [2024-09-11 20:35:45,322 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:35:45,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486534201] [2024-09-11 20:35:45,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486534201] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-11 20:35:45,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:35:45,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 23 [2024-09-11 20:35:45,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087884721] [2024-09-11 20:35:45,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:35:45,323 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-11 20:35:45,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:35:45,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-11 20:35:45,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-09-11 20:35:45,324 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 20:35:46,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:35:46,489 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2024-09-11 20:35:46,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-11 20:35:46,491 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-09-11 20:35:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:35:46,492 INFO L225 Difference]: With dead ends: 109 [2024-09-11 20:35:46,492 INFO L226 Difference]: Without dead ends: 107 [2024-09-11 20:35:46,493 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2024-09-11 20:35:46,494 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 31 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-09-11 20:35:46,494 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 350 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-09-11 20:35:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-09-11 20:35:46,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-09-11 20:35:46,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 65 states have (on average 1.123076923076923) internal successors, (73), 73 states have internal predecessors, (73), 28 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 26 states have call predecessors, (28), 27 states have call successors, (28) [2024-09-11 20:35:46,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2024-09-11 20:35:46,520 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 34 [2024-09-11 20:35:46,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:35:46,521 INFO L474 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2024-09-11 20:35:46,521 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 20:35:46,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:35:46,521 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2024-09-11 20:35:46,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-11 20:35:46,522 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:35:46,522 INFO L216 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-09-11 20:35:46,535 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 20:35:46,725 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:35:46,725 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:35:46,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:35:46,726 INFO L85 PathProgramCache]: Analyzing trace with hash 212011526, now seen corresponding path program 1 times [2024-09-11 20:35:46,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:35:46,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703084028] [2024-09-11 20:35:46,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:35:46,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:35:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:35:47,185 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:35:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:35:47,202 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:35:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:35:47,229 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-11 20:35:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:35:47,437 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:35:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:35:47,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 20:35:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:35:47,520 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-11 20:35:47,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:35:47,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703084028] [2024-09-11 20:35:47,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703084028] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:35:47,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353253806] [2024-09-11 20:35:47,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:35:47,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:35:47,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:35:47,527 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-11 20:35:47,529 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-11 20:35:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:35:47,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-09-11 20:35:47,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:35:47,764 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 23 treesize of output 15 [2024-09-11 20:35:47,768 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-11 20:35:47,834 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-11 20:35:47,866 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 27 treesize of output 19 [2024-09-11 20:35:47,868 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-11 20:35:47,962 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 19 treesize of output 11 [2024-09-11 20:35:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:35:47,983 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:35:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:35:48,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353253806] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:35:48,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:35:48,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 17] total 41 [2024-09-11 20:35:48,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562645998] [2024-09-11 20:35:48,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:35:48,631 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-09-11 20:35:48,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:35:48,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-09-11 20:35:48,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1496, Unknown=0, NotChecked=0, Total=1640 [2024-09-11 20:35:48,634 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand has 41 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 35 states have internal predecessors, (58), 14 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (14), 8 states have call predecessors, (14), 13 states have call successors, (14) [2024-09-11 20:35:52,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:35:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:35:53,997 INFO L93 Difference]: Finished difference Result 134 states and 164 transitions. [2024-09-11 20:35:53,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-11 20:35:53,998 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 35 states have internal predecessors, (58), 14 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (14), 8 states have call predecessors, (14), 13 states have call successors, (14) Word has length 37 [2024-09-11 20:35:53,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:35:54,000 INFO L225 Difference]: With dead ends: 134 [2024-09-11 20:35:54,001 INFO L226 Difference]: Without dead ends: 126 [2024-09-11 20:35:54,002 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=373, Invalid=2933, Unknown=0, NotChecked=0, Total=3306 [2024-09-11 20:35:54,002 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 93 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 76 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-09-11 20:35:54,002 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 79 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1210 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2024-09-11 20:35:54,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-09-11 20:35:54,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 118. [2024-09-11 20:35:54,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 72 states have (on average 1.1111111111111112) internal successors, (80), 80 states have internal predecessors, (80), 29 states have call successors, (29), 13 states have call predecessors, (29), 16 states have return successors, (35), 28 states have call predecessors, (35), 28 states have call successors, (35) [2024-09-11 20:35:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 144 transitions. [2024-09-11 20:35:54,044 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 144 transitions. Word has length 37 [2024-09-11 20:35:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:35:54,044 INFO L474 AbstractCegarLoop]: Abstraction has 118 states and 144 transitions. [2024-09-11 20:35:54,044 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 35 states have internal predecessors, (58), 14 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (14), 8 states have call predecessors, (14), 13 states have call successors, (14) [2024-09-11 20:35:54,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:35:54,044 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 144 transitions. [2024-09-11 20:35:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-11 20:35:54,045 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:35:54,045 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 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-11 20:35:54,059 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 20:35:54,245 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:35:54,245 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:35:54,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:35:54,247 INFO L85 PathProgramCache]: Analyzing trace with hash 451765875, now seen corresponding path program 1 times [2024-09-11 20:35:54,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:35:54,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636540424] [2024-09-11 20:35:54,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:35:54,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:35:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:35:54,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [141476446] [2024-09-11 20:35:54,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:35:54,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:35:54,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:35:54,298 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-11 20:35:54,302 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-11 20:35:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:35:54,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 221 conjuncts are in the unsatisfiable core [2024-09-11 20:35:54,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:35:54,525 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-11 20:35:54,580 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-11 20:35:54,584 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 23 treesize of output 15 [2024-09-11 20:35:54,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-11 20:35:54,590 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 11 [2024-09-11 20:35:54,594 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-11 20:35:54,678 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-11 20:35:54,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-11 20:35:54,938 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 17 [2024-09-11 20:35:55,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 11 treesize of output 7 [2024-09-11 20:35:55,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 20:35:55,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 47 [2024-09-11 20:35:55,064 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-09-11 20:35:55,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 54 [2024-09-11 20:35: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 11 treesize of output 7 [2024-09-11 20:35:55,371 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 26 treesize of output 14 [2024-09-11 20:35:55,374 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-11 20:35:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:35:55,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:35:56,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:35:56,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636540424] [2024-09-11 20:35:56,458 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:35:56,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141476446] [2024-09-11 20:35:56,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141476446] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:35:56,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:35:56,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2024-09-11 20:35:56,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280163926] [2024-09-11 20:35:56,459 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-11 20:35:56,459 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-11 20:35:56,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:35:56,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-11 20:35:56,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2024-09-11 20:35:56,461 INFO L87 Difference]: Start difference. First operand 118 states and 144 transitions. Second operand has 25 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 17 states have internal predecessors, (28), 7 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-11 20:36:00,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:36:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:36:03,200 INFO L93 Difference]: Finished difference Result 171 states and 205 transitions. [2024-09-11 20:36:03,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-11 20:36:03,201 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 17 states have internal predecessors, (28), 7 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2024-09-11 20:36:03,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:36:03,202 INFO L225 Difference]: With dead ends: 171 [2024-09-11 20:36:03,202 INFO L226 Difference]: Without dead ends: 165 [2024-09-11 20:36:03,203 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=239, Invalid=2953, Unknown=0, NotChecked=0, Total=3192 [2024-09-11 20:36:03,203 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 160 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 67 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:36:03,204 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 458 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1408 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2024-09-11 20:36:03,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-09-11 20:36:03,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 160. [2024-09-11 20:36:03,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 99 states have (on average 1.1111111111111112) internal successors, (110), 109 states have internal predecessors, (110), 38 states have call successors, (38), 19 states have call predecessors, (38), 22 states have return successors, (47), 36 states have call predecessors, (47), 37 states have call successors, (47) [2024-09-11 20:36:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 195 transitions. [2024-09-11 20:36:03,242 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 195 transitions. Word has length 39 [2024-09-11 20:36:03,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:36:03,242 INFO L474 AbstractCegarLoop]: Abstraction has 160 states and 195 transitions. [2024-09-11 20:36:03,243 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 17 states have internal predecessors, (28), 7 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-11 20:36:03,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:36:03,243 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2024-09-11 20:36:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-11 20:36:03,244 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:36:03,244 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:36:03,258 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-11 20:36:03,447 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:36:03,448 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:36:03,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:36:03,448 INFO L85 PathProgramCache]: Analyzing trace with hash -603691064, now seen corresponding path program 1 times [2024-09-11 20:36:03,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:36:03,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634609324] [2024-09-11 20:36:03,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:36:03,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:36:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:36:03,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1759465555] [2024-09-11 20:36:03,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:36:03,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:36:03,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:36:03,495 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-11 20:36:03,499 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-11 20:36:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:36:03,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-09-11 20:36:03,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:36:03,661 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 11 [2024-09-11 20:36:03,663 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-11 20:36:03,664 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 11 [2024-09-11 20:36:03,666 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-11 20:36:03,668 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 11 [2024-09-11 20:36:03,672 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-11 20:36:03,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-09-11 20:36:03,814 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 19 treesize of output 11 [2024-09-11 20:36:03,816 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-11 20:36:03,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 20:36:03,843 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:36:03,981 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 20:36:03,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:36:03,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634609324] [2024-09-11 20:36:03,982 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:36:03,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759465555] [2024-09-11 20:36:03,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759465555] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-11 20:36:03,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:36:03,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 17 [2024-09-11 20:36:03,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012228982] [2024-09-11 20:36:03,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:36:03,983 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 20:36:03,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:36:03,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 20:36:03,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-09-11 20:36:03,984 INFO L87 Difference]: Start difference. First operand 160 states and 195 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 20:36:04,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:36:04,368 INFO L93 Difference]: Finished difference Result 212 states and 258 transitions. [2024-09-11 20:36:04,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 20:36:04,368 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2024-09-11 20:36:04,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:36:04,370 INFO L225 Difference]: With dead ends: 212 [2024-09-11 20:36:04,370 INFO L226 Difference]: Without dead ends: 210 [2024-09-11 20:36:04,370 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-09-11 20:36:04,371 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 25 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:36:04,371 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 315 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:36:04,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-09-11 20:36:04,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2024-09-11 20:36:04,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 129 states have (on average 1.1162790697674418) internal successors, (144), 143 states have internal predecessors, (144), 50 states have call successors, (50), 25 states have call predecessors, (50), 28 states have return successors, (59), 46 states have call predecessors, (59), 49 states have call successors, (59) [2024-09-11 20:36:04,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 253 transitions. [2024-09-11 20:36:04,439 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 253 transitions. Word has length 40 [2024-09-11 20:36:04,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:36:04,439 INFO L474 AbstractCegarLoop]: Abstraction has 208 states and 253 transitions. [2024-09-11 20:36:04,439 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 20:36:04,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:36:04,440 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 253 transitions. [2024-09-11 20:36:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-11 20:36:04,440 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:36:04,441 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1] [2024-09-11 20:36:04,458 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-11 20:36:04,644 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-11 20:36:04,645 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:36:04,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:36:04,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1785388392, now seen corresponding path program 1 times [2024-09-11 20:36:04,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:36:04,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695796251] [2024-09-11 20:36:04,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:36:04,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:36:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:36:04,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [861645922] [2024-09-11 20:36:04,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:36:04,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:36:04,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:36:04,684 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-11 20:36:04,692 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-11 20:36:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:36:04,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 252 conjuncts are in the unsatisfiable core [2024-09-11 20:36:04,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:36:04,927 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-11 20:36:04,967 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-11 20:36:04,970 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-11 20:36:04,975 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-11 20:36:04,979 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 11 [2024-09-11 20:36:04,983 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-11 20:36:05,078 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 27 treesize of output 19 [2024-09-11 20:36:05,081 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 11 [2024-09-11 20:36:05,088 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-11 20:36:05,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-11 20:36:05,243 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-11 20:36:05,249 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 27 treesize of output 19 [2024-09-11 20:36:05,252 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 11 [2024-09-11 20:36:05,257 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-11 20:36:05,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-09-11 20:36:05,627 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 26 treesize of output 14 [2024-09-11 20:36:05,629 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 22 treesize of output 10 [2024-09-11 20:36:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:36:05,694 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:36:05,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:36:05,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695796251] [2024-09-11 20:36:05,841 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:36:05,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861645922] [2024-09-11 20:36:05,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861645922] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:36:05,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:36:05,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2024-09-11 20:36:05,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218543789] [2024-09-11 20:36:05,841 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-11 20:36:05,841 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-11 20:36:05,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:36:05,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-11 20:36:05,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2024-09-11 20:36:05,843 INFO L87 Difference]: Start difference. First operand 208 states and 253 transitions. Second operand has 23 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 8 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 20:36:09,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:36:11,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:36:11,457 INFO L93 Difference]: Finished difference Result 229 states and 270 transitions. [2024-09-11 20:36:11,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-09-11 20:36:11,458 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 8 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 45 [2024-09-11 20:36:11,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:36:11,460 INFO L225 Difference]: With dead ends: 229 [2024-09-11 20:36:11,460 INFO L226 Difference]: Without dead ends: 227 [2024-09-11 20:36:11,460 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=159, Invalid=1323, Unknown=0, NotChecked=0, Total=1482 [2024-09-11 20:36:11,461 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 138 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 53 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:36:11,461 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 471 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1195 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2024-09-11 20:36:11,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-09-11 20:36:11,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 220. [2024-09-11 20:36:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 138 states have (on average 1.1159420289855073) internal successors, (154), 152 states have internal predecessors, (154), 50 states have call successors, (50), 28 states have call predecessors, (50), 31 states have return successors, (59), 46 states have call predecessors, (59), 49 states have call successors, (59) [2024-09-11 20:36:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 263 transitions. [2024-09-11 20:36:11,522 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 263 transitions. Word has length 45 [2024-09-11 20:36:11,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:36:11,523 INFO L474 AbstractCegarLoop]: Abstraction has 220 states and 263 transitions. [2024-09-11 20:36:11,523 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 8 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 20:36:11,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:36:11,523 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 263 transitions. [2024-09-11 20:36:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-11 20:36:11,524 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:36:11,524 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 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, 1, 1, 1, 1] [2024-09-11 20:36:11,539 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-11 20:36:11,726 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:36:11,726 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:36:11,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:36:11,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1730585129, now seen corresponding path program 1 times [2024-09-11 20:36:11,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:36:11,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206287412] [2024-09-11 20:36:11,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:36:11,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:36:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:36:11,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1826450194] [2024-09-11 20:36:11,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:36:11,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:36:11,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:36:11,782 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-11 20:36:11,787 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-11 20:36:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:36:11,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-09-11 20:36:11,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:36:11,963 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-11 20:36:11,965 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 11 [2024-09-11 20:36:11,966 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-11 20:36:11,969 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 11 [2024-09-11 20:36:11,972 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-11 20:36:12,101 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 19 treesize of output 11 [2024-09-11 20:36:12,104 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-11 20:36:12,127 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-11 20:36:12,127 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:36:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-11 20:36:12,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:36:12,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206287412] [2024-09-11 20:36:12,220 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:36:12,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826450194] [2024-09-11 20:36:12,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826450194] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-11 20:36:12,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:36:12,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2024-09-11 20:36:12,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232227669] [2024-09-11 20:36:12,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:36:12,221 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-11 20:36:12,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:36:12,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-11 20:36:12,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-09-11 20:36:12,222 INFO L87 Difference]: Start difference. First operand 220 states and 263 transitions. Second operand has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 20:36:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:36:12,493 INFO L93 Difference]: Finished difference Result 258 states and 312 transitions. [2024-09-11 20:36:12,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 20:36:12,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2024-09-11 20:36:12,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:36:12,497 INFO L225 Difference]: With dead ends: 258 [2024-09-11 20:36:12,497 INFO L226 Difference]: Without dead ends: 256 [2024-09-11 20:36:12,498 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-09-11 20:36:12,498 INFO L434 NwaCegarLoop]: 48 mSDtfsCounter, 16 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:36:12,498 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 279 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:36:12,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-09-11 20:36:12,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 228. [2024-09-11 20:36:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 144 states have (on average 1.1041666666666667) internal successors, (159), 158 states have internal predecessors, (159), 50 states have call successors, (50), 30 states have call predecessors, (50), 33 states have return successors, (59), 46 states have call predecessors, (59), 49 states have call successors, (59) [2024-09-11 20:36:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 268 transitions. [2024-09-11 20:36:12,571 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 268 transitions. Word has length 46 [2024-09-11 20:36:12,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:36:12,571 INFO L474 AbstractCegarLoop]: Abstraction has 228 states and 268 transitions. [2024-09-11 20:36:12,571 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 20:36:12,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:36:12,572 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 268 transitions. [2024-09-11 20:36:12,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-11 20:36:12,572 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:36:12,572 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:36:12,586 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-11 20:36:12,776 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:36:12,777 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:36:12,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:36:12,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1711293408, now seen corresponding path program 2 times [2024-09-11 20:36:12,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:36:12,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200188579] [2024-09-11 20:36:12,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:36:12,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:36:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:36:14,080 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:36:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:36:14,082 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:36:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:36:14,096 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 20:36:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:36:14,172 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-11 20:36:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:36:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-11 20:36:14,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:36:14,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200188579] [2024-09-11 20:36:14,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200188579] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:36:14,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125159751] [2024-09-11 20:36:14,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:36:14,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:36:14,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:36:14,262 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-11 20:36:14,266 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-11 20:36:14,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:36:14,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:36:14,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-09-11 20:36:14,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:36:14,598 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-11 20:36:14,630 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-11 20:36:14,733 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 11 [2024-09-11 20:36:14,736 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 29 treesize of output 21 [2024-09-11 20:36:14,739 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 40 treesize of output 17 [2024-09-11 20:36:14,796 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-11 20:36:14,798 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 17 [2024-09-11 20:36:14,819 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 13 treesize of output 9 [2024-09-11 20:36:14,857 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-11 20:36:14,857 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:36:14,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125159751] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:36:14,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:36:14,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 23 [2024-09-11 20:36:14,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555056847] [2024-09-11 20:36:14,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:36:14,858 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-11 20:36:14,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:36:14,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-11 20:36:14,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2024-09-11 20:36:14,859 INFO L87 Difference]: Start difference. First operand 228 states and 268 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 9 states have internal predecessors, (29), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-11 20:36:15,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:36:15,430 INFO L93 Difference]: Finished difference Result 311 states and 374 transitions. [2024-09-11 20:36:15,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-11 20:36:15,431 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 9 states have internal predecessors, (29), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 50 [2024-09-11 20:36:15,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:36:15,432 INFO L225 Difference]: With dead ends: 311 [2024-09-11 20:36:15,433 INFO L226 Difference]: Without dead ends: 235 [2024-09-11 20:36:15,435 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2024-09-11 20:36:15,435 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 53 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:36:15,435 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 122 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:36:15,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-09-11 20:36:15,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 230. [2024-09-11 20:36:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 146 states have (on average 1.1027397260273972) internal successors, (161), 160 states have internal predecessors, (161), 51 states have call successors, (51), 31 states have call predecessors, (51), 32 states have return successors, (56), 46 states have call predecessors, (56), 50 states have call successors, (56) [2024-09-11 20:36:15,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 268 transitions. [2024-09-11 20:36:15,523 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 268 transitions. Word has length 50 [2024-09-11 20:36:15,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:36:15,523 INFO L474 AbstractCegarLoop]: Abstraction has 230 states and 268 transitions. [2024-09-11 20:36:15,523 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 9 states have internal predecessors, (29), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-11 20:36:15,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:36:15,523 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 268 transitions. [2024-09-11 20:36:15,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-09-11 20:36:15,524 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:36:15,525 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:36:15,533 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-11 20:36:15,728 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:36:15,729 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:36:15,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:36:15,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1015102913, now seen corresponding path program 1 times [2024-09-11 20:36:15,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:36:15,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081031085] [2024-09-11 20:36:15,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:36:15,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:36:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:36:16,677 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:36:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:36:16,679 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:36:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:36:16,689 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 20:36:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:36:16,859 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:36:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:36:16,863 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-11 20:36:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:36:16,866 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:36:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:36:16,872 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-11 20:36:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:36:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-11 20:36:16,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:36:16,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081031085] [2024-09-11 20:36:16,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081031085] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:36:16,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:36:16,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-09-11 20:36:16,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069590365] [2024-09-11 20:36:16,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:36:16,877 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-11 20:36:16,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:36:16,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-11 20:36:16,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-09-11 20:36:16,879 INFO L87 Difference]: Start difference. First operand 230 states and 268 transitions. Second operand has 12 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 6 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-11 20:36:17,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:36:17,430 INFO L93 Difference]: Finished difference Result 421 states and 515 transitions. [2024-09-11 20:36:17,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-11 20:36:17,430 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 6 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2024-09-11 20:36:17,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:36:17,433 INFO L225 Difference]: With dead ends: 421 [2024-09-11 20:36:17,433 INFO L226 Difference]: Without dead ends: 275 [2024-09-11 20:36:17,434 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2024-09-11 20:36:17,435 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 37 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:36:17,435 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 217 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:36:17,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-09-11 20:36:17,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 265. [2024-09-11 20:36:17,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 168 states have (on average 1.0892857142857142) internal successors, (183), 182 states have internal predecessors, (183), 55 states have call successors, (55), 34 states have call predecessors, (55), 41 states have return successors, (72), 50 states have call predecessors, (72), 54 states have call successors, (72) [2024-09-11 20:36:17,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 310 transitions. [2024-09-11 20:36:17,574 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 310 transitions. Word has length 63 [2024-09-11 20:36:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:36:17,575 INFO L474 AbstractCegarLoop]: Abstraction has 265 states and 310 transitions. [2024-09-11 20:36:17,575 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 6 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-11 20:36:17,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:36:17,575 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 310 transitions. [2024-09-11 20:36:17,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-11 20:36:17,576 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:36:17,576 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:36:17,576 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-11 20:36:17,576 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:36:17,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:36:17,577 INFO L85 PathProgramCache]: Analyzing trace with hash 861698770, now seen corresponding path program 1 times [2024-09-11 20:36:17,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:36:17,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671716699] [2024-09-11 20:36:17,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:36:17,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:36:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:36:17,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1519933534] [2024-09-11 20:36:17,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:36:17,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:36:17,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:36:17,652 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-11 20:36:17,655 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-11 20:36:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:36:17,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 208 conjuncts are in the unsatisfiable core [2024-09-11 20:36:17,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:36:18,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-11 20:36:18,094 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 11 [2024-09-11 20:36:18,098 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 11 [2024-09-11 20:36:18,102 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-11 20:36:18,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-11 20:36:18,114 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-11 20:36:18,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-11 20:36:18,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-11 20:36:18,378 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 11 [2024-09-11 20:36:18,424 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-11 20:36:18,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-11 20:36:18,660 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-11 20:36:18,674 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 11 [2024-09-11 20:36:18,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-11 20:36:40,213 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 35 treesize of output 27 [2024-09-11 20:36:44,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-11 20:36:44,431 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-11 20:36:44,498 INFO L349 Elim1Store]: treesize reduction 18, result has 52.6 percent of original size [2024-09-11 20:36:44,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 47 [2024-09-11 20:36:48,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 20:36:48,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 88 [2024-09-11 20:37:10,788 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-11 20:37:10,796 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-11 20:37:10,805 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-11 20:37:10,818 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 13 [2024-09-11 20:37:10,829 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 46 treesize of output 34 [2024-09-11 20:37:10,858 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 46 treesize of output 30 [2024-09-11 20:37:15,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 20:37:15,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 36 [2024-09-11 20:37:15,309 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 49 treesize of output 29 [2024-09-11 20:37:15,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 20:37:15,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 52 [2024-09-11 20:37:15,495 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-11 20:37:15,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:37:19,582 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 56 treesize of output 50 [2024-09-11 20:37:19,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 98 treesize of output 94 [2024-09-11 20:37:19,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:37:19,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671716699] [2024-09-11 20:37:19,849 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:37:19,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519933534] [2024-09-11 20:37:19,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519933534] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:37:19,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:37:19,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2024-09-11 20:37:19,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722507684] [2024-09-11 20:37:19,850 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-11 20:37:19,850 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-11 20:37:19,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:37:19,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-11 20:37:19,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1059, Unknown=13, NotChecked=0, Total=1190 [2024-09-11 20:37:19,851 INFO L87 Difference]: Start difference. First operand 265 states and 310 transitions. Second operand has 32 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 24 states have internal predecessors, (42), 9 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-09-11 20:37:23,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:37:27,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:37:32,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:37:41,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:37:45,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:37:49,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:37:55,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:37:59,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:38:03,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:38:11,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:38:16,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:38:20,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:38:24,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:38:28,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:38:52,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:38:56,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:39:00,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:39:04,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:39:04,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:39:04,914 INFO L93 Difference]: Finished difference Result 289 states and 345 transitions. [2024-09-11 20:39:04,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-09-11 20:39:04,915 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 24 states have internal predecessors, (42), 9 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) Word has length 74 [2024-09-11 20:39:04,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:39:04,916 INFO L225 Difference]: With dead ends: 289 [2024-09-11 20:39:04,917 INFO L226 Difference]: Without dead ends: 281 [2024-09-11 20:39:04,917 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 84.0s TimeCoverageRelationStatistics Valid=312, Invalid=2861, Unknown=19, NotChecked=0, Total=3192 [2024-09-11 20:39:04,918 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 92 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 80 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 75.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 77.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:39:04,918 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 125 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1135 Invalid, 19 Unknown, 0 Unchecked, 77.3s Time] [2024-09-11 20:39:04,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-09-11 20:39:05,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 277. [2024-09-11 20:39:05,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 174 states have (on average 1.0862068965517242) internal successors, (189), 188 states have internal predecessors, (189), 56 states have call successors, (56), 34 states have call predecessors, (56), 46 states have return successors, (86), 55 states have call predecessors, (86), 55 states have call successors, (86) [2024-09-11 20:39:05,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 331 transitions. [2024-09-11 20:39:05,032 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 331 transitions. Word has length 74 [2024-09-11 20:39:05,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:39:05,032 INFO L474 AbstractCegarLoop]: Abstraction has 277 states and 331 transitions. [2024-09-11 20:39:05,032 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 24 states have internal predecessors, (42), 9 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-09-11 20:39:05,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:39:05,033 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 331 transitions. [2024-09-11 20:39:05,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-09-11 20:39:05,033 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:39:05,034 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:39:05,049 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-11 20:39:05,234 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-11 20:39:05,235 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:39:05,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:39:05,235 INFO L85 PathProgramCache]: Analyzing trace with hash 2030949439, now seen corresponding path program 1 times [2024-09-11 20:39:05,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:39:05,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240381214] [2024-09-11 20:39:05,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:39:05,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:39:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:39:05,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [179726450] [2024-09-11 20:39:05,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:39:05,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:39:05,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:39:05,310 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-11 20:39:05,314 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-11 20:39:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:39:05,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 265 conjuncts are in the unsatisfiable core [2024-09-11 20:39:05,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:39:05,619 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-11 20:39:05,624 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-11 20:39:05,629 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 11 [2024-09-11 20:39:05,632 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-11 20:39:05,635 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 11 [2024-09-11 20:39:05,640 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-11 20:39:05,709 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 11 [2024-09-11 20:39:05,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-11 20:39:05,916 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-11 20:39:05,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-11 20:39:15,411 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 50 treesize of output 38 [2024-09-11 20:39:19,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 20:39:19,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2024-09-11 20:39:23,973 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-09-11 20:39:23,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 73 [2024-09-11 20:39:28,246 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-11 20:39:28,437 INFO L349 Elim1Store]: treesize reduction 152, result has 41.8 percent of original size [2024-09-11 20:39:28,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 125 treesize of output 197 [2024-09-11 20:39:28,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 20:39:28,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 94 [2024-09-11 20:39:28,485 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 85 treesize of output 65 [2024-09-11 20:39:28,533 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-11 20:39:28,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 20:39:28,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 143 [2024-09-11 20:39:29,331 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 26 treesize of output 14 [2024-09-11 20:39:29,336 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-11 20:39:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-11 20:39:29,505 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:39:32,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:39:32,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240381214] [2024-09-11 20:39:32,193 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:39:32,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179726450] [2024-09-11 20:39:32,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179726450] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:39:32,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:39:32,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2024-09-11 20:39:32,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819314389] [2024-09-11 20:39:32,194 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-11 20:39:32,194 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-11 20:39:32,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:39:32,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-11 20:39:32,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1515, Unknown=4, NotChecked=0, Total=1640 [2024-09-11 20:39:32,195 INFO L87 Difference]: Start difference. First operand 277 states and 331 transitions. Second operand has 30 states, 25 states have (on average 1.64) internal successors, (41), 21 states have internal predecessors, (41), 10 states have call successors, (14), 10 states have call predecessors, (14), 5 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-09-11 20:39:36,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:39:40,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:39:45,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:39:53,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:39:58,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:40:03,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:40:07,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:40:11,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]