./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 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/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 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-12 22:58:13,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 22:58:13,784 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 22:58:13,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 22:58:13,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 22:58:13,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 22:58:13,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 22:58:13,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 22:58:13,825 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 22:58:13,825 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 22:58:13,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 22:58:13,826 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 22:58:13,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 22:58:13,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 22:58:13,827 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 22:58:13,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 22:58:13,828 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 22:58:13,828 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 22:58:13,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 22:58:13,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 22:58:13,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 22:58:13,830 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 22:58:13,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 22:58:13,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 22:58:13,831 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 22:58:13,832 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 22:58:13,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 22:58:13,832 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 22:58:13,832 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 22:58:13,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 22:58:13,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 22:58:13,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 22:58:13,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 22:58:13,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 22:58:13,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 22:58:13,835 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 22:58:13,835 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 22:58:13,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 22:58:13,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 22:58:13,836 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 22:58:13,836 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 22:58:13,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 22:58:13,837 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 [2024-09-12 22:58:14,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 22:58:14,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 22:58:14,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 22:58:14,165 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 22:58:14,166 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 22:58:14,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/duplets.c [2024-09-12 22:58:15,615 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 22:58:15,799 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 22:58:15,800 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/duplets.c [2024-09-12 22:58:15,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/5ca47d5b9/b34a5de89f0442549e1f397f6ba64883/FLAG9f47ccdd4 [2024-09-12 22:58:16,183 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/5ca47d5b9/b34a5de89f0442549e1f397f6ba64883 [2024-09-12 22:58:16,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 22:58:16,187 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 22:58:16,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 22:58:16,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 22:58:16,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 22:58:16,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8d4950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16, skipping insertion in model container [2024-09-12 22:58:16,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 22:58:16,400 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/duplets.c[485,498] [2024-09-12 22:58:16,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 22:58:16,437 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 22:58:16,449 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/duplets.c[485,498] [2024-09-12 22:58:16,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 22:58:16,494 INFO L204 MainTranslator]: Completed translation [2024-09-12 22:58:16,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16 WrapperNode [2024-09-12 22:58:16,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 22:58:16,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 22:58:16,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 22:58:16,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 22:58:16,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,528 INFO L138 Inliner]: procedures = 21, calls = 43, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 22:58:16,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 22:58:16,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 22:58:16,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 22:58:16,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 22:58:16,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,556 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,579 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 5, 5, 7]. 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, 1, 1, 3]. [2024-09-12 22:58:16,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 22:58:16,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 22:58:16,611 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 22:58:16,611 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 22:58:16,612 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 22:58:16,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 22:58:16,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 22:58:16,653 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 22:58:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 22:58:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2024-09-12 22:58:16,699 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2024-09-12 22:58:16,699 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 22:58:16,699 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 22:58:16,699 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 22:58:16,699 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 22:58:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 22:58:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-12 22:58:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-12 22:58:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-12 22:58:16,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-12 22:58:16,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-12 22:58:16,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-12 22:58:16,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-12 22:58:16,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-12 22:58:16,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 22:58:16,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 22:58:16,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-12 22:58:16,703 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2024-09-12 22:58:16,703 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2024-09-12 22:58:16,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 22:58:16,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 22:58:16,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-12 22:58:16,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-12 22:58:16,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-12 22:58:16,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-12 22:58:16,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-12 22:58:16,706 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-12 22:58:16,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 22:58:16,706 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 22:58:16,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-12 22:58:16,793 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 22:58:16,795 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 22:58:17,044 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-09-12 22:58:17,044 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 22:58:17,080 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 22:58:17,082 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-12 22:58:17,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 10:58:17 BoogieIcfgContainer [2024-09-12 22:58:17,082 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 22:58:17,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 22:58:17,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 22:58:17,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 22:58:17,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 10:58:16" (1/3) ... [2024-09-12 22:58:17,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3decc6d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 10:58:17, skipping insertion in model container [2024-09-12 22:58:17,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (2/3) ... [2024-09-12 22:58:17,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3decc6d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 10:58:17, skipping insertion in model container [2024-09-12 22:58:17,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 10:58:17" (3/3) ... [2024-09-12 22:58:17,092 INFO L112 eAbstractionObserver]: Analyzing ICFG duplets.c [2024-09-12 22:58:17,109 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 22:58:17,110 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 22:58:17,159 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 22:58:17,165 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2bdc1eb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 22:58:17,166 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 22:58:17,172 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-09-12 22:58:17,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-12 22:58:17,182 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:58:17,183 INFO L216 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-09-12 22:58:17,184 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:58:17,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:17,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1311007902, now seen corresponding path program 1 times [2024-09-12 22:58:17,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:58:17,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062621123] [2024-09-12 22:58:17,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:58:17,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:58:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:17,418 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:58:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:17,434 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 22:58:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:17,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:58:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:17,473 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 22:58:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:17,505 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 22:58:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:17,518 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 22:58:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:17,525 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:58:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:17,553 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 22:58:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-12 22:58:17,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:58:17,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062621123] [2024-09-12 22:58:17,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062621123] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 22:58:17,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 22:58:17,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 22:58:17,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263332481] [2024-09-12 22:58:17,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 22:58:17,593 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 22:58:17,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:58:17,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 22:58:17,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 22:58:17,641 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-09-12 22:58:17,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:58:17,906 INFO L93 Difference]: Finished difference Result 118 states and 170 transitions. [2024-09-12 22:58:17,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 22:58:17,909 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-09-12 22:58:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:58:17,919 INFO L225 Difference]: With dead ends: 118 [2024-09-12 22:58:17,919 INFO L226 Difference]: Without dead ends: 64 [2024-09-12 22:58:17,925 INFO L433 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-09-12 22:58:17,929 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 58 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-09-12 22:58:17,930 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 32 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 22:58:17,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-12 22:58:17,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2024-09-12 22:58:17,965 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-09-12 22:58:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2024-09-12 22:58:17,968 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 46 [2024-09-12 22:58:17,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:58:17,970 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2024-09-12 22:58:17,970 INFO L475 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-09-12 22:58:17,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:17,971 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2024-09-12 22:58:17,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-12 22:58:17,973 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:58:17,973 INFO L216 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-09-12 22:58:17,973 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 22:58:17,973 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:58:17,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:17,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1692327078, now seen corresponding path program 1 times [2024-09-12 22:58:17,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:58:17,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14704487] [2024-09-12 22:58:17,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:58:17,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:58:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:18,320 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:58:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:18,324 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 22:58:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:18,331 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:58:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:18,336 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 22:58:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:18,451 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 22:58:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:18,486 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 22:58:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:18,493 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:58:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:18,509 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 22:58:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:18,556 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-12 22:58:18,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:58:18,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14704487] [2024-09-12 22:58:18,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14704487] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 22:58:18,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009222296] [2024-09-12 22:58:18,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:58:18,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:58:18,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 22:58:18,560 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 22:58:18,561 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 22:58:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:18,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-12 22:58:18,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:58:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-12 22:58:18,791 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 22:58:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-12 22:58:19,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009222296] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 22:58:19,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 22:58:19,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 17 [2024-09-12 22:58:19,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405069988] [2024-09-12 22:58:19,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 22:58:19,106 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-12 22:58:19,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:58:19,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-12 22:58:19,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-09-12 22:58:19,111 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-09-12 22:58:19,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:58:19,743 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2024-09-12 22:58:19,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-12 22:58:19,745 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-09-12 22:58:19,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:58:19,747 INFO L225 Difference]: With dead ends: 99 [2024-09-12 22:58:19,747 INFO L226 Difference]: Without dead ends: 78 [2024-09-12 22:58:19,748 INFO L433 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-09-12 22:58:19,751 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 94 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-09-12 22:58:19,752 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 396 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 22:58:19,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-09-12 22:58:19,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 51. [2024-09-12 22:58:19,769 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-09-12 22:58:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2024-09-12 22:58:19,770 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 46 [2024-09-12 22:58:19,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:58:19,771 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2024-09-12 22:58:19,771 INFO L475 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-09-12 22:58:19,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2024-09-12 22:58:19,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-12 22:58:19,773 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:58:19,773 INFO L216 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-09-12 22:58:19,791 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 22:58:19,977 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:58:19,978 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:58:19,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:19,979 INFO L85 PathProgramCache]: Analyzing trace with hash -762329273, now seen corresponding path program 1 times [2024-09-12 22:58:19,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:58:19,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047471272] [2024-09-12 22:58:19,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:58:19,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:58:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:20,100 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:58:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:20,102 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 22:58:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:20,117 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:58:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:20,120 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 22:58:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:20,130 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 22:58:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:20,133 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 22:58:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:20,135 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:58:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:20,149 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 22:58:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-12 22:58:20,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:58:20,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047471272] [2024-09-12 22:58:20,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047471272] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 22:58:20,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 22:58:20,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-12 22:58:20,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978156729] [2024-09-12 22:58:20,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 22:58:20,178 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 22:58:20,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:58:20,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 22:58:20,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-12 22:58:20,179 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-09-12 22:58:20,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:58:20,475 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2024-09-12 22:58:20,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 22:58:20,476 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-09-12 22:58:20,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:58:20,477 INFO L225 Difference]: With dead ends: 71 [2024-09-12 22:58:20,477 INFO L226 Difference]: Without dead ends: 69 [2024-09-12 22:58:20,478 INFO L433 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-09-12 22:58:20,479 INFO L434 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-09-12 22:58:20,479 INFO L435 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-09-12 22:58:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-12 22:58:20,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2024-09-12 22:58:20,489 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-09-12 22:58:20,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2024-09-12 22:58:20,491 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 47 [2024-09-12 22:58:20,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:58:20,491 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2024-09-12 22:58:20,491 INFO L475 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-09-12 22:58:20,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:20,492 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2024-09-12 22:58:20,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-12 22:58:20,493 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:58:20,493 INFO L216 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-09-12 22:58:20,494 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 22:58:20,494 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:58:20,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:20,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1192301050, now seen corresponding path program 1 times [2024-09-12 22:58:20,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:58:20,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345608094] [2024-09-12 22:58:20,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:58:20,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:58:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:20,802 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:58:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:20,806 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 22:58:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:20,811 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:58:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:20,816 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 22:58:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:21,046 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 22:58:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:21,080 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 22:58:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:21,116 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:58:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:21,152 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 22:58:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-12 22:58:21,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:58:21,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345608094] [2024-09-12 22:58:21,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345608094] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 22:58:21,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998175398] [2024-09-12 22:58:21,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:58:21,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:58:21,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 22:58:21,245 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 22:58:21,246 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 22:58:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:21,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-12 22:58:21,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:58:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-12 22:58:21,546 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 22:58:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-12 22:58:22,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998175398] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-12 22:58:22,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-12 22:58:22,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16, 12] total 27 [2024-09-12 22:58:22,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238572292] [2024-09-12 22:58:22,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 22:58:22,049 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 22:58:22,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:58:22,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 22:58:22,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2024-09-12 22:58:22,051 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-09-12 22:58:22,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:58:22,235 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2024-09-12 22:58:22,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 22:58:22,236 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-09-12 22:58:22,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:58:22,238 INFO L225 Difference]: With dead ends: 101 [2024-09-12 22:58:22,238 INFO L226 Difference]: Without dead ends: 68 [2024-09-12 22:58:22,239 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2024-09-12 22:58:22,240 INFO L434 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-09-12 22:58:22,240 INFO L435 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-09-12 22:58:22,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-12 22:58:22,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2024-09-12 22:58:22,250 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-09-12 22:58:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2024-09-12 22:58:22,252 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 49 [2024-09-12 22:58:22,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:58:22,253 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2024-09-12 22:58:22,253 INFO L475 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-09-12 22:58:22,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:22,253 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2024-09-12 22:58:22,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-09-12 22:58:22,254 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:58:22,254 INFO L216 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-09-12 22:58:22,274 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-12 22:58:22,454 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:58:22,455 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:58:22,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:22,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1656998341, now seen corresponding path program 1 times [2024-09-12 22:58:22,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:58:22,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108581176] [2024-09-12 22:58:22,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:58:22,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:58:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:22,513 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:58:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:22,515 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 22:58:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:22,519 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:58:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:22,522 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 22:58:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:22,528 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 22:58:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:22,531 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 22:58:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:22,532 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:58:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:22,540 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 22:58:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-12 22:58:22,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:58:22,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108581176] [2024-09-12 22:58:22,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108581176] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 22:58:22,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733904258] [2024-09-12 22:58:22,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:58:22,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:58:22,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 22:58:22,573 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 22:58:22,575 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 22:58:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:22,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 22:58:22,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:58:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-12 22:58:22,679 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 22:58:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-12 22:58:22,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733904258] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 22:58:22,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 22:58:22,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2024-09-12 22:58:22,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250978093] [2024-09-12 22:58:22,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 22:58:22,747 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 22:58:22,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:58:22,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 22:58:22,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 22:58:22,748 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-09-12 22:58:22,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:58:22,967 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2024-09-12 22:58:22,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 22:58:22,969 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-09-12 22:58:22,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:58:22,970 INFO L225 Difference]: With dead ends: 94 [2024-09-12 22:58:22,970 INFO L226 Difference]: Without dead ends: 73 [2024-09-12 22:58:22,971 INFO L433 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-09-12 22:58:22,974 INFO L434 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-09-12 22:58:22,974 INFO L435 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-09-12 22:58:22,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-12 22:58:22,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2024-09-12 22:58:22,992 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-09-12 22:58:22,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2024-09-12 22:58:22,993 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 51 [2024-09-12 22:58:22,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:58:22,995 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2024-09-12 22:58:22,995 INFO L475 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-09-12 22:58:22,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:22,996 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2024-09-12 22:58:22,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-12 22:58:22,998 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:58:22,998 INFO L216 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-09-12 22:58:23,014 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 22:58:23,202 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:58:23,203 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:58:23,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:23,203 INFO L85 PathProgramCache]: Analyzing trace with hash 106146672, now seen corresponding path program 1 times [2024-09-12 22:58:23,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:58:23,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595548214] [2024-09-12 22:58:23,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:58:23,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:58:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:23,399 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:58:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:23,403 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 22:58:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:23,410 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:58:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:23,413 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 22:58:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:23,420 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 22:58:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:23,421 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 22:58:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:23,423 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:58:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:23,433 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 22:58:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:23,561 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-12 22:58:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:23,564 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-12 22:58:23,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:58:23,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595548214] [2024-09-12 22:58:23,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595548214] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 22:58:23,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 22:58:23,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-09-12 22:58:23,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298669774] [2024-09-12 22:58:23,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 22:58:23,565 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-12 22:58:23,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:58:23,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-12 22:58:23,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-09-12 22:58:23,566 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-09-12 22:58:24,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:58:24,071 INFO L93 Difference]: Finished difference Result 107 states and 135 transitions. [2024-09-12 22:58:24,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-12 22:58:24,071 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-09-12 22:58:24,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:58:24,072 INFO L225 Difference]: With dead ends: 107 [2024-09-12 22:58:24,073 INFO L226 Difference]: Without dead ends: 93 [2024-09-12 22:58:24,073 INFO L433 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-09-12 22:58:24,074 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 86 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-09-12 22:58:24,074 INFO L435 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-09-12 22:58:24,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-12 22:58:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 76. [2024-09-12 22:58:24,096 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-09-12 22:58:24,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2024-09-12 22:58:24,097 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 54 [2024-09-12 22:58:24,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:58:24,103 INFO L474 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2024-09-12 22:58:24,103 INFO L475 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-09-12 22:58:24,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:24,103 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2024-09-12 22:58:24,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-12 22:58:24,104 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:58:24,104 INFO L216 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-09-12 22:58:24,104 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 22:58:24,104 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:58:24,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:24,105 INFO L85 PathProgramCache]: Analyzing trace with hash -265637807, now seen corresponding path program 2 times [2024-09-12 22:58:24,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:58:24,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069835896] [2024-09-12 22:58:24,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:58:24,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:58:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:24,585 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:58:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:24,587 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 22:58:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:24,594 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:58:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:24,597 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 22:58:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:25,352 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 22:58:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:25,407 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 22:58:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:25,449 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:58:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:25,501 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 22:58:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-12 22:58:25,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:58:25,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069835896] [2024-09-12 22:58:25,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069835896] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 22:58:25,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102006210] [2024-09-12 22:58:25,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 22:58:25,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:58:25,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 22:58:25,796 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 22:58:25,797 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 22:58:25,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 22:58:25,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 22:58:25,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-09-12 22:58:25,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:58:26,121 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-09-12 22:58:26,122 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-09-12 22:58:32,002 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_mkdup_~i~0_30 Int) (v_mkdup_~j~0_34 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (and (let ((.cse0 (select |c_#memory_int#3| v_main_~a~0.base_BEFORE_CALL_1))) (= (select .cse0 (+ (* v_mkdup_~j~0_34 4) v_main_~a~0.offset_BEFORE_CALL_1)) (select .cse0 (+ (* v_mkdup_~i~0_30 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-09-12 22:58:52,761 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-12 22:58:52,762 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 22:58:52,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102006210] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 22:58:52,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 22:58:52,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 34 [2024-09-12 22:58:52,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394091498] [2024-09-12 22:58:52,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 22:58:52,902 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-09-12 22:58:52,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:58:52,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-09-12 22:58:52,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1036, Unknown=6, NotChecked=64, Total=1190 [2024-09-12 22:58:52,904 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand has 34 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-09-12 22:59:00,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 22:59:02,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:59:02,352 INFO L93 Difference]: Finished difference Result 152 states and 195 transitions. [2024-09-12 22:59:02,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-12 22:59:02,353 INFO L78 Accepts]: Start accepts. Automaton has has 34 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-09-12 22:59:02,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:59:02,354 INFO L225 Difference]: With dead ends: 152 [2024-09-12 22:59:02,356 INFO L226 Difference]: Without dead ends: 111 [2024-09-12 22:59:02,357 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=360, Invalid=3412, Unknown=14, NotChecked=120, Total=3906 [2024-09-12 22:59:02,360 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 212 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 65 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-09-12 22:59:02,360 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 605 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1615 Invalid, 2 Unknown, 134 Unchecked, 5.8s Time] [2024-09-12 22:59:02,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-09-12 22:59:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2024-09-12 22:59:02,390 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-09-12 22:59:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2024-09-12 22:59:02,391 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 54 [2024-09-12 22:59:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:59:02,393 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2024-09-12 22:59:02,393 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 34 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-09-12 22:59:02,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:59:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2024-09-12 22:59:02,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-12 22:59:02,398 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:59:02,398 INFO L216 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-09-12 22:59:02,415 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-12 22:59:02,599 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:59:02,599 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:59:02,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:59:02,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1209816935, now seen corresponding path program 1 times [2024-09-12 22:59:02,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:59:02,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753860614] [2024-09-12 22:59:02,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:59:02,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:59:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:02,784 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:59:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:02,786 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 22:59:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:02,792 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:59:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:02,795 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 22:59:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:02,799 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 22:59:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:02,802 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 22:59:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:02,804 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:59:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:02,814 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 22:59:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:02,892 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-12 22:59:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:02,894 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-12 22:59:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:02,897 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-12 22:59:02,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:59:02,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753860614] [2024-09-12 22:59:02,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753860614] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 22:59:02,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 22:59:02,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-12 22:59:02,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958129963] [2024-09-12 22:59:02,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 22:59:02,899 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 22:59:02,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:59:02,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 22:59:02,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-09-12 22:59:02,900 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-09-12 22:59:03,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:59:03,362 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2024-09-12 22:59:03,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 22:59:03,362 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-09-12 22:59:03,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:59:03,363 INFO L225 Difference]: With dead ends: 100 [2024-09-12 22:59:03,363 INFO L226 Difference]: Without dead ends: 98 [2024-09-12 22:59:03,364 INFO L433 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-09-12 22:59:03,364 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 67 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-09-12 22:59:03,364 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 209 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 22:59:03,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-09-12 22:59:03,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2024-09-12 22:59:03,385 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-09-12 22:59:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2024-09-12 22:59:03,386 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 61 [2024-09-12 22:59:03,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:59:03,386 INFO L474 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2024-09-12 22:59:03,386 INFO L475 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-09-12 22:59:03,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:59:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2024-09-12 22:59:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-12 22:59:03,387 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:59:03,387 INFO L216 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-09-12 22:59:03,388 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 22:59:03,388 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:59:03,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:59:03,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1211663977, now seen corresponding path program 1 times [2024-09-12 22:59:03,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:59:03,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523263513] [2024-09-12 22:59:03,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:59:03,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:59:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:03,513 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:59:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:03,515 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 22:59:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:03,521 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:59:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:03,523 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 22:59:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:03,527 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 22:59:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:03,529 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 22:59:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:03,531 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:59:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:03,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 22:59:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:03,599 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-12 22:59:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:03,601 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-12 22:59:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:03,604 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-12 22:59:03,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:59:03,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523263513] [2024-09-12 22:59:03,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523263513] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 22:59:03,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 22:59:03,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-12 22:59:03,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231776067] [2024-09-12 22:59:03,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 22:59:03,605 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 22:59:03,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:59:03,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 22:59:03,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-12 22:59:03,606 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-09-12 22:59:03,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:59:03,942 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2024-09-12 22:59:03,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 22:59:03,942 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-09-12 22:59:03,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:59:03,943 INFO L225 Difference]: With dead ends: 105 [2024-09-12 22:59:03,944 INFO L226 Difference]: Without dead ends: 94 [2024-09-12 22:59:03,944 INFO L433 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-09-12 22:59:03,945 INFO L434 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.3s IncrementalHoareTripleChecker+Time [2024-09-12 22:59:03,945 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 140 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 22:59:03,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-09-12 22:59:03,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-09-12 22:59:03,965 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-09-12 22:59:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2024-09-12 22:59:03,966 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 61 [2024-09-12 22:59:03,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:59:03,967 INFO L474 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2024-09-12 22:59:03,967 INFO L475 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-09-12 22:59:03,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:59:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2024-09-12 22:59:03,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-12 22:59:03,968 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:59:03,968 INFO L216 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-09-12 22:59:03,968 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-12 22:59:03,969 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:59:03,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:59:03,969 INFO L85 PathProgramCache]: Analyzing trace with hash -22267472, now seen corresponding path program 3 times [2024-09-12 22:59:03,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:59:03,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039817286] [2024-09-12 22:59:03,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:59:03,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:59:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:04,009 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:59:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:04,011 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 22:59:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:04,022 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:59:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:04,024 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 22:59:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:04,029 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 22:59:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:04,030 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 22:59:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:04,032 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:59:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:04,037 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 22:59:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-12 22:59:04,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:59:04,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039817286] [2024-09-12 22:59:04,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039817286] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 22:59:04,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625428278] [2024-09-12 22:59:04,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 22:59:04,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:59:04,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 22:59:04,088 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 22:59:04,089 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 22:59:04,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-12 22:59:04,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 22:59:04,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 22:59:04,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:59:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-09-12 22:59:04,213 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 22:59:04,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625428278] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 22:59:04,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 22:59:04,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-09-12 22:59:04,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914351682] [2024-09-12 22:59:04,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 22:59:04,214 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 22:59:04,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:59:04,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 22:59:04,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-09-12 22:59:04,215 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-09-12 22:59:04,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:59:04,278 INFO L93 Difference]: Finished difference Result 140 states and 171 transitions. [2024-09-12 22:59:04,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 22:59:04,278 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-09-12 22:59:04,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:59:04,280 INFO L225 Difference]: With dead ends: 140 [2024-09-12 22:59:04,280 INFO L226 Difference]: Without dead ends: 92 [2024-09-12 22:59:04,281 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-09-12 22:59:04,281 INFO L434 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-09-12 22:59:04,281 INFO L435 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-09-12 22:59:04,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-09-12 22:59:04,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-09-12 22:59:04,302 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-09-12 22:59:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2024-09-12 22:59:04,303 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 59 [2024-09-12 22:59:04,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:59:04,304 INFO L474 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2024-09-12 22:59:04,304 INFO L475 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-09-12 22:59:04,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:59:04,305 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2024-09-12 22:59:04,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-12 22:59:04,305 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:59:04,305 INFO L216 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-09-12 22:59:04,321 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-12 22:59:04,506 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-12 22:59:04,506 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:59:04,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:59:04,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1976101370, now seen corresponding path program 1 times [2024-09-12 22:59:04,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:59:04,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553003412] [2024-09-12 22:59:04,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:59:04,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:59:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:04,714 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:59:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:04,716 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 22:59:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:04,723 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:59:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:04,726 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 22:59:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:04,730 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 22:59:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:04,735 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 22:59:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:04,736 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:59:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:04,764 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 22:59:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:04,946 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-12 22:59:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-12 22:59:04,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:59:04,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553003412] [2024-09-12 22:59:04,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553003412] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 22:59:04,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389259004] [2024-09-12 22:59:04,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:59:04,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:59:04,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 22:59:04,951 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 22:59:04,956 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-12 22:59:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:05,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-12 22:59:05,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:59:05,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-12 22:59:05,204 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-09-12 22:59:05,239 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-12 22:59:05,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 22:59:05,388 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-09-12 22:59:05,516 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-12 22:59:05,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389259004] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 22:59:05,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 22:59:05,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 23 [2024-09-12 22:59:05,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863631465] [2024-09-12 22:59:05,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 22:59:05,520 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-12 22:59:05,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:59:05,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-12 22:59:05,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2024-09-12 22:59:05,521 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-09-12 22:59:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:59:06,220 INFO L93 Difference]: Finished difference Result 129 states and 156 transitions. [2024-09-12 22:59:06,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-12 22:59:06,221 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-09-12 22:59:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:59:06,222 INFO L225 Difference]: With dead ends: 129 [2024-09-12 22:59:06,222 INFO L226 Difference]: Without dead ends: 106 [2024-09-12 22:59:06,223 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 128 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2024-09-12 22:59:06,223 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 87 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 22:59:06,223 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 269 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 22:59:06,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-09-12 22:59:06,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2024-09-12 22:59:06,254 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-09-12 22:59:06,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2024-09-12 22:59:06,255 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 61 [2024-09-12 22:59:06,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:59:06,255 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2024-09-12 22:59:06,255 INFO L475 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-09-12 22:59:06,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:59:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2024-09-12 22:59:06,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-12 22:59:06,256 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:59:06,256 INFO L216 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-09-12 22:59:06,272 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-12 22:59:06,460 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-12 22:59:06,461 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:59:06,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:59:06,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1977948412, now seen corresponding path program 1 times [2024-09-12 22:59:06,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:59:06,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343152487] [2024-09-12 22:59:06,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:59:06,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:59:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:06,573 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:59:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:06,576 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 22:59:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:06,582 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:59:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:06,584 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 22:59:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:06,589 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 22:59:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:06,592 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 22:59:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:06,594 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:59:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:06,602 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 22:59:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:06,670 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-12 22:59:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-12 22:59:06,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:59:06,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343152487] [2024-09-12 22:59:06,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343152487] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 22:59:06,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 22:59:06,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-12 22:59:06,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580417790] [2024-09-12 22:59:06,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 22:59:06,674 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 22:59:06,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:59:06,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 22:59:06,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-09-12 22:59:06,675 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-09-12 22:59:07,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:59:07,063 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2024-09-12 22:59:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 22:59:07,063 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-09-12 22:59:07,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:59:07,065 INFO L225 Difference]: With dead ends: 122 [2024-09-12 22:59:07,065 INFO L226 Difference]: Without dead ends: 104 [2024-09-12 22:59:07,065 INFO L433 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-09-12 22:59:07,065 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 63 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-09-12 22:59:07,066 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 199 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 22:59:07,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-09-12 22:59:07,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2024-09-12 22:59:07,090 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-09-12 22:59:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2024-09-12 22:59:07,091 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 61 [2024-09-12 22:59:07,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:59:07,092 INFO L474 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2024-09-12 22:59:07,092 INFO L475 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-09-12 22:59:07,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:59:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2024-09-12 22:59:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-12 22:59:07,093 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:59:07,093 INFO L216 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-09-12 22:59:07,093 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-12 22:59:07,093 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:59:07,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:59:07,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1604316891, now seen corresponding path program 4 times [2024-09-12 22:59:07,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:59:07,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886128570] [2024-09-12 22:59:07,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:59:07,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:59:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:07,779 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:59:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:07,781 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 22:59:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:07,801 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:59:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:07,813 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 22:59:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:07,968 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 22:59:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:07,971 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 22:59:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:07,975 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:59:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:07,989 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 22:59:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:59:10,389 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-12 22:59:10,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:59:10,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886128570] [2024-09-12 22:59:10,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886128570] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 22:59:10,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778064333] [2024-09-12 22:59:10,390 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 22:59:10,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:59:10,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 22:59:10,392 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 22:59:10,393 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-12 22:59:10,488 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 22:59:10,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 22:59:10,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-09-12 22:59:10,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:59:10,523 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-09-12 22:59:10,611 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_mkdup_~a.offset_22 Int) (v_mkdup_~j~0_39 Int) (v_mkdup_~i~0_35 Int)) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_mkdup_#in~a.base| (let ((.cse1 (+ (* v_mkdup_~j~0_39 4) v_mkdup_~a.offset_22))) (let ((.cse0 (select (select |c_#memory_int#3| |c_mkdup_#in~a.base|) .cse1))) (store (store (select |c_old(#memory_int#3)| |c_mkdup_#in~a.base|) (+ v_mkdup_~a.offset_22 (* v_mkdup_~i~0_35 4)) .cse0) .cse1 .cse0)))))) is different from true [2024-09-12 22:59:10,625 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 45 treesize of output 40 [2024-09-12 22:59:18,506 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-09-12 22:59:18,506 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 22:59:19,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778064333] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 22:59:19,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 22:59:19,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 37 [2024-09-12 22:59:19,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485397203] [2024-09-12 22:59:19,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 22:59:19,606 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-09-12 22:59:19,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:59:19,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-09-12 22:59:19,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2036, Unknown=2, NotChecked=92, Total=2352 [2024-09-12 22:59:19,607 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 37 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 32 states have internal predecessors, (55), 8 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2024-09-12 22:59:24,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 22:59:28,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 22:59:32,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 22:59:37,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 22:59:41,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 23:03:45,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 23:03:45,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:03:45,581 INFO L93 Difference]: Finished difference Result 130 states and 153 transitions. [2024-09-12 23:03:45,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-09-12 23:03:45,582 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 32 states have internal predecessors, (55), 8 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 61 [2024-09-12 23:03:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:03:45,584 INFO L225 Difference]: With dead ends: 130 [2024-09-12 23:03:45,584 INFO L226 Difference]: Without dead ends: 68 [2024-09-12 23:03:45,586 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1708 ImplicationChecksByTransitivity, 248.4s TimeCoverageRelationStatistics Valid=1109, Invalid=6343, Unknown=34, NotChecked=170, Total=7656 [2024-09-12 23:03:45,587 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 170 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 64 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 26.5s IncrementalHoareTripleChecker+Time [2024-09-12 23:03:45,587 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 223 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1271 Invalid, 5 Unknown, 98 Unchecked, 26.5s Time] [2024-09-12 23:03:45,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-12 23:03:45,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-09-12 23:03:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 44 states have internal predecessors, (47), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-12 23:03:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2024-09-12 23:03:45,606 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 61 [2024-09-12 23:03:45,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:03:45,607 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2024-09-12 23:03:45,607 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 32 states have internal predecessors, (55), 8 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2024-09-12 23:03:45,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:03:45,607 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2024-09-12 23:03:45,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-09-12 23:03:45,608 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:03:45,608 INFO L216 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-09-12 23:03:45,622 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-12 23:03:45,809 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:03:45,809 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:03:45,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:03:45,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1375399225, now seen corresponding path program 1 times [2024-09-12 23:03:45,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:03:45,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364798074] [2024-09-12 23:03:45,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:03:45,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:03:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:46,081 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:03:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:46,083 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 23:03:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:46,117 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 23:03:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:46,121 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 23:03:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:46,124 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 23:03:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:46,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 23:03:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:46,127 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 23:03:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:46,171 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 23:03:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:46,463 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-12 23:03:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:46,466 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-12 23:03:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:46,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-12 23:03:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:46,474 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-12 23:03:46,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:03:46,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364798074] [2024-09-12 23:03:46,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364798074] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 23:03:46,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 23:03:46,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-12 23:03:46,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888262212] [2024-09-12 23:03:46,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 23:03:46,478 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 23:03:46,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:03:46,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 23:03:46,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-09-12 23:03:46,479 INFO L87 Difference]: Start difference. First operand 67 states and 73 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-09-12 23:03:47,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:03:47,594 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2024-09-12 23:03:47,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 23:03:47,595 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-09-12 23:03:47,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:03:47,596 INFO L225 Difference]: With dead ends: 73 [2024-09-12 23:03:47,596 INFO L226 Difference]: Without dead ends: 69 [2024-09-12 23:03:47,596 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-09-12 23:03:47,597 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 49 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-12 23:03:47,597 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 93 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-12 23:03:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-12 23:03:47,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-09-12 23:03:47,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 14 states have call successors, (14), 11 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-12 23:03:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2024-09-12 23:03:47,616 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 67 [2024-09-12 23:03:47,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:03:47,616 INFO L474 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2024-09-12 23:03:47,617 INFO L475 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-09-12 23:03:47,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:03:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2024-09-12 23:03:47,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-09-12 23:03:47,618 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:03:47,618 INFO L216 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-09-12 23:03:47,618 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-12 23:03:47,618 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:03:47,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:03:47,618 INFO L85 PathProgramCache]: Analyzing trace with hash 219320101, now seen corresponding path program 1 times [2024-09-12 23:03:47,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:03:47,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625212820] [2024-09-12 23:03:47,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:03:47,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:03:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:48,330 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:03:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:48,332 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 23:03:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:48,362 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 23:03:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:48,365 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 23:03:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:48,371 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 23:03:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:48,372 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 23:03:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:48,373 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 23:03:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:48,418 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 23:03:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:48,863 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-12 23:03:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:48,866 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-12 23:03:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:48,869 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-12 23:03:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:48,871 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-12 23:03:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-09-12 23:03:48,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:03:48,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625212820] [2024-09-12 23:03:48,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625212820] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 23:03:48,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 23:03:48,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-09-12 23:03:48,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580644471] [2024-09-12 23:03:48,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 23:03:48,879 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-12 23:03:48,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:03:48,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-12 23:03:48,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-09-12 23:03:48,880 INFO L87 Difference]: Start difference. First operand 69 states and 74 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-09-12 23:03:50,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:03:50,527 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2024-09-12 23:03:50,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-12 23:03:50,528 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-09-12 23:03:50,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:03:50,529 INFO L225 Difference]: With dead ends: 87 [2024-09-12 23:03:50,529 INFO L226 Difference]: Without dead ends: 69 [2024-09-12 23:03:50,529 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2024-09-12 23:03:50,529 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 64 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-09-12 23:03:50,530 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 122 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-09-12 23:03:50,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-12 23:03:50,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-09-12 23:03:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 14 states have call successors, (14), 11 states have call predecessors, (14), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-12 23:03:50,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-09-12 23:03:50,547 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 73 [2024-09-12 23:03:50,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:03:50,548 INFO L474 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-09-12 23:03:50,548 INFO L475 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-09-12 23:03:50,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:03:50,548 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-09-12 23:03:50,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-09-12 23:03:50,549 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:03:50,549 INFO L216 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-09-12 23:03:50,549 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-12 23:03:50,549 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:03:50,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:03:50,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1185292379, now seen corresponding path program 1 times [2024-09-12 23:03:50,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:03:50,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39383210] [2024-09-12 23:03:50,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:03:50,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:03:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:51,080 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:03:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:51,081 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 23:03:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:51,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 23:03:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:51,130 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 23:03:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:51,138 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 23:03:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:51,140 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 23:03:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:51,141 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 23:03:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:51,195 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 23:03:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:51,569 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-12 23:03:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:51,572 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-12 23:03:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:51,575 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-12 23:03:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:51,578 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-12 23:03:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-09-12 23:03:51,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:03:51,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39383210] [2024-09-12 23:03:51,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39383210] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 23:03:51,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874163190] [2024-09-12 23:03:51,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:03:51,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:03:51,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:03:51,584 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 23:03:51,585 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-12 23:03:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:03:51,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-09-12 23:03:51,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:03:51,715 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-09-12 23:03:52,487 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_mkdup_~i~0_43 Int) (v_mkdup_~j~0_47 Int)) (and (<= 0 v_mkdup_~j~0_47) (<= (+ v_mkdup_~j~0_47 1) |c_mkdup_#in~n|) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_mkdup_#in~a.base| (let ((.cse1 (+ |c_mkdup_#in~a.offset| (* v_mkdup_~j~0_47 4)))) (let ((.cse0 (select (select |c_#memory_int#3| |c_mkdup_#in~a.base|) .cse1))) (store (store (select |c_old(#memory_int#3)| |c_mkdup_#in~a.base|) (+ (* v_mkdup_~i~0_43 4) |c_mkdup_#in~a.offset|) .cse0) .cse1 .cse0))))) (<= 0 v_mkdup_~i~0_43) (<= (+ v_mkdup_~i~0_43 1) |c_mkdup_#in~n|))) is different from true [2024-09-12 23:03:52,498 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 45 treesize of output 40 [2024-09-12 23:03:55,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-12 23:03:55,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-12 23:04:22,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 23:04:22,255 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 185 treesize of output 163 [2024-09-12 23:04:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-09-12 23:04:22,699 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:04:24,224 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 115 treesize of output 107 [2024-09-12 23:04:24,232 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-09-12 23:04:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-09-12 23:04:35,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874163190] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:04:35,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 23:04:35,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 32, 20] total 56 [2024-09-12 23:04:35,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010207069] [2024-09-12 23:04:35,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 23:04:35,189 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-09-12 23:04:35,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:04:35,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-09-12 23:04:35,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=2703, Unknown=2, NotChecked=106, Total=3080 [2024-09-12 23:04:35,191 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 56 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 15 states have call successors, (31), 7 states have call predecessors, (31), 10 states have return successors, (29), 12 states have call predecessors, (29), 14 states have call successors, (29) [2024-09-12 23:04:42,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 23:04:46,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 23:05:03,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 23:05:10,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-12 23:05:11,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:05:11,831 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2024-09-12 23:05:11,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-09-12 23:05:11,831 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 15 states have call successors, (31), 7 states have call predecessors, (31), 10 states have return successors, (29), 12 states have call predecessors, (29), 14 states have call successors, (29) Word has length 80 [2024-09-12 23:05:11,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:05:11,832 INFO L225 Difference]: With dead ends: 112 [2024-09-12 23:05:11,832 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 23:05:11,835 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 128 SyntacticMatches, 11 SemanticMatches, 101 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2646 ImplicationChecksByTransitivity, 45.6s TimeCoverageRelationStatistics Valid=878, Invalid=9423, Unknown=5, NotChecked=200, Total=10506 [2024-09-12 23:05:11,835 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 108 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 61 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 2028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 23.7s IncrementalHoareTripleChecker+Time [2024-09-12 23:05:11,836 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 252 Invalid, 2028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1863 Invalid, 8 Unknown, 96 Unchecked, 23.7s Time] [2024-09-12 23:05:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 23:05:11,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 23:05:11,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-12 23:05:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 23:05:11,837 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2024-09-12 23:05:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:05:11,837 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 23:05:11,837 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 15 states have call successors, (31), 7 states have call predecessors, (31), 10 states have return successors, (29), 12 states have call predecessors, (29), 14 states have call successors, (29) [2024-09-12 23:05:11,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:05:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 23:05:11,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 23:05:11,841 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 23:05:11,854 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-12 23:05:12,042 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:05:12,045 INFO L408 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:05:12,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 23:06:41,729 WARN L293 SmtUtils]: Spent 1.41m on a formula simplification. DAG size of input: 121 DAG size of output: 4 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-12 23:08:04,731 WARN L293 SmtUtils]: Spent 1.38m on a formula simplification. DAG size of input: 123 DAG size of output: 4 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-12 23:08:41,035 WARN L293 SmtUtils]: Spent 25.42s on a formula simplification. DAG size of input: 80 DAG size of output: 42 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-12 23:09:19,307 WARN L293 SmtUtils]: Spent 33.73s on a formula simplification. DAG size of input: 187 DAG size of output: 116 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-12 23:09:59,819 WARN L293 SmtUtils]: Spent 39.72s on a formula simplification. DAG size of input: 113 DAG size of output: 84 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-12 23:10:50,540 WARN L293 SmtUtils]: Spent 50.72s on a formula simplification. DAG size of input: 162 DAG size of output: 136 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-12 23:12:10,500 WARN L293 SmtUtils]: Spent 1.33m on a formula simplification. DAG size of input: 140 DAG size of output: 67 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) Killed by 15