./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/duplets.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/duplets.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 15:40:33,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 15:40:33,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 15:40:33,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 15:40:33,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 15:40:33,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 15:40:33,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 15:40:33,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 15:40:33,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 15:40:33,487 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 15:40:33,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 15:40:33,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 15:40:33,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 15:40:33,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 15:40:33,493 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 15:40:33,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 15:40:33,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 15:40:33,494 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 15:40:33,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 15:40:33,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 15:40:33,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 15:40:33,496 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 15:40:33,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 15:40:33,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 15:40:33,497 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 15:40:33,498 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 15:40:33,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 15:40:33,498 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 15:40:33,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 15:40:33,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 15:40:33,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 15:40:33,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 15:40:33,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:40:33,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 15:40:33,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 15:40:33,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 15:40:33,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 15:40:33,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 15:40:33,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 15:40:33,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 15:40:33,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 15:40:33,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 15:40:33,502 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-12 15:40:33,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 15:40:33,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 15:40:33,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 15:40:33,858 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 15:40:33,859 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 15:40:33,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/duplets.c [2024-09-12 15:40:35,397 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 15:40:35,609 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 15:40:35,610 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/duplets.c [2024-09-12 15:40:35,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/4bcb931f6/2847bdacd82c4513997816d8223f1279/FLAG68c6074ef [2024-09-12 15:40:35,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/4bcb931f6/2847bdacd82c4513997816d8223f1279 [2024-09-12 15:40:35,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 15:40:35,630 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 15:40:35,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 15:40:35,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 15:40:35,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 15:40:35,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:40:35" (1/1) ... [2024-09-12 15:40:35,637 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79abd35d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:40:35, skipping insertion in model container [2024-09-12 15:40:35,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:40:35" (1/1) ... [2024-09-12 15:40:35,657 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 15:40:35,808 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/duplets.c[485,498] [2024-09-12 15:40:35,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:40:35,857 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 15:40:35,868 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/duplets.c[485,498] [2024-09-12 15:40:35,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:40:35,904 INFO L204 MainTranslator]: Completed translation [2024-09-12 15:40:35,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:40:35 WrapperNode [2024-09-12 15:40:35,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 15:40:35,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 15:40:35,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 15:40:35,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 15:40:35,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:40:35" (1/1) ... [2024-09-12 15:40:35,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:40:35" (1/1) ... [2024-09-12 15:40:35,933 INFO L138 Inliner]: procedures = 21, calls = 43, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 15:40:35,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 15:40:35,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 15:40:35,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 15:40:35,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 15:40:35,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:40:35" (1/1) ... [2024-09-12 15:40:35,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:40:35" (1/1) ... [2024-09-12 15:40:35,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:40:35" (1/1) ... [2024-09-12 15:40:35,968 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 5, 5, 7]. 37 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 5 writes are split as follows [0, 1, 1, 3]. [2024-09-12 15:40:35,969 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:40:35" (1/1) ... [2024-09-12 15:40:35,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:40:35" (1/1) ... [2024-09-12 15:40:35,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:40:35" (1/1) ... [2024-09-12 15:40:35,987 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:40:35" (1/1) ... [2024-09-12 15:40:35,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:40:35" (1/1) ... [2024-09-12 15:40:35,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:40:35" (1/1) ... [2024-09-12 15:40:35,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 15:40:35,999 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 15:40:35,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 15:40:35,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 15:40:36,000 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:40:35" (1/1) ... [2024-09-12 15:40:36,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:40:36,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:40:36,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 15:40:36,036 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 15:40:36,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 15:40:36,080 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2024-09-12 15:40:36,080 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2024-09-12 15:40:36,080 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 15:40:36,080 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 15:40:36,080 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 15:40:36,081 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 15:40:36,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 15:40:36,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-12 15:40:36,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-12 15:40:36,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-12 15:40:36,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-12 15:40:36,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-12 15:40:36,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-12 15:40:36,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-12 15:40:36,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-12 15:40:36,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 15:40:36,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 15:40:36,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-12 15:40:36,097 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2024-09-12 15:40:36,098 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2024-09-12 15:40:36,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 15:40:36,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 15:40:36,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-12 15:40:36,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-12 15:40:36,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-12 15:40:36,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-12 15:40:36,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-12 15:40:36,099 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-12 15:40:36,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 15:40:36,099 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 15:40:36,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-12 15:40:36,218 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 15:40:36,220 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 15:40:36,463 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-09-12 15:40:36,463 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 15:40:36,497 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 15:40:36,499 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-12 15:40:36,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:40:36 BoogieIcfgContainer [2024-09-12 15:40:36,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 15:40:36,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 15:40:36,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 15:40:36,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 15:40:36,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 03:40:35" (1/3) ... [2024-09-12 15:40:36,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464809a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:40:36, skipping insertion in model container [2024-09-12 15:40:36,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:40:35" (2/3) ... [2024-09-12 15:40:36,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464809a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:40:36, skipping insertion in model container [2024-09-12 15:40:36,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:40:36" (3/3) ... [2024-09-12 15:40:36,509 INFO L112 eAbstractionObserver]: Analyzing ICFG duplets.c [2024-09-12 15:40:36,527 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 15:40:36,527 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 15:40:36,589 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 15:40:36,596 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;@2761f69f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 15:40:36,597 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 15:40:36,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-12 15:40:36,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-12 15:40:36,609 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:40:36,610 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:40:36,610 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:40:36,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:40:36,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1311007902, now seen corresponding path program 1 times [2024-09-12 15:40:36,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:40:36,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711739598] [2024-09-12 15:40:36,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:40:36,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:40:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:36,827 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:40:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:36,850 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:40:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:36,863 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:40:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:36,874 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 15:40:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:36,906 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 15:40:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:36,914 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 15:40:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:36,919 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:40:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:36,933 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 15:40:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:36,948 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-12 15:40:36,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:40:36,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711739598] [2024-09-12 15:40:36,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711739598] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:40:36,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:40:36,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 15:40:36,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299355071] [2024-09-12 15:40:36,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:40:36,957 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 15:40:36,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:40:36,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 15:40:36,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 15:40:36,982 INFO L87 Difference]: Start difference. First operand has 54 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-12 15:40:37,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:40:37,222 INFO L93 Difference]: Finished difference Result 118 states and 170 transitions. [2024-09-12 15:40:37,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 15:40:37,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 46 [2024-09-12 15:40:37,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:40:37,233 INFO L225 Difference]: With dead ends: 118 [2024-09-12 15:40:37,234 INFO L226 Difference]: Without dead ends: 64 [2024-09-12 15:40:37,237 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:40:37,240 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 58 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:40:37,241 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 32 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:40:37,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-12 15:40:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2024-09-12 15:40:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-12 15:40:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2024-09-12 15:40:37,280 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 46 [2024-09-12 15:40:37,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:40:37,281 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2024-09-12 15:40:37,281 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-12 15:40:37,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:40:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2024-09-12 15:40:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-12 15:40:37,283 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:40:37,283 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:40:37,284 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 15:40:37,284 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:40:37,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:40:37,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1692327078, now seen corresponding path program 1 times [2024-09-12 15:40:37,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:40:37,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684662290] [2024-09-12 15:40:37,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:40:37,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:40:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:37,679 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:40:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:37,684 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:40:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:37,691 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:40:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:37,694 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 15:40:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:37,820 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 15:40:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:37,875 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 15:40:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:37,884 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:40:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:37,905 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 15:40:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-12 15:40:37,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:40:37,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684662290] [2024-09-12 15:40:37,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684662290] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:40:37,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508136237] [2024-09-12 15:40:37,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:40:37,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:40:37,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:40:37,968 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:40:37,970 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 15:40:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:38,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-12 15:40:38,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:40:38,180 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-12 15:40:38,181 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:40:38,506 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-12 15:40:38,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508136237] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:40:38,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:40:38,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 17 [2024-09-12 15:40:38,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811129719] [2024-09-12 15:40:38,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:40:38,508 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-12 15:40:38,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:40:38,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-12 15:40:38,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-09-12 15:40:38,510 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 8 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-09-12 15:40:39,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:40:39,092 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2024-09-12 15:40:39,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-12 15:40:39,093 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 8 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 46 [2024-09-12 15:40:39,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:40:39,095 INFO L225 Difference]: With dead ends: 99 [2024-09-12 15:40:39,095 INFO L226 Difference]: Without dead ends: 78 [2024-09-12 15:40:39,096 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2024-09-12 15:40:39,097 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 94 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 15:40:39,097 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 396 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 15:40:39,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-09-12 15:40:39,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 51. [2024-09-12 15:40:39,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-12 15:40:39,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2024-09-12 15:40:39,121 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 46 [2024-09-12 15:40:39,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:40:39,121 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2024-09-12 15:40:39,122 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 8 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-09-12 15:40:39,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:40:39,122 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2024-09-12 15:40:39,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-12 15:40:39,126 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:40:39,126 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:40:39,140 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 15:40:39,326 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:40:39,327 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:40:39,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:40:39,327 INFO L85 PathProgramCache]: Analyzing trace with hash -762329273, now seen corresponding path program 1 times [2024-09-12 15:40:39,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:40:39,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742958424] [2024-09-12 15:40:39,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:40:39,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:40:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:39,448 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:40:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:39,451 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:40:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:39,460 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:40:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:39,467 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 15:40:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:39,476 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 15:40:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:39,481 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 15:40:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:39,485 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:40:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:39,495 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 15:40:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-12 15:40:39,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:40:39,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742958424] [2024-09-12 15:40:39,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742958424] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:40:39,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:40:39,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-12 15:40:39,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769965791] [2024-09-12 15:40:39,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:40:39,524 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 15:40:39,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:40:39,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 15:40:39,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-12 15:40:39,526 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-12 15:40:39,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:40:39,827 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2024-09-12 15:40:39,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 15:40:39,827 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 47 [2024-09-12 15:40:39,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:40:39,829 INFO L225 Difference]: With dead ends: 71 [2024-09-12 15:40:39,829 INFO L226 Difference]: Without dead ends: 69 [2024-09-12 15:40:39,829 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-09-12 15:40:39,830 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 74 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:40:39,830 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 185 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:40:39,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-12 15:40:39,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2024-09-12 15:40:39,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 37 states have internal predecessors, (41), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-09-12 15:40:39,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2024-09-12 15:40:39,852 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 47 [2024-09-12 15:40:39,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:40:39,852 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2024-09-12 15:40:39,852 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-12 15:40:39,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:40:39,853 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2024-09-12 15:40:39,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-12 15:40:39,855 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:40:39,856 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:40:39,856 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 15:40:39,856 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:40:39,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:40:39,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1192301050, now seen corresponding path program 1 times [2024-09-12 15:40:39,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:40:39,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953987071] [2024-09-12 15:40:39,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:40:39,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:40:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:40,109 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:40:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:40,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:40:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:40,123 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:40:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:40,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 15:40:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:40,359 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 15:40:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:40,393 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 15:40:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:40,425 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:40:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:40,461 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 15:40:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:40,547 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-12 15:40:40,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:40:40,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953987071] [2024-09-12 15:40:40,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953987071] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:40:40,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231776553] [2024-09-12 15:40:40,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:40:40,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:40:40,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:40:40,550 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:40:40,553 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 15:40:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:40,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-12 15:40:40,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:40:40,820 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-12 15:40:40,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:40:41,314 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-12 15:40:41,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231776553] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-12 15:40:41,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-12 15:40:41,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16, 12] total 27 [2024-09-12 15:40:41,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588499443] [2024-09-12 15:40:41,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:40:41,315 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 15:40:41,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:40:41,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 15:40:41,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2024-09-12 15:40:41,317 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-12 15:40:41,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:40:41,484 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2024-09-12 15:40:41,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 15:40:41,485 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 49 [2024-09-12 15:40:41,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:40:41,489 INFO L225 Difference]: With dead ends: 101 [2024-09-12 15:40:41,490 INFO L226 Difference]: Without dead ends: 68 [2024-09-12 15:40:41,491 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-12 15:40:41,492 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 18 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:40:41,494 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 406 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:40:41,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-12 15:40:41,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2024-09-12 15:40:41,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 38 states have internal predecessors, (42), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-09-12 15:40:41,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2024-09-12 15:40:41,513 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 49 [2024-09-12 15:40:41,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:40:41,514 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2024-09-12 15:40:41,514 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-12 15:40:41,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:40:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2024-09-12 15:40:41,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-09-12 15:40:41,518 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:40:41,518 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:40:41,545 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 15:40:41,719 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:40:41,719 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:40:41,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:40:41,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1656998341, now seen corresponding path program 1 times [2024-09-12 15:40:41,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:40:41,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141465018] [2024-09-12 15:40:41,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:40:41,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:40:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:41,774 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:40:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:41,777 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:40:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:41,781 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:40:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:41,784 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 15:40:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:41,789 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 15:40:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:41,791 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 15:40:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:41,792 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:40:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:41,799 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 15:40:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:41,830 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-12 15:40:41,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:40:41,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141465018] [2024-09-12 15:40:41,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141465018] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:40:41,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913335245] [2024-09-12 15:40:41,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:40:41,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:40:41,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:40:41,832 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:40:41,834 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 15:40:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:41,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 15:40:41,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:40:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-12 15:40:41,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:40:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-12 15:40:42,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913335245] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:40:42,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:40:42,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2024-09-12 15:40:42,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222192450] [2024-09-12 15:40:42,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:40:42,019 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:40:42,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:40:42,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:40:42,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:40:42,020 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-12 15:40:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:40:42,238 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2024-09-12 15:40:42,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 15:40:42,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 51 [2024-09-12 15:40:42,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:40:42,240 INFO L225 Difference]: With dead ends: 94 [2024-09-12 15:40:42,240 INFO L226 Difference]: Without dead ends: 73 [2024-09-12 15:40:42,241 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-09-12 15:40:42,241 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 62 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:40:42,241 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 118 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:40:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-12 15:40:42,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2024-09-12 15:40:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-09-12 15:40:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2024-09-12 15:40:42,277 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 51 [2024-09-12 15:40:42,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:40:42,278 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2024-09-12 15:40:42,278 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-12 15:40:42,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:40:42,278 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2024-09-12 15:40:42,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-12 15:40:42,279 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:40:42,280 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:40:42,296 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-12 15:40:42,480 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:40:42,481 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:40:42,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:40:42,481 INFO L85 PathProgramCache]: Analyzing trace with hash 106146672, now seen corresponding path program 1 times [2024-09-12 15:40:42,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:40:42,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195553415] [2024-09-12 15:40:42,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:40:42,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:40:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:42,698 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:40:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:42,700 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:40:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:42,709 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:40:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:42,714 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 15:40:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:42,737 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 15:40:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:42,739 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 15:40:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:42,741 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:40:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:42,751 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 15:40:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:42,875 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-12 15:40:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-12 15:40:42,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:40:42,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195553415] [2024-09-12 15:40:42,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195553415] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:40:42,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:40:42,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-09-12 15:40:42,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926972974] [2024-09-12 15:40:42,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:40:42,881 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-12 15:40:42,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:40:42,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-12 15:40:42,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-09-12 15:40:42,882 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-12 15:40:43,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:40:43,394 INFO L93 Difference]: Finished difference Result 107 states and 135 transitions. [2024-09-12 15:40:43,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-12 15:40:43,395 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 54 [2024-09-12 15:40:43,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:40:43,396 INFO L225 Difference]: With dead ends: 107 [2024-09-12 15:40:43,396 INFO L226 Difference]: Without dead ends: 93 [2024-09-12 15:40:43,397 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-09-12 15:40:43,397 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-12 15:40:43,397 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-12 15:40:43,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-12 15:40:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 76. [2024-09-12 15:40:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.1875) internal successors, (57), 51 states have internal predecessors, (57), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2024-09-12 15:40:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2024-09-12 15:40:43,421 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 54 [2024-09-12 15:40:43,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:40:43,421 INFO L474 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2024-09-12 15:40:43,422 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-12 15:40:43,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:40:43,422 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2024-09-12 15:40:43,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-12 15:40:43,423 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:40:43,423 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:40:43,423 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 15:40:43,423 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:40:43,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:40:43,423 INFO L85 PathProgramCache]: Analyzing trace with hash -265637807, now seen corresponding path program 2 times [2024-09-12 15:40:43,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:40:43,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623847144] [2024-09-12 15:40:43,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:40:43,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:40:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:43,977 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:40:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:43,980 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:40:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:43,988 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:40:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:43,991 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 15:40:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:44,773 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 15:40:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:44,823 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 15:40:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:44,867 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:40:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:44,918 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 15:40:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:40:45,187 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-12 15:40:45,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:40:45,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623847144] [2024-09-12 15:40:45,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623847144] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:40:45,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395274407] [2024-09-12 15:40:45,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 15:40:45,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:40:45,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:40:45,190 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:40:45,192 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 15:40:45,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 15:40:45,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:40:45,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-09-12 15:40:45,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:40:45,522 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-09-12 15:40:45,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 19 [2024-09-12 15:40:53,859 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_mkdup_~i~0_30 Int) (v_mkdup_~j~0_34 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (and (let ((.cse0 (select |c_#memory_int#3| v_main_~a~0.base_BEFORE_CALL_1))) (= (select .cse0 (+ (* v_mkdup_~j~0_34 4) v_main_~a~0.offset_BEFORE_CALL_1)) (select .cse0 (+ (* v_mkdup_~i~0_30 4) v_main_~a~0.offset_BEFORE_CALL_1)))) (not (= v_mkdup_~i~0_30 v_mkdup_~j~0_34)) (<= 0 v_mkdup_~i~0_30) (<= 0 v_mkdup_~j~0_34))) is different from true [2024-09-12 15:41:14,620 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-12 15:41:14,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:41:14,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395274407] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:41:14,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 15:41:14,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 34 [2024-09-12 15:41:14,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583990109] [2024-09-12 15:41:14,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 15:41:14,768 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-09-12 15:41:14,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:41:14,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-09-12 15:41:14,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1035, Unknown=7, NotChecked=64, Total=1190 [2024-09-12 15:41:14,769 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand has 34 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 12 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-12 15:41:19,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 15:41:26,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 15:41:31,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 15:41:35,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 15:41:39,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 15:41:40,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:41:40,051 INFO L93 Difference]: Finished difference Result 164 states and 214 transitions. [2024-09-12 15:41:40,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-09-12 15:41:40,052 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 12 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Word has length 54 [2024-09-12 15:41:40,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:41:40,053 INFO L225 Difference]: With dead ends: 164 [2024-09-12 15:41:40,053 INFO L226 Difference]: Without dead ends: 111 [2024-09-12 15:41:40,055 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 33.1s TimeCoverageRelationStatistics Valid=410, Invalid=3739, Unknown=15, NotChecked=126, Total=4290 [2024-09-12 15:41:40,056 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 262 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 1686 mSolverCounterSat, 67 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1686 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2024-09-12 15:41:40,056 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 581 Invalid, 1909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1686 Invalid, 6 Unknown, 150 Unchecked, 21.4s Time] [2024-09-12 15:41:40,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-09-12 15:41:40,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2024-09-12 15:41:40,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 55 states have internal predecessors, (62), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2024-09-12 15:41:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2024-09-12 15:41:40,086 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 54 [2024-09-12 15:41:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:41:40,086 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2024-09-12 15:41:40,087 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 12 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-12 15:41:40,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:41:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2024-09-12 15:41:40,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-12 15:41:40,088 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:41:40,088 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:41:40,105 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-12 15:41:40,292 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:41:40,293 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:41:40,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:41:40,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1209816935, now seen corresponding path program 1 times [2024-09-12 15:41:40,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:41:40,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049997290] [2024-09-12 15:41:40,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:41:40,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:41:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:40,467 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:41:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:40,469 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:41:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:40,477 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:41:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:40,479 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 15:41:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:40,483 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 15:41:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:40,484 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 15:41:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:40,486 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:41:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:40,496 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 15:41:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:40,572 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-12 15:41:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:40,574 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-12 15:41:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:40,577 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-12 15:41:40,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:41:40,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049997290] [2024-09-12 15:41:40,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049997290] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:41:40,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:41:40,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-12 15:41:40,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851253426] [2024-09-12 15:41:40,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:41:40,578 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 15:41:40,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:41:40,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 15:41:40,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-09-12 15:41:40,579 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-12 15:41:41,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:41:41,003 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2024-09-12 15:41:41,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 15:41:41,003 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 61 [2024-09-12 15:41:41,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:41:41,004 INFO L225 Difference]: With dead ends: 100 [2024-09-12 15:41:41,004 INFO L226 Difference]: Without dead ends: 98 [2024-09-12 15:41:41,005 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-09-12 15:41:41,005 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-12 15:41:41,005 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-12 15:41:41,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-09-12 15:41:41,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2024-09-12 15:41:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 62 states have internal predecessors, (71), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-09-12 15:41:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2024-09-12 15:41:41,028 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 61 [2024-09-12 15:41:41,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:41:41,029 INFO L474 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2024-09-12 15:41:41,029 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-12 15:41:41,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:41:41,029 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2024-09-12 15:41:41,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-12 15:41:41,030 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:41:41,030 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:41:41,030 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 15:41:41,031 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:41:41,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:41:41,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1211663977, now seen corresponding path program 1 times [2024-09-12 15:41:41,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:41:41,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611837917] [2024-09-12 15:41:41,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:41:41,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:41:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:41,144 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:41:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:41,146 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:41:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:41,152 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:41:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:41,154 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 15:41:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:41,158 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 15:41:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:41,159 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 15:41:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:41,161 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:41:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:41,168 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 15:41:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:41,228 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-12 15:41:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:41,231 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-12 15:41:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:41,233 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-12 15:41:41,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:41:41,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611837917] [2024-09-12 15:41:41,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611837917] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:41:41,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:41:41,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-12 15:41:41,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938610746] [2024-09-12 15:41:41,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:41:41,234 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 15:41:41,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:41:41,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 15:41:41,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-12 15:41:41,235 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-12 15:41:41,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:41:41,573 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2024-09-12 15:41:41,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 15:41:41,573 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 61 [2024-09-12 15:41:41,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:41:41,574 INFO L225 Difference]: With dead ends: 105 [2024-09-12 15:41:41,574 INFO L226 Difference]: Without dead ends: 94 [2024-09-12 15:41:41,575 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-09-12 15:41:41,575 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 65 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 15:41:41,575 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 140 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 15:41:41,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-09-12 15:41:41,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-09-12 15:41:41,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 62 states have internal predecessors, (70), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-09-12 15:41:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2024-09-12 15:41:41,598 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 61 [2024-09-12 15:41:41,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:41:41,598 INFO L474 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2024-09-12 15:41:41,598 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-12 15:41:41,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:41:41,598 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2024-09-12 15:41:41,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-12 15:41:41,602 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:41:41,602 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:41:41,602 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-12 15:41:41,602 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:41:41,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:41:41,602 INFO L85 PathProgramCache]: Analyzing trace with hash -22267472, now seen corresponding path program 3 times [2024-09-12 15:41:41,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:41:41,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944402106] [2024-09-12 15:41:41,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:41:41,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:41:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:41,645 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:41:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:41,647 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:41:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:41,650 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:41:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:41,653 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 15:41:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:41,657 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 15:41:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:41,658 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 15:41:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:41,660 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:41:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:41,667 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 15:41:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-12 15:41:41,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:41:41,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944402106] [2024-09-12 15:41:41,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944402106] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:41:41,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850511798] [2024-09-12 15:41:41,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 15:41:41,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:41:41,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:41:41,734 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:41:41,735 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 15:41:41,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-12 15:41:41,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:41:41,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 15:41:41,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:41:41,865 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-09-12 15:41:41,865 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 15:41:41,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850511798] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:41:41,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 15:41:41,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-09-12 15:41:41,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611422883] [2024-09-12 15:41:41,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:41:41,866 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:41:41,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:41:41,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:41:41,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-09-12 15:41:41,867 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-12 15:41:41,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:41:41,931 INFO L93 Difference]: Finished difference Result 140 states and 171 transitions. [2024-09-12 15:41:41,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 15:41:41,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 59 [2024-09-12 15:41:41,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:41:41,933 INFO L225 Difference]: With dead ends: 140 [2024-09-12 15:41:41,933 INFO L226 Difference]: Without dead ends: 92 [2024-09-12 15:41:41,933 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-09-12 15:41:41,934 INFO L434 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:41:41,934 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 204 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:41:41,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-09-12 15:41:41,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-09-12 15:41:41,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 63 states have internal predecessors, (70), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-09-12 15:41:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2024-09-12 15:41:41,953 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 59 [2024-09-12 15:41:41,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:41:41,954 INFO L474 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2024-09-12 15:41:41,954 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-12 15:41:41,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:41:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2024-09-12 15:41:41,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-12 15:41:41,955 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:41:41,955 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:41:41,971 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-12 15:41:42,155 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-12 15:41:42,156 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:41:42,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:41:42,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1976101370, now seen corresponding path program 1 times [2024-09-12 15:41:42,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:41:42,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183611981] [2024-09-12 15:41:42,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:41:42,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:41:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:42,315 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:41:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:42,317 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:41:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:42,324 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:41:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:42,326 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 15:41:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:42,330 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 15:41:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:42,332 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 15:41:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:42,333 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:41:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:42,342 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 15:41:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:42,524 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-12 15:41:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-12 15:41:42,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:41:42,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183611981] [2024-09-12 15:41:42,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183611981] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:41:42,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369899284] [2024-09-12 15:41:42,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:41:42,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:41:42,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:41:42,529 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:41:42,531 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-12 15:41:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:42,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-12 15:41:42,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:41:42,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-12 15:41:42,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-09-12 15:41:42,823 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-12 15:41:42,823 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:41:42,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-09-12 15:41:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-12 15:41:43,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369899284] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:41:43,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:41:43,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 23 [2024-09-12 15:41:43,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451224402] [2024-09-12 15:41:43,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:41:43,058 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-12 15:41:43,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:41:43,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-12 15:41:43,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2024-09-12 15:41:43,059 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-09-12 15:41:43,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:41:43,750 INFO L93 Difference]: Finished difference Result 129 states and 156 transitions. [2024-09-12 15:41:43,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-12 15:41:43,752 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 61 [2024-09-12 15:41:43,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:41:43,753 INFO L225 Difference]: With dead ends: 129 [2024-09-12 15:41:43,753 INFO L226 Difference]: Without dead ends: 106 [2024-09-12 15:41:43,754 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 128 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2024-09-12 15:41:43,754 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 88 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 15:41:43,754 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 305 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 15:41:43,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-09-12 15:41:43,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2024-09-12 15:41:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 65 states have internal predecessors, (74), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-09-12 15:41:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2024-09-12 15:41:43,782 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 61 [2024-09-12 15:41:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:41:43,782 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2024-09-12 15:41:43,783 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-09-12 15:41:43,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:41:43,783 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2024-09-12 15:41:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-12 15:41:43,784 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:41:43,785 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:41:43,801 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-12 15:41:43,985 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-12 15:41:43,985 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:41:43,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:41:43,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1977948412, now seen corresponding path program 1 times [2024-09-12 15:41:43,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:41:43,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650345088] [2024-09-12 15:41:43,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:41:43,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:41:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:44,095 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:41:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:44,097 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:41:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:44,103 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:41:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:44,106 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 15:41:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:44,111 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 15:41:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:44,113 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 15:41:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:44,114 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:41:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:44,122 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 15:41:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:44,203 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-12 15:41:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:44,206 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-12 15:41:44,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:41:44,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650345088] [2024-09-12 15:41:44,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650345088] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:41:44,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:41:44,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-12 15:41:44,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032171375] [2024-09-12 15:41:44,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:41:44,207 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 15:41:44,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:41:44,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 15:41:44,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-09-12 15:41:44,208 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-12 15:41:44,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:41:44,605 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2024-09-12 15:41:44,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 15:41:44,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 61 [2024-09-12 15:41:44,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:41:44,607 INFO L225 Difference]: With dead ends: 122 [2024-09-12 15:41:44,607 INFO L226 Difference]: Without dead ends: 104 [2024-09-12 15:41:44,607 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-09-12 15:41:44,608 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 63 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 15:41:44,608 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 199 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 15:41:44,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-09-12 15:41:44,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2024-09-12 15:41:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 58 states have internal predecessors, (65), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2024-09-12 15:41:44,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2024-09-12 15:41:44,632 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 61 [2024-09-12 15:41:44,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:41:44,633 INFO L474 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2024-09-12 15:41:44,633 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-12 15:41:44,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:41:44,633 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2024-09-12 15:41:44,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-12 15:41:44,634 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:41:44,634 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:41:44,634 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-12 15:41:44,634 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:41:44,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:41:44,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1604316891, now seen corresponding path program 4 times [2024-09-12 15:41:44,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:41:44,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190895260] [2024-09-12 15:41:44,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:41:44,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:41:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:45,403 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:41:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:45,406 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:41:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:45,415 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:41:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:45,427 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 15:41:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:45,572 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-12 15:41:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:45,576 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 15:41:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:45,580 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:41:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:45,595 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 15:41:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:48,084 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-12 15:41:48,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:41:48,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190895260] [2024-09-12 15:41:48,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190895260] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:41:48,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999368618] [2024-09-12 15:41:48,084 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 15:41:48,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:41:48,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:41:48,085 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:41:48,087 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-12 15:41:48,170 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 15:41:48,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:41:48,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-09-12 15:41:48,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:41:48,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-12 15:41:48,283 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_mkdup_~a.offset_22 Int) (v_mkdup_~j~0_39 Int) (v_mkdup_~i~0_35 Int)) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_mkdup_#in~a.base| (let ((.cse1 (+ (* v_mkdup_~j~0_39 4) v_mkdup_~a.offset_22))) (let ((.cse0 (select (select |c_#memory_int#3| |c_mkdup_#in~a.base|) .cse1))) (store (store (select |c_old(#memory_int#3)| |c_mkdup_#in~a.base|) (+ v_mkdup_~a.offset_22 (* v_mkdup_~i~0_35 4)) .cse0) .cse1 .cse0)))))) is different from true [2024-09-12 15:41:48,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2024-09-12 15:41:52,314 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-09-12 15:41:52,315 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:41:53,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999368618] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:41:53,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 15:41:53,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 37 [2024-09-12 15:41:53,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668484238] [2024-09-12 15:41:53,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 15:41:53,327 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-09-12 15:41:53,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:41:53,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-09-12 15:41:53,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2035, Unknown=2, NotChecked=92, Total=2352 [2024-09-12 15:41:53,329 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 37 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 32 states have internal predecessors, (55), 8 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2024-09-12 15:41:57,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 15:41:59,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 15:42:03,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 15:42:08,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 15:42:27,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]