./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/duplets.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f1d7dc9d 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 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 12:16:56,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 12:16:56,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 12:16:56,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 12:16:56,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 12:16:56,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 12:16:56,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 12:16:56,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 12:16:56,652 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 12:16:56,652 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 12:16:56,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 12:16:56,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 12:16:56,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 12:16:56,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 12:16:56,657 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 12:16:56,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 12:16:56,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 12:16:56,658 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 12:16:56,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 12:16:56,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 12:16:56,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 12:16:56,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 12:16:56,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 12:16:56,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 12:16:56,664 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 12:16:56,664 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 12:16:56,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 12:16:56,665 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 12:16:56,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 12:16:56,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 12:16:56,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 12:16:56,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 12:16:56,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:16:56,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 12:16:56,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 12:16:56,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 12:16:56,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 12:16:56,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 12:16:56,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 12:16:56,669 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 12:16:56,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 12:16:56,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 12:16:56,669 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-20 12:16:56,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 12:16:56,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 12:16:56,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 12:16:56,955 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 12:16:56,955 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 12:16:56,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/duplets.c [2024-09-20 12:16:58,397 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 12:16:58,576 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 12:16:58,576 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/duplets.c [2024-09-20 12:16:58,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/5a80c43c2/d66aac1d7e41407f9a3f0428b0dce61a/FLAG57cf59893 [2024-09-20 12:16:58,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/5a80c43c2/d66aac1d7e41407f9a3f0428b0dce61a [2024-09-20 12:16:58,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 12:16:58,973 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 12:16:58,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 12:16:58,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 12:16:58,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 12:16:58,981 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:16:58" (1/1) ... [2024-09-20 12:16:58,982 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32dd05f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:16:58, skipping insertion in model container [2024-09-20 12:16:58,982 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:16:58" (1/1) ... [2024-09-20 12:16:59,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 12:16:59,166 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/duplets.c[485,498] [2024-09-20 12:16:59,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:16:59,201 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 12:16:59,212 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/duplets.c[485,498] [2024-09-20 12:16:59,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:16:59,246 INFO L204 MainTranslator]: Completed translation [2024-09-20 12:16:59,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:16:59 WrapperNode [2024-09-20 12:16:59,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 12:16:59,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 12:16:59,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 12:16:59,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 12:16:59,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:16:59" (1/1) ... [2024-09-20 12:16:59,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:16:59" (1/1) ... [2024-09-20 12:16:59,271 INFO L138 Inliner]: procedures = 21, calls = 43, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 12:16:59,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 12:16:59,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 12:16:59,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 12:16:59,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 12:16:59,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:16:59" (1/1) ... [2024-09-20 12:16:59,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:16:59" (1/1) ... [2024-09-20 12:16:59,285 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:16:59" (1/1) ... [2024-09-20 12:16:59,313 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 7, 5, 5]. 37 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 5 writes are split as follows [0, 3, 1, 1]. [2024-09-20 12:16:59,313 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:16:59" (1/1) ... [2024-09-20 12:16:59,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:16:59" (1/1) ... [2024-09-20 12:16:59,321 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:16:59" (1/1) ... [2024-09-20 12:16:59,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:16:59" (1/1) ... [2024-09-20 12:16:59,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:16:59" (1/1) ... [2024-09-20 12:16:59,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:16:59" (1/1) ... [2024-09-20 12:16:59,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 12:16:59,332 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 12:16:59,332 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 12:16:59,332 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 12:16:59,333 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:16:59" (1/1) ... [2024-09-20 12:16:59,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:16:59,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:16:59,373 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-20 12:16:59,379 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-20 12:16:59,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 12:16:59,416 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2024-09-20 12:16:59,416 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2024-09-20 12:16:59,417 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 12:16:59,417 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 12:16:59,417 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 12:16:59,417 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 12:16:59,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 12:16:59,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-20 12:16:59,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-20 12:16:59,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-20 12:16:59,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-20 12:16:59,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-20 12:16:59,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-20 12:16:59,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-20 12:16:59,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-20 12:16:59,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 12:16:59,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 12:16:59,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-20 12:16:59,419 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2024-09-20 12:16:59,419 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2024-09-20 12:16:59,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 12:16:59,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 12:16:59,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-20 12:16:59,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-20 12:16:59,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-20 12:16:59,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-20 12:16:59,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-20 12:16:59,421 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-20 12:16:59,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 12:16:59,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 12:16:59,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-20 12:16:59,512 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 12:16:59,514 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 12:16:59,737 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-09-20 12:16:59,737 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 12:16:59,766 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 12:16:59,766 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-20 12:16:59,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:16:59 BoogieIcfgContainer [2024-09-20 12:16:59,767 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 12:16:59,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 12:16:59,770 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 12:16:59,773 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 12:16:59,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:16:58" (1/3) ... [2024-09-20 12:16:59,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343f65f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:16:59, skipping insertion in model container [2024-09-20 12:16:59,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:16:59" (2/3) ... [2024-09-20 12:16:59,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343f65f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:16:59, skipping insertion in model container [2024-09-20 12:16:59,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:16:59" (3/3) ... [2024-09-20 12:16:59,779 INFO L112 eAbstractionObserver]: Analyzing ICFG duplets.c [2024-09-20 12:16:59,796 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 12:16:59,797 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 12:16:59,853 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 12:16:59,861 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;@388fcb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 12:16:59,862 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 12:16:59,866 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-20 12:16:59,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-20 12:16:59,875 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:16:59,875 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-20 12:16:59,876 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:16:59,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:16:59,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1311007902, now seen corresponding path program 1 times [2024-09-20 12:16:59,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:16:59,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487180500] [2024-09-20 12:16:59,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:16:59,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:17:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:00,086 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:17:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:00,101 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:17:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:00,115 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:17:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:00,123 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:17:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:00,145 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 12:17:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:00,152 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 12:17:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:00,164 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:17:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:00,193 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 12:17:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:00,212 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-20 12:17:00,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:17:00,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487180500] [2024-09-20 12:17:00,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487180500] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:17:00,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:17:00,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-20 12:17:00,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146876617] [2024-09-20 12:17:00,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:17:00,222 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 12:17:00,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:17:00,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 12:17:00,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-20 12:17:00,250 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-20 12:17:00,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:17:00,525 INFO L93 Difference]: Finished difference Result 118 states and 170 transitions. [2024-09-20 12:17:00,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 12:17:00,528 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-20 12:17:00,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:17:00,536 INFO L225 Difference]: With dead ends: 118 [2024-09-20 12:17:00,536 INFO L226 Difference]: Without dead ends: 64 [2024-09-20 12:17:00,540 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-20 12:17:00,543 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 58 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 12:17:00,543 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-20 12:17:00,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-20 12:17:00,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2024-09-20 12:17:00,591 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-20 12:17:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2024-09-20 12:17:00,597 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 46 [2024-09-20 12:17:00,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:17:00,600 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2024-09-20 12:17:00,600 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-20 12:17:00,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:00,601 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2024-09-20 12:17:00,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-20 12:17:00,604 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:17:00,605 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-20 12:17:00,605 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 12:17:00,606 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:17:00,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:00,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1692327078, now seen corresponding path program 1 times [2024-09-20 12:17:00,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:17:00,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302255797] [2024-09-20 12:17:00,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:17:00,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:17:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:00,976 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:17:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:00,982 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:17:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:00,996 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:17:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:01,001 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:17:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:01,125 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 12:17:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:01,172 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 12:17:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:01,182 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:17:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:01,202 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 12:17:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:01,260 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-20 12:17:01,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:17:01,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302255797] [2024-09-20 12:17:01,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302255797] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:17:01,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618124433] [2024-09-20 12:17:01,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:17:01,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:17:01,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:17:01,264 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-20 12:17:01,266 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-20 12:17:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:01,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-20 12:17:01,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:17:01,491 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-20 12:17:01,491 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:17:01,777 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-20 12:17:01,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618124433] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:17:01,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:17:01,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 17 [2024-09-20 12:17:01,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030596645] [2024-09-20 12:17:01,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:17:01,780 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-20 12:17:01,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:17:01,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-20 12:17:01,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-09-20 12:17:01,782 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-20 12:17:02,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:17:02,456 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2024-09-20 12:17:02,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-20 12:17:02,457 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-20 12:17:02,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:17:02,459 INFO L225 Difference]: With dead ends: 99 [2024-09-20 12:17:02,461 INFO L226 Difference]: Without dead ends: 78 [2024-09-20 12:17:02,462 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2024-09-20 12:17:02,464 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.5s IncrementalHoareTripleChecker+Time [2024-09-20 12:17:02,465 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.5s Time] [2024-09-20 12:17:02,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-09-20 12:17:02,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 51. [2024-09-20 12:17:02,479 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-20 12:17:02,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2024-09-20 12:17:02,482 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 46 [2024-09-20 12:17:02,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:17:02,483 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2024-09-20 12:17:02,483 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-20 12:17:02,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:02,486 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2024-09-20 12:17:02,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-20 12:17:02,487 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:17:02,487 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-20 12:17:02,503 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 12:17:02,687 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-20 12:17:02,688 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:17:02,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:02,689 INFO L85 PathProgramCache]: Analyzing trace with hash -762329273, now seen corresponding path program 1 times [2024-09-20 12:17:02,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:17:02,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965017399] [2024-09-20 12:17:02,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:17:02,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:17:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:02,779 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:17:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:02,782 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:17:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:02,790 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:17:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:02,793 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:17:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:02,801 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 12:17:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:02,804 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 12:17:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:02,808 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:17:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:02,823 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 12:17:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:02,851 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-20 12:17:02,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:17:02,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965017399] [2024-09-20 12:17:02,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965017399] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:17:02,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:17:02,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-20 12:17:02,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173530473] [2024-09-20 12:17:02,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:17:02,854 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-20 12:17:02,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:17:02,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-20 12:17:02,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-20 12:17:02,856 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-20 12:17:03,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:17:03,155 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2024-09-20 12:17:03,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-20 12:17:03,156 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-20 12:17:03,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:17:03,158 INFO L225 Difference]: With dead ends: 71 [2024-09-20 12:17:03,159 INFO L226 Difference]: Without dead ends: 69 [2024-09-20 12:17:03,159 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-20 12:17:03,161 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-20 12:17:03,161 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-20 12:17:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-20 12:17:03,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2024-09-20 12:17:03,177 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-20 12:17:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2024-09-20 12:17:03,180 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 47 [2024-09-20 12:17:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:17:03,180 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2024-09-20 12:17:03,181 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-20 12:17:03,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2024-09-20 12:17:03,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-20 12:17:03,184 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:17:03,184 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-20 12:17:03,184 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 12:17:03,185 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:17:03,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:03,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1192301050, now seen corresponding path program 1 times [2024-09-20 12:17:03,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:17:03,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365390494] [2024-09-20 12:17:03,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:17:03,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:17:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:03,425 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:17:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:03,427 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:17:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:03,432 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:17:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:03,435 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:17:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:03,633 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 12:17:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:03,685 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 12:17:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:03,714 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:17:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:03,743 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 12:17:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:03,834 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-20 12:17:03,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:17:03,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365390494] [2024-09-20 12:17:03,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365390494] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:17:03,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522184735] [2024-09-20 12:17:03,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:17:03,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:17:03,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:17:03,842 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-20 12:17:03,844 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-20 12:17:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:03,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-20 12:17:03,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:17:04,133 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-20 12:17:04,133 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:17:04,663 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-20 12:17:04,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522184735] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-20 12:17:04,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-20 12:17:04,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16, 12] total 27 [2024-09-20 12:17:04,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678768791] [2024-09-20 12:17:04,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:17:04,665 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-20 12:17:04,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:17:04,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-20 12:17:04,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2024-09-20 12:17:04,666 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-20 12:17:04,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:17:04,840 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2024-09-20 12:17:04,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-20 12:17:04,841 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-20 12:17:04,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:17:04,843 INFO L225 Difference]: With dead ends: 101 [2024-09-20 12:17:04,843 INFO L226 Difference]: Without dead ends: 68 [2024-09-20 12:17:04,844 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2024-09-20 12:17:04,845 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-20 12:17:04,845 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-20 12:17:04,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-20 12:17:04,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2024-09-20 12:17:04,856 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-20 12:17:04,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2024-09-20 12:17:04,857 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 49 [2024-09-20 12:17:04,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:17:04,858 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2024-09-20 12:17:04,859 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-20 12:17:04,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:04,859 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2024-09-20 12:17:04,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-09-20 12:17:04,860 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:17:04,861 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-20 12:17:04,879 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-20 12:17:05,061 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-20 12:17:05,062 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:17:05,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:05,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1656998341, now seen corresponding path program 1 times [2024-09-20 12:17:05,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:17:05,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196421445] [2024-09-20 12:17:05,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:17:05,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:17:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:05,123 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:17:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:05,128 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:17:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:05,133 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:17:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:05,136 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:17:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:05,142 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 12:17:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:05,144 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 12:17:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:05,146 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:17:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:05,154 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 12:17:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:05,186 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-20 12:17:05,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:17:05,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196421445] [2024-09-20 12:17:05,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196421445] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:17:05,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483867061] [2024-09-20 12:17:05,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:17:05,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:17:05,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:17:05,189 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-20 12:17:05,192 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-20 12:17:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:05,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-20 12:17:05,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:17:05,298 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-20 12:17:05,299 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:17:05,356 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-20 12:17:05,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483867061] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:17:05,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:17:05,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2024-09-20 12:17:05,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876040363] [2024-09-20 12:17:05,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:17:05,358 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 12:17:05,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:17:05,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 12:17:05,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-20 12:17:05,361 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-20 12:17:05,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:17:05,578 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2024-09-20 12:17:05,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-20 12:17:05,578 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-20 12:17:05,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:17:05,580 INFO L225 Difference]: With dead ends: 94 [2024-09-20 12:17:05,580 INFO L226 Difference]: Without dead ends: 73 [2024-09-20 12:17:05,580 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-20 12:17:05,581 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-20 12:17:05,582 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-20 12:17:05,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-20 12:17:05,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2024-09-20 12:17:05,600 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-20 12:17:05,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2024-09-20 12:17:05,601 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 51 [2024-09-20 12:17:05,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:17:05,603 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2024-09-20 12:17:05,603 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-20 12:17:05,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:05,604 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2024-09-20 12:17:05,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-20 12:17:05,606 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:17:05,606 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-20 12:17:05,624 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-20 12:17:05,806 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-20 12:17:05,807 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:17:05,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:05,807 INFO L85 PathProgramCache]: Analyzing trace with hash 106146672, now seen corresponding path program 1 times [2024-09-20 12:17:05,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:17:05,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464914219] [2024-09-20 12:17:05,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:17:05,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:17:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:06,030 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:17:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:06,032 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:17:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:06,043 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:17:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:06,046 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:17:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:06,053 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 12:17:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:06,055 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 12:17:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:06,057 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:17:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:06,071 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 12:17:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:06,190 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-20 12:17:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:06,195 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-20 12:17:06,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:17:06,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464914219] [2024-09-20 12:17:06,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464914219] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:17:06,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:17:06,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-09-20 12:17:06,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121031808] [2024-09-20 12:17:06,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:17:06,196 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-20 12:17:06,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:17:06,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-20 12:17:06,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-09-20 12:17:06,197 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-20 12:17:06,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:17:06,732 INFO L93 Difference]: Finished difference Result 107 states and 135 transitions. [2024-09-20 12:17:06,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-20 12:17:06,733 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-20 12:17:06,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:17:06,734 INFO L225 Difference]: With dead ends: 107 [2024-09-20 12:17:06,736 INFO L226 Difference]: Without dead ends: 93 [2024-09-20 12:17:06,737 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-20 12:17:06,738 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.4s IncrementalHoareTripleChecker+Time [2024-09-20 12:17:06,738 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.4s Time] [2024-09-20 12:17:06,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-20 12:17:06,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 76. [2024-09-20 12:17:06,756 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-20 12:17:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2024-09-20 12:17:06,757 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 54 [2024-09-20 12:17:06,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:17:06,757 INFO L474 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2024-09-20 12:17:06,758 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-20 12:17:06,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:06,758 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2024-09-20 12:17:06,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-20 12:17:06,759 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:17:06,759 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-20 12:17:06,759 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-20 12:17:06,760 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:17:06,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:06,760 INFO L85 PathProgramCache]: Analyzing trace with hash -265637807, now seen corresponding path program 2 times [2024-09-20 12:17:06,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:17:06,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496125773] [2024-09-20 12:17:06,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:17:06,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:17:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:07,398 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:17:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:07,401 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:17:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:07,408 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:17:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:07,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:17:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:08,170 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 12:17:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:08,226 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 12:17:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:08,266 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:17:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:08,321 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 12:17:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:08,607 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-20 12:17:08,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:17:08,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496125773] [2024-09-20 12:17:08,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496125773] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:17:08,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195306407] [2024-09-20 12:17:08,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 12:17:08,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:17:08,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:17:08,611 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-20 12:17:08,612 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-20 12:17:08,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 12:17:08,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 12:17:08,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-09-20 12:17:08,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:17:08,966 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-09-20 12:17:08,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 19 [2024-09-20 12:17:13,202 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_mkdup_~i~0_30 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int) (v_mkdup_~j~0_34 Int)) (and (let ((.cse0 (select |c_#memory_int#1| v_main_~a~0.base_BEFORE_CALL_1))) (= (select .cse0 (+ (* v_mkdup_~i~0_30 4) v_main_~a~0.offset_BEFORE_CALL_1)) (select .cse0 (+ (* v_mkdup_~j~0_34 4) v_main_~a~0.offset_BEFORE_CALL_1)))) (not (= v_mkdup_~i~0_30 v_mkdup_~j~0_34)) (<= 0 v_mkdup_~i~0_30) (<= 0 v_mkdup_~j~0_34))) is different from true [2024-09-20 12:17:14,014 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-20 12:17:14,015 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:17:14,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195306407] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:17:14,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 12:17:14,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 35 [2024-09-20 12:17:14,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501466751] [2024-09-20 12:17:14,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 12:17:14,278 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-09-20 12:17:14,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:17:14,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-09-20 12:17:14,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1106, Unknown=1, NotChecked=66, Total=1260 [2024-09-20 12:17:14,281 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand has 35 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 12 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-20 12:19:25,324 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-20 12:19:25,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:19:25,429 INFO L93 Difference]: Finished difference Result 167 states and 217 transitions. [2024-09-20 12:19:25,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-09-20 12:19:25,430 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 12 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Word has length 54 [2024-09-20 12:19:25,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:19:25,431 INFO L225 Difference]: With dead ends: 167 [2024-09-20 12:19:25,432 INFO L226 Difference]: Without dead ends: 111 [2024-09-20 12:19:25,433 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 130.9s TimeCoverageRelationStatistics Valid=385, Invalid=4009, Unknown=32, NotChecked=130, Total=4556 [2024-09-20 12:19:25,434 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 241 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 70 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-09-20 12:19:25,434 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 562 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1996 Invalid, 1 Unknown, 152 Unchecked, 5.5s Time] [2024-09-20 12:19:25,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-09-20 12:19:25,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2024-09-20 12:19:25,458 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-20 12:19:25,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2024-09-20 12:19:25,459 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 54 [2024-09-20 12:19:25,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:19:25,459 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2024-09-20 12:19:25,459 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 12 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-20 12:19:25,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:19:25,460 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2024-09-20 12:19:25,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-20 12:19:25,461 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:19:25,461 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-20 12:19:25,479 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-20 12:19:25,665 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-20 12:19:25,666 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:19:25,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:19:25,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1209816935, now seen corresponding path program 1 times [2024-09-20 12:19:25,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:19:25,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902224346] [2024-09-20 12:19:25,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:19:25,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:19:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:25,845 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:19:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:25,848 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:19:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:25,855 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:19:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:25,858 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:19:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:25,862 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 12:19:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:25,865 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 12:19:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:25,866 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:19:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:25,876 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 12:19:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:25,960 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-20 12:19:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:25,964 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-20 12:19:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:25,966 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-20 12:19:25,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:19:25,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902224346] [2024-09-20 12:19:25,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902224346] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:19:25,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:19:25,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-20 12:19:25,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365059989] [2024-09-20 12:19:25,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:19:25,968 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-20 12:19:25,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:19:25,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-20 12:19:25,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-09-20 12:19:25,969 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-20 12:19:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:19:26,425 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2024-09-20 12:19:26,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-20 12:19:26,426 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-20 12:19:26,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:19:26,427 INFO L225 Difference]: With dead ends: 100 [2024-09-20 12:19:26,427 INFO L226 Difference]: Without dead ends: 98 [2024-09-20 12:19:26,428 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-20 12:19:26,428 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.3s IncrementalHoareTripleChecker+Time [2024-09-20 12:19:26,428 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.3s Time] [2024-09-20 12:19:26,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-09-20 12:19:26,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2024-09-20 12:19:26,455 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-20 12:19:26,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2024-09-20 12:19:26,456 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 61 [2024-09-20 12:19:26,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:19:26,457 INFO L474 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2024-09-20 12:19:26,457 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-20 12:19:26,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:19:26,457 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2024-09-20 12:19:26,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-20 12:19:26,459 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:19:26,459 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-20 12:19:26,460 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-20 12:19:26,460 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:19:26,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:19:26,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1211663977, now seen corresponding path program 1 times [2024-09-20 12:19:26,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:19:26,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154208959] [2024-09-20 12:19:26,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:19:26,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:19:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:26,593 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:19:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:26,595 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:19:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:26,602 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:19:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:26,605 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:19:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:26,609 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 12:19:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:26,610 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 12:19:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:26,612 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:19:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:26,620 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 12:19:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:26,681 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-20 12:19:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:26,684 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-20 12:19:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:26,687 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-20 12:19:26,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:19:26,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154208959] [2024-09-20 12:19:26,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154208959] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:19:26,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:19:26,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-20 12:19:26,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520736244] [2024-09-20 12:19:26,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:19:26,688 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-20 12:19:26,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:19:26,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-20 12:19:26,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-20 12:19:26,689 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-20 12:19:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:19:26,972 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2024-09-20 12:19:26,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-20 12:19:26,973 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-20 12:19:26,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:19:26,974 INFO L225 Difference]: With dead ends: 105 [2024-09-20 12:19:26,974 INFO L226 Difference]: Without dead ends: 94 [2024-09-20 12:19:26,974 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-20 12:19:26,975 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.2s IncrementalHoareTripleChecker+Time [2024-09-20 12:19:26,975 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.2s Time] [2024-09-20 12:19:26,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-09-20 12:19:26,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-09-20 12:19:26,996 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-20 12:19:26,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2024-09-20 12:19:26,997 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 61 [2024-09-20 12:19:26,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:19:26,998 INFO L474 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2024-09-20 12:19:26,998 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-20 12:19:26,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:19:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2024-09-20 12:19:26,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-20 12:19:26,999 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:19:26,999 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-20 12:19:27,000 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-20 12:19:27,000 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:19:27,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:19:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash -22267472, now seen corresponding path program 3 times [2024-09-20 12:19:27,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:19:27,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254800640] [2024-09-20 12:19:27,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:19:27,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:19:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:27,041 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:19:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:27,043 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:19:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:27,051 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:19:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:27,053 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:19:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:27,058 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 12:19:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:27,064 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 12:19:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:27,065 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:19:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:27,074 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 12:19:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:27,129 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-20 12:19:27,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:19:27,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254800640] [2024-09-20 12:19:27,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254800640] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:19:27,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320053208] [2024-09-20 12:19:27,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-20 12:19:27,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:19:27,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:19:27,132 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-20 12:19:27,133 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-20 12:19:27,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-20 12:19:27,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 12:19:27,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-20 12:19:27,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:19:27,310 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-20 12:19:27,310 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 12:19:27,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320053208] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:19:27,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-20 12:19:27,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-09-20 12:19:27,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284837723] [2024-09-20 12:19:27,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:19:27,311 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 12:19:27,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:19:27,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 12:19:27,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-09-20 12:19:27,312 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-20 12:19:27,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:19:27,372 INFO L93 Difference]: Finished difference Result 140 states and 171 transitions. [2024-09-20 12:19:27,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 12:19:27,373 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-20 12:19:27,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:19:27,374 INFO L225 Difference]: With dead ends: 140 [2024-09-20 12:19:27,375 INFO L226 Difference]: Without dead ends: 92 [2024-09-20 12:19:27,376 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-20 12:19:27,377 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-20 12:19:27,378 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-20 12:19:27,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-09-20 12:19:27,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-09-20 12:19:27,421 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-20 12:19:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2024-09-20 12:19:27,422 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 59 [2024-09-20 12:19:27,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:19:27,423 INFO L474 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2024-09-20 12:19:27,423 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-20 12:19:27,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:19:27,424 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2024-09-20 12:19:27,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-20 12:19:27,425 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:19:27,425 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-20 12:19:27,445 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-20 12:19:27,625 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-20 12:19:27,626 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:19:27,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:19:27,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1976101370, now seen corresponding path program 1 times [2024-09-20 12:19:27,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:19:27,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171981289] [2024-09-20 12:19:27,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:19:27,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:19:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:27,827 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:19:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:27,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:19:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:27,836 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:19:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:27,838 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:19:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:27,846 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 12:19:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:27,848 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 12:19:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:27,849 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:19:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:27,861 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 12:19:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:28,049 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-20 12:19:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:28,052 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-20 12:19:28,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:19:28,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171981289] [2024-09-20 12:19:28,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171981289] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:19:28,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966972973] [2024-09-20 12:19:28,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:19:28,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:19:28,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:19:28,055 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-20 12:19:28,057 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-20 12:19:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:28,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-20 12:19:28,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:19:28,266 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-20 12:19:28,335 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-20 12:19:28,369 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-20 12:19:28,370 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:19:28,523 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-20 12:19:28,638 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-20 12:19:28,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966972973] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:19:28,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:19:28,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 23 [2024-09-20 12:19:28,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956113760] [2024-09-20 12:19:28,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:19:28,639 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-20 12:19:28,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:19:28,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-20 12:19:28,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2024-09-20 12:19:28,643 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-20 12:19:29,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:19:29,408 INFO L93 Difference]: Finished difference Result 129 states and 156 transitions. [2024-09-20 12:19:29,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-20 12:19:29,408 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-20 12:19:29,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:19:29,411 INFO L225 Difference]: With dead ends: 129 [2024-09-20 12:19:29,411 INFO L226 Difference]: Without dead ends: 106 [2024-09-20 12:19:29,412 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-20 12:19:29,413 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 87 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-20 12:19:29,413 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 269 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-20 12:19:29,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-09-20 12:19:29,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2024-09-20 12:19:29,438 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-20 12:19:29,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2024-09-20 12:19:29,440 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 61 [2024-09-20 12:19:29,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:19:29,442 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2024-09-20 12:19:29,442 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-20 12:19:29,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:19:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2024-09-20 12:19:29,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-20 12:19:29,445 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:19:29,446 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-20 12:19:29,464 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-20 12:19:29,646 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-20 12:19:29,646 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:19:29,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:19:29,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1977948412, now seen corresponding path program 1 times [2024-09-20 12:19:29,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:19:29,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640447272] [2024-09-20 12:19:29,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:19:29,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:19:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:29,771 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:19:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:29,773 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:19:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:29,779 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:19:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:29,781 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:19:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:29,787 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 12:19:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:29,788 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 12:19:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:29,789 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:19:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:29,798 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 12:19:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:29,870 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-20 12:19:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:29,872 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-20 12:19:29,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:19:29,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640447272] [2024-09-20 12:19:29,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640447272] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:19:29,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:19:29,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-20 12:19:29,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020010934] [2024-09-20 12:19:29,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:19:29,874 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-20 12:19:29,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:19:29,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-20 12:19:29,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-09-20 12:19:29,875 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-20 12:19:30,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:19:30,245 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2024-09-20 12:19:30,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-20 12:19:30,246 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-20 12:19:30,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:19:30,247 INFO L225 Difference]: With dead ends: 122 [2024-09-20 12:19:30,247 INFO L226 Difference]: Without dead ends: 104 [2024-09-20 12:19:30,247 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-20 12:19:30,248 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 63 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-20 12:19:30,248 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-20 12:19:30,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-09-20 12:19:30,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2024-09-20 12:19:30,270 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-20 12:19:30,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2024-09-20 12:19:30,271 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 61 [2024-09-20 12:19:30,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:19:30,271 INFO L474 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2024-09-20 12:19:30,271 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-20 12:19:30,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:19:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2024-09-20 12:19:30,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-20 12:19:30,272 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:19:30,273 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-20 12:19:30,273 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-20 12:19:30,273 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:19:30,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:19:30,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1604316891, now seen corresponding path program 4 times [2024-09-20 12:19:30,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:19:30,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988785044] [2024-09-20 12:19:30,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:19:30,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:19:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:31,015 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:19:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:31,017 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:19:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:31,027 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:19:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:31,043 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:19:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:31,215 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 12:19:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:31,219 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 12:19:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:31,223 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:19:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:31,236 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 12:19:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:33,608 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-20 12:19:33,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:19:33,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988785044] [2024-09-20 12:19:33,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988785044] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:19:33,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010763831] [2024-09-20 12:19:33,609 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-20 12:19:33,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:19:33,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:19:33,610 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-20 12:19:33,613 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-20 12:19:33,707 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-20 12:19:33,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 12:19:33,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-09-20 12:19:33,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:19:33,745 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-20 12:19:33,998 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_mkdup_~j~0_39 Int) (v_mkdup_~i~0_35 Int)) (and (<= (+ v_mkdup_~j~0_39 1) |c_mkdup_#in~n|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_mkdup_#in~a.base| (let ((.cse1 (+ (* v_mkdup_~j~0_39 4) |c_mkdup_#in~a.offset|))) (let ((.cse0 (select (select |c_#memory_int#1| |c_mkdup_#in~a.base|) .cse1))) (store (store (select |c_old(#memory_int#1)| |c_mkdup_#in~a.base|) (+ |c_mkdup_#in~a.offset| (* v_mkdup_~i~0_35 4)) .cse0) .cse1 .cse0))))) (<= 0 v_mkdup_~j~0_39))) is different from true [2024-09-20 12:19:34,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2024-09-20 12:19:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-20 12:19:35,169 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:19:36,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010763831] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:19:36,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 12:19:36,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 42 [2024-09-20 12:19:36,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333937122] [2024-09-20 12:19:36,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 12:19:36,480 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-09-20 12:19:36,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:19:36,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-09-20 12:19:36,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2614, Unknown=1, NotChecked=104, Total=2970 [2024-09-20 12:19:36,483 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 42 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 36 states have internal predecessors, (59), 10 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2024-09-20 12:19:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:19:55,758 INFO L93 Difference]: Finished difference Result 163 states and 198 transitions. [2024-09-20 12:19:55,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-09-20 12:19:55,759 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 36 states have internal predecessors, (59), 10 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) Word has length 61 [2024-09-20 12:19:55,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:19:55,760 INFO L225 Difference]: With dead ends: 163 [2024-09-20 12:19:55,760 INFO L226 Difference]: Without dead ends: 83 [2024-09-20 12:19:55,764 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3591 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=1822, Invalid=12461, Unknown=1, NotChecked=236, Total=14520 [2024-09-20 12:19:55,764 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 325 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-09-20 12:19:55,765 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 224 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1784 Invalid, 0 Unknown, 141 Unchecked, 1.8s Time] [2024-09-20 12:19:55,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-20 12:19:55,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2024-09-20 12:19:55,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 54 states have internal predecessors, (60), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-20 12:19:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2024-09-20 12:19:55,806 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 61 [2024-09-20 12:19:55,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:19:55,806 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2024-09-20 12:19:55,806 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 36 states have internal predecessors, (59), 10 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2024-09-20 12:19:55,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:19:55,806 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2024-09-20 12:19:55,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-09-20 12:19:55,807 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:19:55,807 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-20 12:19:55,823 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-20 12:19:56,008 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-20 12:19:56,008 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:19:56,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:19:56,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1375399225, now seen corresponding path program 1 times [2024-09-20 12:19:56,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:19:56,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384620041] [2024-09-20 12:19:56,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:19:56,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:19:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:56,193 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:19:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:56,195 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:19:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:56,203 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:19:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:56,209 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:19:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:56,213 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 12:19:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:56,214 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 12:19:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:56,215 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:19:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:56,226 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 12:19:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:56,312 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-20 12:19:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:56,314 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-20 12:19:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:56,316 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-20 12:19:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:56,318 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-20 12:19:56,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:19:56,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384620041] [2024-09-20 12:19:56,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384620041] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:19:56,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:19:56,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-20 12:19:56,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870519356] [2024-09-20 12:19:56,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:19:56,319 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-20 12:19:56,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:19:56,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-20 12:19:56,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-09-20 12:19:56,320 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-09-20 12:19:56,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:19:56,654 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2024-09-20 12:19:56,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-20 12:19:56,654 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-20 12:19:56,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:19:56,656 INFO L225 Difference]: With dead ends: 84 [2024-09-20 12:19:56,656 INFO L226 Difference]: Without dead ends: 80 [2024-09-20 12:19:56,656 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-09-20 12:19:56,656 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 49 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-09-20 12:19:56,657 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.2s Time] [2024-09-20 12:19:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-20 12:19:56,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-09-20 12:19:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 states have internal predecessors, (61), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-20 12:19:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2024-09-20 12:19:56,684 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 67 [2024-09-20 12:19:56,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:19:56,687 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2024-09-20 12:19:56,687 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-20 12:19:56,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:19:56,688 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2024-09-20 12:19:56,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-09-20 12:19:56,688 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:19:56,688 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-20 12:19:56,689 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-20 12:19:56,689 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:19:56,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:19:56,689 INFO L85 PathProgramCache]: Analyzing trace with hash 219320101, now seen corresponding path program 1 times [2024-09-20 12:19:56,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:19:56,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795271242] [2024-09-20 12:19:56,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:19:56,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:19:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:57,523 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:19:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:57,526 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:19:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:57,537 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:19:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:57,556 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:19:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:57,720 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 12:19:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:57,724 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 12:19:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:57,726 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:19:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:57,744 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 12:19:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:57,956 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-20 12:19:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:57,959 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-20 12:19:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:57,961 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-20 12:19:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:57,964 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-20 12:19:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:57,975 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-20 12:19:57,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:19:57,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795271242] [2024-09-20 12:19:57,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795271242] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:19:57,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:19:57,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-09-20 12:19:57,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525929033] [2024-09-20 12:19:57,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:19:57,977 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-20 12:19:57,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:19:57,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-20 12:19:57,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2024-09-20 12:19:57,978 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 20 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 8 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2024-09-20 12:19:58,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:19:58,826 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2024-09-20 12:19:58,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-20 12:19:58,827 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 8 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) Word has length 73 [2024-09-20 12:19:58,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:19:58,828 INFO L225 Difference]: With dead ends: 101 [2024-09-20 12:19:58,828 INFO L226 Difference]: Without dead ends: 83 [2024-09-20 12:19:58,828 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=981, Unknown=0, NotChecked=0, Total=1122 [2024-09-20 12:19:58,829 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 100 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-20 12:19:58,829 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 134 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-20 12:19:58,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-20 12:19:58,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2024-09-20 12:19:58,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-20 12:19:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2024-09-20 12:19:58,860 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 73 [2024-09-20 12:19:58,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:19:58,861 INFO L474 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-09-20 12:19:58,861 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 8 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2024-09-20 12:19:58,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:19:58,861 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2024-09-20 12:19:58,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-09-20 12:19:58,861 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:19:58,862 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-20 12:19:58,862 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-20 12:19:58,862 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:19:58,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:19:58,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1185292379, now seen corresponding path program 1 times [2024-09-20 12:19:58,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:19:58,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696822039] [2024-09-20 12:19:58,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:19:58,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:19:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:59,293 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:19:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:59,295 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:19:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:59,304 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:19:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:59,307 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:19:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:59,313 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 12:19:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:59,315 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 12:19:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:59,316 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:19:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:59,328 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 12:19:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:59,510 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-20 12:19:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:59,514 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-20 12:19:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:59,517 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-20 12:19:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:59,520 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-20 12:19:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:59,525 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-20 12:19:59,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:19:59,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696822039] [2024-09-20 12:19:59,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696822039] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:19:59,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351902170] [2024-09-20 12:19:59,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:19:59,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:19:59,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:19:59,528 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-20 12:19:59,529 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-20 12:19:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:19:59,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-09-20 12:19:59,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:19:59,670 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-20 12:19:59,905 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_mkdup_~i~0_43 Int) (v_mkdup_~j~0_49 Int)) (and (<= (+ v_mkdup_~j~0_49 1) |c_mkdup_#in~n|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_mkdup_#in~a.base| (let ((.cse1 (+ |c_mkdup_#in~a.offset| (* v_mkdup_~j~0_49 4)))) (let ((.cse0 (select (select |c_#memory_int#1| |c_mkdup_#in~a.base|) .cse1))) (store (store (select |c_old(#memory_int#1)| |c_mkdup_#in~a.base|) (+ (* v_mkdup_~i~0_43 4) |c_mkdup_#in~a.offset|) .cse0) .cse1 .cse0))))) (<= 0 v_mkdup_~j~0_49) (<= 0 v_mkdup_~i~0_43) (<= (+ v_mkdup_~i~0_43 1) |c_mkdup_#in~n|))) is different from true [2024-09-20 12:19:59,914 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-20 12:20:00,934 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-20 12:20:00,939 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-20 12:20:11,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-20 12:20:11,906 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-20 12:20:12,115 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-20 12:20:12,115 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:20:12,753 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-20 12:20:12,760 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-20 12:20:16,957 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-20 12:20:16,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351902170] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:20:16,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:20:16,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 32, 20] total 56 [2024-09-20 12:20:16,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325106105] [2024-09-20 12:20:16,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:20:16,958 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-09-20 12:20:16,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:20:16,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-09-20 12:20:16,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=2702, Unknown=1, NotChecked=106, Total=3080 [2024-09-20 12:20:16,960 INFO L87 Difference]: Start difference. First operand 82 states and 88 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-20 12:20:21,911 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-20 12:21:15,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]