./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/duplets.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/duplets.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 ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:32:27,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:32:27,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:32:27,817 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:32:27,818 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:32:27,841 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:32:27,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:32:27,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:32:27,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:32:27,844 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:32:27,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:32:27,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:32:27,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:32:27,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:32:27,847 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:32:27,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:32:27,848 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:32:27,848 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:32:27,848 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:32:27,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:32:27,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:32:27,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:32:27,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:32:27,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:32:27,849 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:32:27,850 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:32:27,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:32:27,850 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:32:27,850 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:32:27,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:32:27,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:32:27,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:32:27,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:32:27,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:32:27,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:32:27,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:32:27,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:32:27,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:32:27,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:32:27,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:32:27,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:32:27,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:32:27,853 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 -> ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 14:32:28,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:32:28,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:32:28,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:32:28,057 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:32:28,057 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:32:28,058 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/duplets.c [2024-10-15 14:32:29,262 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:32:29,399 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:32:29,399 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/duplets.c [2024-10-15 14:32:29,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/aa231f749/3c5563e14163489ba039e3ebe7fdd2a0/FLAGe4d714df3 [2024-10-15 14:32:29,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/aa231f749/3c5563e14163489ba039e3ebe7fdd2a0 [2024-10-15 14:32:29,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:32:29,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:32:29,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:32:29,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:32:29,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:32:29,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:32:29" (1/1) ... [2024-10-15 14:32:29,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@520eb290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:32:29, skipping insertion in model container [2024-10-15 14:32:29,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:32:29" (1/1) ... [2024-10-15 14:32:29,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:32:29,568 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/duplets.c[485,498] [2024-10-15 14:32:29,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:32:29,593 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:32:29,601 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/duplets.c[485,498] [2024-10-15 14:32:29,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:32:29,628 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:32:29,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:32:29 WrapperNode [2024-10-15 14:32:29,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:32:29,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:32:29,632 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:32:29,632 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:32:29,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:32:29" (1/1) ... [2024-10-15 14:32:29,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:32:29" (1/1) ... [2024-10-15 14:32:29,647 INFO L138 Inliner]: procedures = 21, calls = 43, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:32:29,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:32:29,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:32:29,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:32:29,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:32:29,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:32:29" (1/1) ... [2024-10-15 14:32:29,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:32:29" (1/1) ... [2024-10-15 14:32:29,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:32:29" (1/1) ... [2024-10-15 14:32:29,669 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 7, 5, 5]. 37 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 5 writes are split as follows [0, 3, 1, 1]. [2024-10-15 14:32:29,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:32:29" (1/1) ... [2024-10-15 14:32:29,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:32:29" (1/1) ... [2024-10-15 14:32:29,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:32:29" (1/1) ... [2024-10-15 14:32:29,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:32:29" (1/1) ... [2024-10-15 14:32:29,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:32:29" (1/1) ... [2024-10-15 14:32:29,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:32:29" (1/1) ... [2024-10-15 14:32:29,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:32:29,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:32:29,685 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:32:29,685 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:32:29,685 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:32:29" (1/1) ... [2024-10-15 14:32:29,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:32:29,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:32:29,713 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-10-15 14:32:29,715 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-10-15 14:32:29,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:32:29,746 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2024-10-15 14:32:29,746 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2024-10-15 14:32:29,746 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-15 14:32:29,746 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-15 14:32:29,746 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:32:29,746 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:32:29,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:32:29,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-15 14:32:29,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-15 14:32:29,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-15 14:32:29,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-15 14:32:29,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 14:32:29,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-15 14:32:29,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-15 14:32:29,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-15 14:32:29,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:32:29,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:32:29,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-15 14:32:29,747 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2024-10-15 14:32:29,748 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2024-10-15 14:32:29,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:32:29,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:32:29,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 14:32:29,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-15 14:32:29,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-15 14:32:29,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-15 14:32:29,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-15 14:32:29,749 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-15 14:32:29,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 14:32:29,749 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 14:32:29,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 14:32:29,824 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:32:29,825 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:32:30,058 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-10-15 14:32:30,059 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:32:30,078 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:32:30,080 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 14:32:30,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:32:30 BoogieIcfgContainer [2024-10-15 14:32:30,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:32:30,082 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:32:30,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:32:30,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:32:30,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:32:29" (1/3) ... [2024-10-15 14:32:30,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6343153e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:32:30, skipping insertion in model container [2024-10-15 14:32:30,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:32:29" (2/3) ... [2024-10-15 14:32:30,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6343153e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:32:30, skipping insertion in model container [2024-10-15 14:32:30,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:32:30" (3/3) ... [2024-10-15 14:32:30,090 INFO L112 eAbstractionObserver]: Analyzing ICFG duplets.c [2024-10-15 14:32:30,101 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:32:30,101 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 14:32:30,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:32:30,141 INFO L333 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;@b59688, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:32:30,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 14:32:30,144 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-15 14:32:30,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-15 14:32:30,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:32:30,151 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:32:30,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:32:30,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:32:30,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1311007902, now seen corresponding path program 1 times [2024-10-15 14:32:30,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:32:30,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045352278] [2024-10-15 14:32:30,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:32:30,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:32:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:30,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:32:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:30,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:32:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:30,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:32:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:30,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:32:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:30,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 14:32:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:30,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:32:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:30,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:32:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:30,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:32:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 14:32:30,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:32:30,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045352278] [2024-10-15 14:32:30,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045352278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:32:30,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:32:30,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 14:32:30,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701391749] [2024-10-15 14:32:30,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:32:30,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-15 14:32:30,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:32:30,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 14:32:30,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 14:32:30,441 INFO L87 Difference]: Start difference. First operand has 54 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-15 14:32:30,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:32:30,625 INFO L93 Difference]: Finished difference Result 118 states and 170 transitions. [2024-10-15 14:32:30,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:32:30,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 46 [2024-10-15 14:32:30,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:32:30,634 INFO L225 Difference]: With dead ends: 118 [2024-10-15 14:32:30,634 INFO L226 Difference]: Without dead ends: 64 [2024-10-15 14:32:30,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:32:30,641 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 58 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:32:30,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 32 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:32:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-15 14:32:30,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2024-10-15 14:32:30,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-15 14:32:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2024-10-15 14:32:30,676 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 46 [2024-10-15 14:32:30,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:32:30,676 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2024-10-15 14:32:30,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-15 14:32:30,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:32:30,677 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2024-10-15 14:32:30,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-15 14:32:30,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:32:30,678 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:32:30,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:32:30,678 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:32:30,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:32:30,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1692327078, now seen corresponding path program 1 times [2024-10-15 14:32:30,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:32:30,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903133279] [2024-10-15 14:32:30,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:32:30,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:32:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:30,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:32:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:30,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:32:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:30,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:32:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:30,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:32:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:31,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 14:32:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:31,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:32:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:31,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:32:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:31,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:32:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:31,158 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-15 14:32:31,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:32:31,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903133279] [2024-10-15 14:32:31,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903133279] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:32:31,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679738126] [2024-10-15 14:32:31,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:32:31,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:32:31,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:32:31,162 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-10-15 14:32:31,164 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 14:32:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:31,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-15 14:32:31,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:32:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-15 14:32:31,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:32:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-15 14:32:31,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679738126] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:32:31,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:32:31,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 17 [2024-10-15 14:32:31,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550438099] [2024-10-15 14:32:31,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:32:31,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-15 14:32:31,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:32:31,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-15 14:32:31,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-10-15 14:32:31,574 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 8 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-15 14:32:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:32:32,052 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2024-10-15 14:32:32,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-15 14:32:32,052 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 8 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 46 [2024-10-15 14:32:32,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:32:32,054 INFO L225 Difference]: With dead ends: 99 [2024-10-15 14:32:32,054 INFO L226 Difference]: Without dead ends: 78 [2024-10-15 14:32:32,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2024-10-15 14:32:32,055 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 94 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:32:32,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 396 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:32:32,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-15 14:32:32,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 51. [2024-10-15 14:32:32,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-15 14:32:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2024-10-15 14:32:32,068 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 46 [2024-10-15 14:32:32,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:32:32,068 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2024-10-15 14:32:32,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 8 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-15 14:32:32,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:32:32,069 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2024-10-15 14:32:32,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-15 14:32:32,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:32:32,070 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:32:32,083 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 14:32:32,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:32:32,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:32:32,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:32:32,275 INFO L85 PathProgramCache]: Analyzing trace with hash -762329273, now seen corresponding path program 1 times [2024-10-15 14:32:32,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:32:32,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858761513] [2024-10-15 14:32:32,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:32:32,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:32:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:32,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:32:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:32,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:32:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:32,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:32:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:32,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:32:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:32,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 14:32:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:32,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:32:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:32,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:32:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:32,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:32:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:32,408 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 14:32:32,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:32:32,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858761513] [2024-10-15 14:32:32,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858761513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:32:32,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:32:32,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-15 14:32:32,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21016825] [2024-10-15 14:32:32,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:32:32,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-15 14:32:32,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:32:32,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-15 14:32:32,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:32:32,410 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-15 14:32:32,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:32:32,656 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2024-10-15 14:32:32,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 14:32:32,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 47 [2024-10-15 14:32:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:32:32,658 INFO L225 Difference]: With dead ends: 71 [2024-10-15 14:32:32,658 INFO L226 Difference]: Without dead ends: 69 [2024-10-15 14:32:32,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-15 14:32:32,659 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 74 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:32:32,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 185 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:32:32,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-15 14:32:32,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2024-10-15 14:32:32,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 37 states have internal predecessors, (41), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-15 14:32:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2024-10-15 14:32:32,673 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 47 [2024-10-15 14:32:32,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:32:32,674 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2024-10-15 14:32:32,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-15 14:32:32,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:32:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2024-10-15 14:32:32,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-15 14:32:32,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:32:32,677 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:32:32,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 14:32:32,677 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:32:32,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:32:32,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1192301050, now seen corresponding path program 1 times [2024-10-15 14:32:32,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:32:32,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398793467] [2024-10-15 14:32:32,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:32:32,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:32:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:32,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:32:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:32,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:32:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:32,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:32:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:32,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:32:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:33,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 14:32:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:33,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:32:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:33,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:32:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:33,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:32:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:33,187 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-15 14:32:33,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:32:33,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398793467] [2024-10-15 14:32:33,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398793467] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:32:33,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091891974] [2024-10-15 14:32:33,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:32:33,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:32:33,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:32:33,189 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-10-15 14:32:33,190 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 14:32:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:33,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-15 14:32:33,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:32:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-15 14:32:33,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:32:33,832 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-15 14:32:33,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091891974] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-15 14:32:33,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:32:33,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16, 12] total 27 [2024-10-15 14:32:33,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704807191] [2024-10-15 14:32:33,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:32:33,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-15 14:32:33,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:32:33,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-15 14:32:33,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2024-10-15 14:32:33,834 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-15 14:32:33,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:32:33,973 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2024-10-15 14:32:33,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-15 14:32:33,973 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 49 [2024-10-15 14:32:33,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:32:33,975 INFO L225 Difference]: With dead ends: 101 [2024-10-15 14:32:33,975 INFO L226 Difference]: Without dead ends: 68 [2024-10-15 14:32:33,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2024-10-15 14:32:33,977 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 18 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:32:33,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 406 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:32:33,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-15 14:32:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2024-10-15 14:32:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 38 states have internal predecessors, (42), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-15 14:32:33,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2024-10-15 14:32:33,986 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 49 [2024-10-15 14:32:33,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:32:33,986 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2024-10-15 14:32:33,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-15 14:32:33,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:32:33,987 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2024-10-15 14:32:33,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-15 14:32:33,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:32:33,988 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:32:34,001 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-15 14:32:34,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:32:34,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:32:34,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:32:34,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1656998341, now seen corresponding path program 1 times [2024-10-15 14:32:34,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:32:34,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260509227] [2024-10-15 14:32:34,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:32:34,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:32:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:34,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:32:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:34,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:32:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:34,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:32:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:34,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:32:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:34,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 14:32:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:34,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:32:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:34,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:32:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:34,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:32:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 14:32:34,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:32:34,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260509227] [2024-10-15 14:32:34,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260509227] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:32:34,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933787241] [2024-10-15 14:32:34,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:32:34,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:32:34,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:32:34,306 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-10-15 14:32:34,307 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 14:32:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:34,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 14:32:34,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:32:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 14:32:34,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:32:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 14:32:34,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933787241] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:32:34,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:32:34,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2024-10-15 14:32:34,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404771391] [2024-10-15 14:32:34,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:32:34,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:32:34,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:32:34,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:32:34,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:32:34,431 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-15 14:32:34,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:32:34,605 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2024-10-15 14:32:34,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 14:32:34,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 51 [2024-10-15 14:32:34,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:32:34,606 INFO L225 Difference]: With dead ends: 94 [2024-10-15 14:32:34,606 INFO L226 Difference]: Without dead ends: 73 [2024-10-15 14:32:34,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-10-15 14:32:34,607 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 62 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:32:34,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 118 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:32:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-15 14:32:34,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2024-10-15 14:32:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-15 14:32:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2024-10-15 14:32:34,619 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 51 [2024-10-15 14:32:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:32:34,619 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2024-10-15 14:32:34,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-15 14:32:34,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:32:34,620 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2024-10-15 14:32:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-15 14:32:34,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:32:34,620 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-10-15 14:32:34,635 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-15 14:32:34,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:32:34,821 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:32:34,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:32:34,822 INFO L85 PathProgramCache]: Analyzing trace with hash 106146672, now seen corresponding path program 1 times [2024-10-15 14:32:34,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:32:34,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736507389] [2024-10-15 14:32:34,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:32:34,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:32:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:34,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:32:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:34,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:32:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:34,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:32:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:34,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:32:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:34,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 14:32:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:34,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:32:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:34,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:32:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:34,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:32:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:35,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-15 14:32:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 14:32:35,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:32:35,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736507389] [2024-10-15 14:32:35,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736507389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:32:35,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:32:35,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-15 14:32:35,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559496202] [2024-10-15 14:32:35,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:32:35,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-15 14:32:35,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:32:35,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-15 14:32:35,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-15 14:32:35,114 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-15 14:32:35,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:32:35,522 INFO L93 Difference]: Finished difference Result 107 states and 135 transitions. [2024-10-15 14:32:35,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-15 14:32:35,523 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 54 [2024-10-15 14:32:35,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:32:35,524 INFO L225 Difference]: With dead ends: 107 [2024-10-15 14:32:35,524 INFO L226 Difference]: Without dead ends: 93 [2024-10-15 14:32:35,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-10-15 14:32:35,525 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 86 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:32:35,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 204 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:32:35,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-15 14:32:35,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 76. [2024-10-15 14:32:35,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.1875) internal successors, (57), 51 states have internal predecessors, (57), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2024-10-15 14:32:35,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2024-10-15 14:32:35,535 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 54 [2024-10-15 14:32:35,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:32:35,535 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2024-10-15 14:32:35,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-15 14:32:35,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:32:35,536 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2024-10-15 14:32:35,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-15 14:32:35,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:32:35,536 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-10-15 14:32:35,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-15 14:32:35,537 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:32:35,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:32:35,537 INFO L85 PathProgramCache]: Analyzing trace with hash -265637807, now seen corresponding path program 2 times [2024-10-15 14:32:35,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:32:35,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877513093] [2024-10-15 14:32:35,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:32:35,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:32:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:35,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:32:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:35,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:32:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:35,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:32:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:35,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:32:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:36,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 14:32:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:36,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:32:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:36,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:32:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:36,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:32:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:32:36,865 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-15 14:32:36,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:32:36,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877513093] [2024-10-15 14:32:36,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877513093] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:32:36,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772057457] [2024-10-15 14:32:36,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:32:36,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:32:36,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:32:36,868 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-10-15 14:32:36,869 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 14:32:36,938 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:32:36,938 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:32:36,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-15 14:32:36,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:32:37,114 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-10-15 14:32:37,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 1 case distinctions, treesize of input 38 treesize of output 19 [2024-10-15 14:32:41,306 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_mkdup_~i~0_30 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int) (v_mkdup_~j~0_34 Int)) (and (let ((.cse0 (select |c_#memory_int#1| v_main_~a~0.base_BEFORE_CALL_1))) (= (select .cse0 (+ (* v_mkdup_~i~0_30 4) v_main_~a~0.offset_BEFORE_CALL_1)) (select .cse0 (+ (* v_mkdup_~j~0_34 4) v_main_~a~0.offset_BEFORE_CALL_1)))) (not (= v_mkdup_~i~0_30 v_mkdup_~j~0_34)) (<= 0 v_mkdup_~i~0_30) (<= 0 v_mkdup_~j~0_34))) is different from true [2024-10-15 14:32:41,895 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-15 14:32:41,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:32:42,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772057457] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:32:42,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:32:42,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 35 [2024-10-15 14:32:42,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077247199] [2024-10-15 14:32:42,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:32:42,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-15 14:32:42,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:32:42,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-15 14:32:42,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1106, Unknown=1, NotChecked=66, Total=1260 [2024-10-15 14:32:42,011 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand has 35 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 12 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-10-15 14:34:33,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:34:33,484 INFO L93 Difference]: Finished difference Result 167 states and 217 transitions. [2024-10-15 14:34:33,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-15 14:34:33,484 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 12 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Word has length 54 [2024-10-15 14:34:33,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:34:33,485 INFO L225 Difference]: With dead ends: 167 [2024-10-15 14:34:33,485 INFO L226 Difference]: Without dead ends: 111 [2024-10-15 14:34:33,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 114.3s TimeCoverageRelationStatistics Valid=389, Invalid=4009, Unknown=28, NotChecked=130, Total=4556 [2024-10-15 14:34:33,489 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 241 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 1888 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:34:33,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 562 Invalid, 2110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1888 Invalid, 0 Unknown, 152 Unchecked, 2.1s Time] [2024-10-15 14:34:33,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-15 14:34:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2024-10-15 14:34:33,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 55 states have internal predecessors, (62), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2024-10-15 14:34:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2024-10-15 14:34:33,506 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 54 [2024-10-15 14:34:33,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:34:33,506 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2024-10-15 14:34:33,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 12 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-10-15 14:34:33,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:34:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2024-10-15 14:34:33,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-15 14:34:33,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:34:33,507 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2024-10-15 14:34:33,521 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-15 14:34:33,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:34:33,708 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:34:33,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:34:33,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1209816935, now seen corresponding path program 1 times [2024-10-15 14:34:33,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:34:33,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534275734] [2024-10-15 14:34:33,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:34:33,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:34:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:33,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:34:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:33,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:34:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:33,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:34:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:33,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:34:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:33,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 14:34:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:33,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:34:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:33,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:34:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:33,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:34:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:33,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-15 14:34:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:33,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:34:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:33,928 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-15 14:34:33,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:34:33,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534275734] [2024-10-15 14:34:33,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534275734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:34:33,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:34:33,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-15 14:34:33,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504375504] [2024-10-15 14:34:33,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:34:33,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-15 14:34:33,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:34:33,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-15 14:34:33,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-15 14:34:33,930 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-15 14:34:34,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:34:34,300 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2024-10-15 14:34:34,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-15 14:34:34,300 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 61 [2024-10-15 14:34:34,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:34:34,301 INFO L225 Difference]: With dead ends: 100 [2024-10-15 14:34:34,301 INFO L226 Difference]: Without dead ends: 98 [2024-10-15 14:34:34,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-10-15 14:34:34,303 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 67 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:34:34,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 209 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:34:34,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-15 14:34:34,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2024-10-15 14:34:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 62 states have internal predecessors, (71), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-10-15 14:34:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2024-10-15 14:34:34,327 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 61 [2024-10-15 14:34:34,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:34:34,327 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2024-10-15 14:34:34,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-15 14:34:34,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:34:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2024-10-15 14:34:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-15 14:34:34,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:34:34,331 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2024-10-15 14:34:34,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-15 14:34:34,332 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:34:34,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:34:34,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1211663977, now seen corresponding path program 1 times [2024-10-15 14:34:34,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:34:34,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651467472] [2024-10-15 14:34:34,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:34:34,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:34:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:34,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:34:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:34,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:34:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:34,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:34:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:34,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:34:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:34,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 14:34:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:34,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:34:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:34,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:34:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:34,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:34:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:34,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-15 14:34:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:34,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:34:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-15 14:34:34,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:34:34,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651467472] [2024-10-15 14:34:34,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651467472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:34:34,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:34:34,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-15 14:34:34,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140567611] [2024-10-15 14:34:34,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:34:34,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-15 14:34:34,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:34:34,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-15 14:34:34,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:34:34,509 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-15 14:34:34,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:34:34,791 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2024-10-15 14:34:34,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 14:34:34,791 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 61 [2024-10-15 14:34:34,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:34:34,792 INFO L225 Difference]: With dead ends: 105 [2024-10-15 14:34:34,794 INFO L226 Difference]: Without dead ends: 94 [2024-10-15 14:34:34,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-15 14:34:34,795 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 65 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:34:34,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 140 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:34:34,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-15 14:34:34,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-10-15 14:34:34,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 62 states have internal predecessors, (70), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-10-15 14:34:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2024-10-15 14:34:34,814 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 61 [2024-10-15 14:34:34,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:34:34,815 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2024-10-15 14:34:34,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-15 14:34:34,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:34:34,815 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2024-10-15 14:34:34,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-15 14:34:34,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:34:34,818 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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] [2024-10-15 14:34:34,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-15 14:34:34,819 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:34:34,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:34:34,819 INFO L85 PathProgramCache]: Analyzing trace with hash -22267472, now seen corresponding path program 3 times [2024-10-15 14:34:34,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:34:34,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497405174] [2024-10-15 14:34:34,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:34:34,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:34:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:34,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:34:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:34,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:34:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:34,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:34:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:34,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:34:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:34,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 14:34:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:34,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:34:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:34,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:34:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:34,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:34:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-15 14:34:34,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:34:34,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497405174] [2024-10-15 14:34:34,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497405174] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:34:34,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733847668] [2024-10-15 14:34:34,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 14:34:34,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:34:34,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:34:34,919 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-10-15 14:34:34,919 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-15 14:34:34,992 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-15 14:34:34,992 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:34:34,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 14:34:34,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:34:35,029 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-15 14:34:35,029 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:34:35,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733847668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:34:35,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:34:35,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-15 14:34:35,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580634109] [2024-10-15 14:34:35,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:34:35,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:34:35,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:34:35,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:34:35,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-15 14:34:35,031 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-15 14:34:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:34:35,070 INFO L93 Difference]: Finished difference Result 140 states and 171 transitions. [2024-10-15 14:34:35,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:34:35,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 59 [2024-10-15 14:34:35,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:34:35,071 INFO L225 Difference]: With dead ends: 140 [2024-10-15 14:34:35,071 INFO L226 Difference]: Without dead ends: 92 [2024-10-15 14:34:35,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-15 14:34:35,072 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:34:35,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 204 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:34:35,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-15 14:34:35,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-10-15 14:34:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 63 states have internal predecessors, (70), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-10-15 14:34:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2024-10-15 14:34:35,090 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 59 [2024-10-15 14:34:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:34:35,091 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2024-10-15 14:34:35,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-15 14:34:35,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:34:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2024-10-15 14:34:35,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-15 14:34:35,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:34:35,092 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:34:35,104 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-15 14:34:35,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-15 14:34:35,293 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:34:35,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:34:35,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1976101370, now seen corresponding path program 1 times [2024-10-15 14:34:35,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:34:35,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526943048] [2024-10-15 14:34:35,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:34:35,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:34:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:35,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:34:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:35,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:34:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:35,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:34:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:35,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:34:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:35,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 14:34:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:35,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:34:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:35,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:34:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:35,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:34:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:35,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:34:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:35,622 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 14:34:35,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:34:35,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526943048] [2024-10-15 14:34:35,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526943048] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:34:35,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197211571] [2024-10-15 14:34:35,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:34:35,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:34:35,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:34:35,624 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-10-15 14:34:35,625 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-15 14:34:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:35,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-15 14:34:35,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:34:35,782 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-10-15 14:34:35,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 17 treesize of output 9 [2024-10-15 14:34:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-15 14:34:35,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:34:35,948 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 28 treesize of output 24 [2024-10-15 14:34:36,036 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-15 14:34:36,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197211571] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:34:36,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:34:36,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 23 [2024-10-15 14:34:36,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089537263] [2024-10-15 14:34:36,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:34:36,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-15 14:34:36,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:34:36,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-15 14:34:36,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2024-10-15 14:34:36,038 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-15 14:34:36,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:34:36,603 INFO L93 Difference]: Finished difference Result 129 states and 156 transitions. [2024-10-15 14:34:36,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-15 14:34:36,603 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 61 [2024-10-15 14:34:36,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:34:36,604 INFO L225 Difference]: With dead ends: 129 [2024-10-15 14:34:36,604 INFO L226 Difference]: Without dead ends: 106 [2024-10-15 14:34:36,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 128 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2024-10-15 14:34:36,605 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 87 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-15 14:34:36,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 269 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-15 14:34:36,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-15 14:34:36,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2024-10-15 14:34:36,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 65 states have internal predecessors, (74), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-10-15 14:34:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2024-10-15 14:34:36,621 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 61 [2024-10-15 14:34:36,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:34:36,621 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2024-10-15 14:34:36,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-15 14:34:36,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:34:36,622 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2024-10-15 14:34:36,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-15 14:34:36,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:34:36,622 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:34:36,635 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-15 14:34:36,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-15 14:34:36,823 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:34:36,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:34:36,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1977948412, now seen corresponding path program 1 times [2024-10-15 14:34:36,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:34:36,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217841589] [2024-10-15 14:34:36,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:34:36,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:34:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:36,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:34:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:36,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:34:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:36,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:34:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:36,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:34:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:36,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 14:34:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:36,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:34:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:36,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:34:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:36,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:34:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:37,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:34:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:37,024 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-15 14:34:37,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:34:37,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217841589] [2024-10-15 14:34:37,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217841589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:34:37,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:34:37,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-15 14:34:37,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796508219] [2024-10-15 14:34:37,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:34:37,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-15 14:34:37,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:34:37,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-15 14:34:37,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:34:37,026 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-15 14:34:37,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:34:37,284 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2024-10-15 14:34:37,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-15 14:34:37,284 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 61 [2024-10-15 14:34:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:34:37,285 INFO L225 Difference]: With dead ends: 122 [2024-10-15 14:34:37,285 INFO L226 Difference]: Without dead ends: 104 [2024-10-15 14:34:37,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-15 14:34:37,286 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 63 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:34:37,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 199 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:34:37,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-15 14:34:37,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2024-10-15 14:34:37,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 58 states have internal predecessors, (65), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2024-10-15 14:34:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2024-10-15 14:34:37,301 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 61 [2024-10-15 14:34:37,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:34:37,301 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2024-10-15 14:34:37,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-15 14:34:37,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:34:37,301 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2024-10-15 14:34:37,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-15 14:34:37,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:34:37,302 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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-10-15 14:34:37,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-15 14:34:37,302 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:34:37,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:34:37,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1604316891, now seen corresponding path program 4 times [2024-10-15 14:34:37,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:34:37,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023681382] [2024-10-15 14:34:37,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:34:37,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:34:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:37,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:34:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:37,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:34:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:37,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:34:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:37,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:34:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:37,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 14:34:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:37,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:34:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:37,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:34:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:37,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:34:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:39,656 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-15 14:34:39,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:34:39,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023681382] [2024-10-15 14:34:39,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023681382] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:34:39,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602388977] [2024-10-15 14:34:39,657 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 14:34:39,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:34:39,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:34:39,659 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-10-15 14:34:39,660 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-15 14:34:39,734 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 14:34:39,734 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:34:39,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-15 14:34:39,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:34:39,759 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 7 treesize of output 6 [2024-10-15 14:34:39,935 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_mkdup_~j~0_39 Int) (v_mkdup_~i~0_35 Int)) (and (<= (+ v_mkdup_~j~0_39 1) |c_mkdup_#in~n|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_mkdup_#in~a.base| (let ((.cse1 (+ (* v_mkdup_~j~0_39 4) |c_mkdup_#in~a.offset|))) (let ((.cse0 (select (select |c_#memory_int#1| |c_mkdup_#in~a.base|) .cse1))) (store (store (select |c_old(#memory_int#1)| |c_mkdup_#in~a.base|) (+ |c_mkdup_#in~a.offset| (* v_mkdup_~i~0_35 4)) .cse0) .cse1 .cse0))))) (<= 0 v_mkdup_~j~0_39))) is different from true [2024-10-15 14:34:39,945 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 37 treesize of output 32 [2024-10-15 14:34:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-15 14:34:40,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:34:41,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602388977] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:34:41,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:34:41,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 42 [2024-10-15 14:34:41,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455329001] [2024-10-15 14:34:41,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:34:41,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-15 14:34:41,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:34:41,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-15 14:34:41,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2614, Unknown=1, NotChecked=104, Total=2970 [2024-10-15 14:34:41,909 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 42 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 36 states have internal predecessors, (59), 10 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2024-10-15 14:34:55,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:34:55,432 INFO L93 Difference]: Finished difference Result 163 states and 198 transitions. [2024-10-15 14:34:55,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-10-15 14:34:55,433 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 36 states have internal predecessors, (59), 10 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) Word has length 61 [2024-10-15 14:34:55,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:34:55,434 INFO L225 Difference]: With dead ends: 163 [2024-10-15 14:34:55,434 INFO L226 Difference]: Without dead ends: 83 [2024-10-15 14:34:55,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3591 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=1822, Invalid=12461, Unknown=1, NotChecked=236, Total=14520 [2024-10-15 14:34:55,437 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 325 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 98 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-15 14:34:55,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 224 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1783 Invalid, 1 Unknown, 141 Unchecked, 1.6s Time] [2024-10-15 14:34:55,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-15 14:34:55,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2024-10-15 14:34:55,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 54 states have internal predecessors, (60), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-15 14:34:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2024-10-15 14:34:55,457 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 61 [2024-10-15 14:34:55,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:34:55,457 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2024-10-15 14:34:55,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 36 states have internal predecessors, (59), 10 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2024-10-15 14:34:55,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:34:55,461 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2024-10-15 14:34:55,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-15 14:34:55,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:34:55,462 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 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, 1, 1] [2024-10-15 14:34:55,479 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-15 14:34:55,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:34:55,662 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:34:55,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:34:55,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1375399225, now seen corresponding path program 1 times [2024-10-15 14:34:55,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:34:55,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893444640] [2024-10-15 14:34:55,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:34:55,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:34:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:55,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:34:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:55,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:34:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:55,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:34:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:55,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:34:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:55,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 14:34:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:55,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:34:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:55,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:34:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:55,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:34:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:55,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-15 14:34:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:55,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:34:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:55,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-15 14:34:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-15 14:34:55,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:34:55,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893444640] [2024-10-15 14:34:55,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893444640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:34:55,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:34:55,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-15 14:34:55,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086796538] [2024-10-15 14:34:55,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:34:55,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-15 14:34:55,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:34:55,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-15 14:34:55,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-15 14:34:55,901 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-15 14:34:56,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:34:56,186 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2024-10-15 14:34:56,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-15 14:34:56,186 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 67 [2024-10-15 14:34:56,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:34:56,187 INFO L225 Difference]: With dead ends: 97 [2024-10-15 14:34:56,187 INFO L226 Difference]: Without dead ends: 95 [2024-10-15 14:34:56,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-10-15 14:34:56,188 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 57 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:34:56,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 94 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:34:56,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-15 14:34:56,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-10-15 14:34:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 65 states have internal predecessors, (70), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2024-10-15 14:34:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2024-10-15 14:34:56,211 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 67 [2024-10-15 14:34:56,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:34:56,211 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2024-10-15 14:34:56,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-15 14:34:56,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:34:56,211 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2024-10-15 14:34:56,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-15 14:34:56,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:34:56,213 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 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, 1, 1] [2024-10-15 14:34:56,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-15 14:34:56,213 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:34:56,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:34:56,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2027329468, now seen corresponding path program 1 times [2024-10-15 14:34:56,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:34:56,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011858837] [2024-10-15 14:34:56,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:34:56,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:34:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:56,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:34:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:56,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:34:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:56,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:34:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:56,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:34:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:56,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 14:34:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:56,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:34:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:56,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:34:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:56,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:34:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:56,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-15 14:34:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:56,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-15 14:34:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:56,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-15 14:34:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-15 14:34:56,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:34:56,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011858837] [2024-10-15 14:34:56,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011858837] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:34:56,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469149525] [2024-10-15 14:34:56,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:34:56,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:34:56,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:34:56,459 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-10-15 14:34:56,460 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-15 14:34:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:34:56,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-15 14:34:56,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:34:56,595 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-10-15 14:34:56,599 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-10-15 14:35:08,868 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 21 treesize of output 13 [2024-10-15 14:35:08,870 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 17 treesize of output 9 [2024-10-15 14:35:08,903 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-15 14:35:08,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:35:09,029 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 52 treesize of output 48 [2024-10-15 14:35:09,034 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 82 treesize of output 74 [2024-10-15 14:35:09,126 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-15 14:35:09,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469149525] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-15 14:35:09,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:35:09,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 11] total 22 [2024-10-15 14:35:09,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625996230] [2024-10-15 14:35:09,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:35:09,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-15 14:35:09,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:35:09,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-15 14:35:09,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=399, Unknown=2, NotChecked=0, Total=462 [2024-10-15 14:35:09,127 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-15 14:35:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:35:13,313 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2024-10-15 14:35:13,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 14:35:13,314 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 69 [2024-10-15 14:35:13,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:35:13,314 INFO L225 Difference]: With dead ends: 100 [2024-10-15 14:35:13,314 INFO L226 Difference]: Without dead ends: 96 [2024-10-15 14:35:13,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 141 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=72, Invalid=477, Unknown=3, NotChecked=0, Total=552 [2024-10-15 14:35:13,315 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:35:13,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 346 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:35:13,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-15 14:35:13,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 80. [2024-10-15 14:35:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 states have internal predecessors, (61), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-15 14:35:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2024-10-15 14:35:13,334 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 69 [2024-10-15 14:35:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:35:13,334 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2024-10-15 14:35:13,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-15 14:35:13,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:35:13,335 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2024-10-15 14:35:13,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-15 14:35:13,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:35:13,335 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 14:35:13,347 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-15 14:35:13,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:35:13,536 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:35:13,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:35:13,536 INFO L85 PathProgramCache]: Analyzing trace with hash 219320101, now seen corresponding path program 1 times [2024-10-15 14:35:13,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:35:13,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390382236] [2024-10-15 14:35:13,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:35:13,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:35:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:13,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:35:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:13,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:35:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:13,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:35:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:13,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:35:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:13,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 14:35:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:13,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:35:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:13,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:35:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:13,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:35:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:14,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-15 14:35:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:14,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:35:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:14,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-15 14:35:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:14,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-15 14:35:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-15 14:35:14,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:35:14,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390382236] [2024-10-15 14:35:14,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390382236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:35:14,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:35:14,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-15 14:35:14,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811832509] [2024-10-15 14:35:14,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:35:14,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-15 14:35:14,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:35:14,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-15 14:35:14,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-15 14:35:14,037 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-15 14:35:14,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:35:14,472 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2024-10-15 14:35:14,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-15 14:35:14,472 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 73 [2024-10-15 14:35:14,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:35:14,473 INFO L225 Difference]: With dead ends: 101 [2024-10-15 14:35:14,473 INFO L226 Difference]: Without dead ends: 83 [2024-10-15 14:35:14,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2024-10-15 14:35:14,474 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 70 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:35:14,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 127 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:35:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-15 14:35:14,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2024-10-15 14:35:14,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-15 14:35:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2024-10-15 14:35:14,495 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 73 [2024-10-15 14:35:14,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:35:14,495 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-10-15 14:35:14,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-15 14:35:14,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:35:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2024-10-15 14:35:14,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-15 14:35:14,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:35:14,496 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1] [2024-10-15 14:35:14,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-15 14:35:14,496 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:35:14,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:35:14,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1185292379, now seen corresponding path program 1 times [2024-10-15 14:35:14,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:35:14,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351863017] [2024-10-15 14:35:14,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:35:14,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:35:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:14,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:35:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:14,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:35:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:14,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:35:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:14,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:35:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:14,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 14:35:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:14,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:35:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:14,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:35:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:14,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:35:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:14,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:35:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:14,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-15 14:35:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:14,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-15 14:35:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:14,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-15 14:35:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-15 14:35:14,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:35:14,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351863017] [2024-10-15 14:35:14,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351863017] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:35:14,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520853045] [2024-10-15 14:35:14,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:35:14,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:35:14,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:35:14,953 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-10-15 14:35:14,954 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-15 14:35:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:35:15,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-10-15 14:35:15,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:35:15,061 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 7 treesize of output 6 [2024-10-15 14:35:15,293 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_mkdup_~j~0_52 Int) (v_mkdup_~i~0_46 Int)) (and (<= (+ v_mkdup_~j~0_52 1) |c_mkdup_#in~n|) (<= 0 v_mkdup_~i~0_46) (<= (+ v_mkdup_~i~0_46 1) |c_mkdup_#in~n|) (<= 0 v_mkdup_~j~0_52) (= (store |c_old(#memory_int#1)| |c_mkdup_#in~a.base| (let ((.cse1 (+ (* v_mkdup_~j~0_52 4) |c_mkdup_#in~a.offset|))) (let ((.cse0 (select (select |c_#memory_int#1| |c_mkdup_#in~a.base|) .cse1))) (store (store (select |c_old(#memory_int#1)| |c_mkdup_#in~a.base|) (+ |c_mkdup_#in~a.offset| (* v_mkdup_~i~0_46 4)) .cse0) .cse1 .cse0)))) |c_#memory_int#1|) (not (= v_mkdup_~i~0_46 v_mkdup_~j~0_52)))) is different from true [2024-10-15 14:35:15,300 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 37 treesize of output 32 [2024-10-15 14:35:16,341 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-10-15 14:35:16,352 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-10-15 14:35:18,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 14:35:18,297 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 94 treesize of output 78 [2024-10-15 14:35:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-15 14:35:18,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:35:18,750 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 84 treesize of output 80 [2024-10-15 14:35:18,752 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 138 treesize of output 130 [2024-10-15 14:35:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-15 14:35:21,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520853045] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:35:21,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:35:21,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 32, 17] total 52 [2024-10-15 14:35:21,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552681819] [2024-10-15 14:35:21,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:35:21,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-15 14:35:21,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:35:21,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-15 14:35:21,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2294, Unknown=1, NotChecked=98, Total=2652 [2024-10-15 14:35:21,824 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 52 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 13 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) [2024-10-15 14:35:26,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:35:26,605 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2024-10-15 14:35:26,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-15 14:35:26,605 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 13 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) Word has length 80 [2024-10-15 14:35:26,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:35:26,606 INFO L225 Difference]: With dead ends: 116 [2024-10-15 14:35:26,606 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 14:35:26,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 134 SyntacticMatches, 9 SemanticMatches, 92 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2433 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=794, Invalid=7763, Unknown=3, NotChecked=182, Total=8742 [2024-10-15 14:35:26,608 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 113 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 69 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 1638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-15 14:35:26,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 232 Invalid, 1638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1471 Invalid, 2 Unknown, 96 Unchecked, 1.9s Time] [2024-10-15 14:35:26,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 14:35:26,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 14:35:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 14:35:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 14:35:26,609 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2024-10-15 14:35:26,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:35:26,609 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 14:35:26,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 13 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) [2024-10-15 14:35:26,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:35:26,609 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 14:35:26,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 14:35:26,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 14:35:26,624 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-15 14:35:26,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-15 14:35:26,818 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:35:26,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 14:35:41,048 WARN L286 SmtUtils]: Spent 9.78s on a formula simplification. DAG size of input: 139 DAG size of output: 21 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-10-15 14:36:01,827 WARN L286 SmtUtils]: Spent 20.78s on a formula simplification. DAG size of input: 141 DAG size of output: 21 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-10-15 14:36:24,752 WARN L286 SmtUtils]: Spent 14.50s on a formula simplification. DAG size of input: 228 DAG size of output: 117 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-10-15 14:36:35,487 WARN L286 SmtUtils]: Spent 10.42s on a formula simplification. DAG size of input: 141 DAG size of output: 87 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-10-15 14:36:49,301 WARN L286 SmtUtils]: Spent 13.81s on a formula simplification. DAG size of input: 190 DAG size of output: 111 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter)