./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/duplets.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/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 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 19:37:21,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:37:21,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:37:21,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:37:21,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:37:21,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:37:21,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:37:21,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:37:21,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:37:21,981 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:37:21,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:37:21,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:37:21,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:37:21,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:37:21,982 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:37:21,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:37:21,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:37:21,985 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:37:21,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:37:21,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:37:21,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:37:21,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:37:21,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:37:21,989 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:37:21,989 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:37:21,989 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:37:21,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:37:21,990 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:37:21,990 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:37:21,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:37:21,990 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:37:21,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:37:21,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:37:21,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:37:21,991 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:37:21,991 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:37:21,991 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:37:21,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:37:21,991 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:37:21,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:37:21,991 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:37:21,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:37:21,992 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.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 19:37:22,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:37:22,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:37:22,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:37:22,242 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:37:22,243 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:37:22,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/duplets.c [2024-09-11 19:37:23,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:37:23,654 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:37:23,654 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/duplets.c [2024-09-11 19:37:23,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/5485e1c34/f5bc4b39199c47a490e95fe8ee781e75/FLAGa9cabed63 [2024-09-11 19:37:24,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/5485e1c34/f5bc4b39199c47a490e95fe8ee781e75 [2024-09-11 19:37:24,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:37:24,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:37:24,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:37:24,066 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:37:24,070 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:37:24,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:37:24" (1/1) ... [2024-09-11 19:37:24,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d5ad2d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:24, skipping insertion in model container [2024-09-11 19:37:24,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:37:24" (1/1) ... [2024-09-11 19:37:24,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:37:24,194 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-11 19:37:24,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:37:24,225 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:37:24,233 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-11 19:37:24,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:37:24,258 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:37:24,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:24 WrapperNode [2024-09-11 19:37:24,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:37:24,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:37:24,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:37:24,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:37:24,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:24" (1/1) ... [2024-09-11 19:37:24,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:24" (1/1) ... [2024-09-11 19:37:24,291 INFO L138 Inliner]: procedures = 21, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 124 [2024-09-11 19:37:24,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:37:24,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:37:24,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:37:24,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:37:24,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:24" (1/1) ... [2024-09-11 19:37:24,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:24" (1/1) ... [2024-09-11 19:37:24,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:24" (1/1) ... [2024-09-11 19:37:24,341 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-11 19:37:24,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:24" (1/1) ... [2024-09-11 19:37:24,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:24" (1/1) ... [2024-09-11 19:37:24,355 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:24" (1/1) ... [2024-09-11 19:37:24,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:24" (1/1) ... [2024-09-11 19:37:24,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:24" (1/1) ... [2024-09-11 19:37:24,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:24" (1/1) ... [2024-09-11 19:37:24,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:37:24,370 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:37:24,370 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:37:24,370 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:37:24,371 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:24" (1/1) ... [2024-09-11 19:37:24,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:37:24,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:37:24,420 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-11 19:37:24,422 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-11 19:37:24,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:37:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-11 19:37:24,462 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-11 19:37:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:37:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-11 19:37:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-11 19:37:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-11 19:37:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-11 19:37:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-11 19:37:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-11 19:37:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-11 19:37:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-11 19:37:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-11 19:37:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:37:24,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:37:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-11 19:37:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-11 19:37:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-11 19:37:24,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-11 19:37:24,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 19:37:24,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 19:37:24,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-11 19:37:24,542 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:37:24,543 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:37:24,694 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2024-09-11 19:37:24,694 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:37:24,720 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:37:24,721 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 19:37:24,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:37:24 BoogieIcfgContainer [2024-09-11 19:37:24,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:37:24,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:37:24,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:37:24,725 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:37:24,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:37:24" (1/3) ... [2024-09-11 19:37:24,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39153d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:37:24, skipping insertion in model container [2024-09-11 19:37:24,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:24" (2/3) ... [2024-09-11 19:37:24,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39153d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:37:24, skipping insertion in model container [2024-09-11 19:37:24,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:37:24" (3/3) ... [2024-09-11 19:37:24,727 INFO L112 eAbstractionObserver]: Analyzing ICFG duplets.c [2024-09-11 19:37:24,738 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:37:24,739 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:37:24,773 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:37:24,777 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;@cb8b6c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:37:24,778 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:37:24,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 19:37:24,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-11 19:37:24,785 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:24,786 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] [2024-09-11 19:37:24,786 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:24,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:24,790 INFO L85 PathProgramCache]: Analyzing trace with hash -633346845, now seen corresponding path program 1 times [2024-09-11 19:37:24,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:24,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814680072] [2024-09-11 19:37:24,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:24,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:24,922 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:24,928 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:37:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:24,931 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:37:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:24,935 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:37:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:24,938 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-11 19:37:24,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:24,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814680072] [2024-09-11 19:37:24,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814680072] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:37:24,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:37:24,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:37:24,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37951214] [2024-09-11 19:37:24,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:37:24,944 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 19:37:24,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:24,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 19:37:24,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:37:24,961 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:37:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:24,984 INFO L93 Difference]: Finished difference Result 70 states and 108 transitions. [2024-09-11 19:37:24,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 19:37:24,986 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2024-09-11 19:37:24,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:24,991 INFO L225 Difference]: With dead ends: 70 [2024-09-11 19:37:24,991 INFO L226 Difference]: Without dead ends: 34 [2024-09-11 19:37:24,993 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:37:24,995 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:24,996 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:37:25,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-11 19:37:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-11 19:37:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 19:37:25,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2024-09-11 19:37:25,025 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 30 [2024-09-11 19:37:25,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:25,025 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2024-09-11 19:37:25,025 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:37:25,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:25,026 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2024-09-11 19:37:25,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-11 19:37:25,027 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:25,027 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] [2024-09-11 19:37:25,028 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:37:25,028 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:25,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:25,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1840136240, now seen corresponding path program 1 times [2024-09-11 19:37:25,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:25,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783981262] [2024-09-11 19:37:25,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:25,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:25,262 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:25,270 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:37:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:25,277 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:37:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:25,316 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:37:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:25,340 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-11 19:37:25,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:25,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783981262] [2024-09-11 19:37:25,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783981262] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:37:25,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706062492] [2024-09-11 19:37:25,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:25,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:37:25,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:37:25,343 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:37:25,344 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-11 19:37:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:25,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-11 19:37:25,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:37:25,485 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-11 19:37:25,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:37:25,595 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-11 19:37:25,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706062492] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:37:25,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:37:25,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-09-11 19:37:25,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478915909] [2024-09-11 19:37:25,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:37:25,597 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-11 19:37:25,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:25,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-11 19:37:25,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-09-11 19:37:25,598 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-11 19:37:25,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:25,715 INFO L93 Difference]: Finished difference Result 62 states and 83 transitions. [2024-09-11 19:37:25,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 19:37:25,717 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2024-09-11 19:37:25,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:25,718 INFO L225 Difference]: With dead ends: 62 [2024-09-11 19:37:25,719 INFO L226 Difference]: Without dead ends: 43 [2024-09-11 19:37:25,720 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-09-11 19:37:25,721 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 52 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:25,722 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 169 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:37:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-11 19:37:25,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2024-09-11 19:37:25,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 19:37:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-09-11 19:37:25,736 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 30 [2024-09-11 19:37:25,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:25,736 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-09-11 19:37:25,736 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-11 19:37:25,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-09-11 19:37:25,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-11 19:37:25,737 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:25,737 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] [2024-09-11 19:37:25,753 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 19:37:25,941 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-11 19:37:25,942 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:25,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:25,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1407409120, now seen corresponding path program 1 times [2024-09-11 19:37:25,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:25,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919512027] [2024-09-11 19:37:25,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:25,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:26,021 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:26,025 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:37:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:26,027 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:37:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:26,031 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:37:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:26,032 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-11 19:37:26,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:26,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919512027] [2024-09-11 19:37:26,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919512027] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:37:26,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:37:26,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:37:26,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041132811] [2024-09-11 19:37:26,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:37:26,034 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:37:26,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:26,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:37:26,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:37:26,035 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:37:26,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:26,092 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2024-09-11 19:37:26,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:37:26,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2024-09-11 19:37:26,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:26,094 INFO L225 Difference]: With dead ends: 53 [2024-09-11 19:37:26,094 INFO L226 Difference]: Without dead ends: 51 [2024-09-11 19:37:26,094 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:37:26,095 INFO L434 NwaCegarLoop]: 48 mSDtfsCounter, 11 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:26,095 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 223 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:37:26,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-11 19:37:26,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2024-09-11 19:37:26,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 19:37:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2024-09-11 19:37:26,107 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 31 [2024-09-11 19:37:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:26,108 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2024-09-11 19:37:26,108 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:37:26,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2024-09-11 19:37:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-11 19:37:26,109 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:26,109 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] [2024-09-11 19:37:26,109 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 19:37:26,109 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:26,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:26,110 INFO L85 PathProgramCache]: Analyzing trace with hash 449686045, now seen corresponding path program 1 times [2024-09-11 19:37:26,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:26,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651790063] [2024-09-11 19:37:26,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:26,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:26,417 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:26,419 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:37:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:26,461 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:37:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:26,488 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:37:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:26,511 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-11 19:37:26,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:26,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651790063] [2024-09-11 19:37:26,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651790063] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:37:26,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:37:26,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-11 19:37:26,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552252572] [2024-09-11 19:37:26,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:37:26,513 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 19:37:26,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:26,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 19:37:26,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:37:26,513 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 10 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 19:37:26,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:26,747 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2024-09-11 19:37:26,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 19:37:26,749 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2024-09-11 19:37:26,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:26,750 INFO L225 Difference]: With dead ends: 74 [2024-09-11 19:37:26,750 INFO L226 Difference]: Without dead ends: 45 [2024-09-11 19:37:26,751 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-09-11 19:37:26,751 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:26,752 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 227 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:37:26,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-11 19:37:26,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2024-09-11 19:37:26,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 19:37:26,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2024-09-11 19:37:26,776 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 33 [2024-09-11 19:37:26,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:26,776 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-09-11 19:37:26,777 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 19:37:26,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:26,777 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2024-09-11 19:37:26,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-11 19:37:26,778 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:26,779 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] [2024-09-11 19:37:26,779 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-11 19:37:26,781 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:26,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:26,781 INFO L85 PathProgramCache]: Analyzing trace with hash -320162031, now seen corresponding path program 1 times [2024-09-11 19:37:26,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:26,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932849518] [2024-09-11 19:37:26,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:26,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:26,873 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:26,878 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:37:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:26,881 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:37:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:26,887 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:37:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:26,888 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-11 19:37:26,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:26,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932849518] [2024-09-11 19:37:26,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932849518] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:37:26,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115869213] [2024-09-11 19:37:26,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:26,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:37:26,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:37:26,891 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:37:26,896 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-11 19:37:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:26,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-11 19:37:26,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:37:26,993 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-11 19:37:26,993 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:37:27,020 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-11 19:37:27,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115869213] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:37:27,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:37:27,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-09-11 19:37:27,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219270576] [2024-09-11 19:37:27,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:37:27,021 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:37:27,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:27,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:37:27,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:37:27,022 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:37:27,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:27,068 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2024-09-11 19:37:27,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:37:27,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2024-09-11 19:37:27,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:27,070 INFO L225 Difference]: With dead ends: 64 [2024-09-11 19:37:27,070 INFO L226 Difference]: Without dead ends: 45 [2024-09-11 19:37:27,070 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:37:27,071 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:27,071 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 139 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:37:27,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-11 19:37:27,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-09-11 19:37:27,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 19:37:27,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2024-09-11 19:37:27,079 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 35 [2024-09-11 19:37:27,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:27,080 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2024-09-11 19:37:27,080 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:37:27,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:27,080 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2024-09-11 19:37:27,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-11 19:37:27,081 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:27,081 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] [2024-09-11 19:37:27,096 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 19:37:27,281 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:37:27,282 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:27,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:27,283 INFO L85 PathProgramCache]: Analyzing trace with hash 9167953, now seen corresponding path program 1 times [2024-09-11 19:37:27,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:27,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082151236] [2024-09-11 19:37:27,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:27,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:27,519 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:27,521 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:37:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:27,523 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:37:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:27,526 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:37:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:27,527 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-11 19:37:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:27,531 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-11 19:37:27,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:27,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082151236] [2024-09-11 19:37:27,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082151236] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:37:27,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:37:27,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-11 19:37:27,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587965154] [2024-09-11 19:37:27,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:37:27,536 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 19:37:27,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:27,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 19:37:27,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:37:27,537 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 19:37:27,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:27,719 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2024-09-11 19:37:27,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 19:37:27,720 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2024-09-11 19:37:27,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:27,721 INFO L225 Difference]: With dead ends: 77 [2024-09-11 19:37:27,721 INFO L226 Difference]: Without dead ends: 63 [2024-09-11 19:37:27,721 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-09-11 19:37:27,723 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 15 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:27,723 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 275 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:37:27,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-11 19:37:27,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2024-09-11 19:37:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 42 states have internal predecessors, (48), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-11 19:37:27,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2024-09-11 19:37:27,737 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 38 [2024-09-11 19:37:27,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:27,738 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2024-09-11 19:37:27,738 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 19:37:27,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2024-09-11 19:37:27,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-11 19:37:27,739 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:27,740 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] [2024-09-11 19:37:27,740 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-11 19:37:27,740 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:27,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:27,740 INFO L85 PathProgramCache]: Analyzing trace with hash 161144636, now seen corresponding path program 2 times [2024-09-11 19:37:27,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:27,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285162523] [2024-09-11 19:37:27,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:27,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:28,362 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:28,364 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:37:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:28,398 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:37:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:28,415 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:37:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-11 19:37:28,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:28,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285162523] [2024-09-11 19:37:28,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285162523] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:37:28,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733896769] [2024-09-11 19:37:28,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:37:28,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:37:28,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:37:28,431 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:37:28,433 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-11 19:37:28,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:37:28,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:37:28,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-09-11 19:37:28,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:37:28,665 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-09-11 19:37:28,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 19 [2024-09-11 19:37:28,965 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2024-09-11 19:37:28,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 46 [2024-09-11 19:37:29,216 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-11 19:37:29,216 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:37:29,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 19:37:29,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 515 treesize of output 447 [2024-09-11 19:37:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-11 19:37:31,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733896769] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:37:31,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:37:31,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 33 [2024-09-11 19:37:31,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014971746] [2024-09-11 19:37:31,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:37:31,630 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-11 19:37:31,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:31,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-11 19:37:31,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2024-09-11 19:37:31,632 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 33 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-11 19:37:32,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:32,268 INFO L93 Difference]: Finished difference Result 104 states and 137 transitions. [2024-09-11 19:37:32,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-11 19:37:32,269 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 38 [2024-09-11 19:37:32,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:32,270 INFO L225 Difference]: With dead ends: 104 [2024-09-11 19:37:32,270 INFO L226 Difference]: Without dead ends: 72 [2024-09-11 19:37:32,271 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=239, Invalid=1483, Unknown=0, NotChecked=0, Total=1722 [2024-09-11 19:37:32,271 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 38 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:32,271 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 596 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 19:37:32,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-09-11 19:37:32,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2024-09-11 19:37:32,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 46 states have internal predecessors, (53), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-11 19:37:32,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2024-09-11 19:37:32,280 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 38 [2024-09-11 19:37:32,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:32,280 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2024-09-11 19:37:32,280 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-11 19:37:32,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:32,281 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2024-09-11 19:37:32,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-11 19:37:32,281 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:32,281 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] [2024-09-11 19:37:32,294 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 19:37:32,485 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-11 19:37:32,486 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:32,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:32,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1824005157, now seen corresponding path program 3 times [2024-09-11 19:37:32,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:32,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732846702] [2024-09-11 19:37:32,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:32,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,531 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,533 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:37:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,534 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:37:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,536 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:37:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,537 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-11 19:37:32,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:32,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732846702] [2024-09-11 19:37:32,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732846702] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:37:32,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:37:32,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:37:32,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804120362] [2024-09-11 19:37:32,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:37:32,539 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:37:32,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:32,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:37:32,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:37:32,539 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:37:32,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:32,568 INFO L93 Difference]: Finished difference Result 96 states and 123 transitions. [2024-09-11 19:37:32,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:37:32,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2024-09-11 19:37:32,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:32,569 INFO L225 Difference]: With dead ends: 96 [2024-09-11 19:37:32,570 INFO L226 Difference]: Without dead ends: 62 [2024-09-11 19:37:32,570 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:37:32,572 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:32,572 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 106 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:37:32,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-11 19:37:32,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2024-09-11 19:37:32,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 47 states have internal predecessors, (53), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-11 19:37:32,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2024-09-11 19:37:32,586 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 43 [2024-09-11 19:37:32,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:32,586 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2024-09-11 19:37:32,586 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:37:32,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:32,587 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2024-09-11 19:37:32,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-11 19:37:32,587 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:32,587 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] [2024-09-11 19:37:32,587 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-11 19:37:32,587 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:32,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:32,587 INFO L85 PathProgramCache]: Analyzing trace with hash 956566272, now seen corresponding path program 1 times [2024-09-11 19:37:32,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:32,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070977047] [2024-09-11 19:37:32,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:32,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,728 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,730 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:37:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,732 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:37:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,734 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:37:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,736 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-11 19:37:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,741 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-11 19:37:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,743 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-11 19:37:32,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:32,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070977047] [2024-09-11 19:37:32,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070977047] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:37:32,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:37:32,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-11 19:37:32,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296715983] [2024-09-11 19:37:32,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:37:32,743 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-11 19:37:32,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:32,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-11 19:37:32,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-11 19:37:32,744 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-11 19:37:32,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:32,843 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2024-09-11 19:37:32,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 19:37:32,843 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2024-09-11 19:37:32,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:32,844 INFO L225 Difference]: With dead ends: 78 [2024-09-11 19:37:32,845 INFO L226 Difference]: Without dead ends: 76 [2024-09-11 19:37:32,845 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:37:32,846 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:32,846 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 212 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:37:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-11 19:37:32,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2024-09-11 19:37:32,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 54 states have internal predecessors, (62), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-11 19:37:32,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2024-09-11 19:37:32,861 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 45 [2024-09-11 19:37:32,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:32,861 INFO L474 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2024-09-11 19:37:32,862 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-11 19:37:32,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:32,862 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2024-09-11 19:37:32,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-11 19:37:32,866 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:32,866 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] [2024-09-11 19:37:32,866 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-11 19:37:32,866 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:32,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:32,867 INFO L85 PathProgramCache]: Analyzing trace with hash 958413314, now seen corresponding path program 1 times [2024-09-11 19:37:32,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:32,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410302314] [2024-09-11 19:37:32,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:32,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,980 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,982 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:37:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,983 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:37:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,985 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:37:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,986 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-11 19:37:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,988 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-11 19:37:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,989 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-11 19:37:32,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:32,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410302314] [2024-09-11 19:37:32,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410302314] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:37:32,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:37:32,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:37:32,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758715135] [2024-09-11 19:37:32,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:37:32,990 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:37:32,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:32,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:37:32,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:37:32,992 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-11 19:37:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:33,057 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2024-09-11 19:37:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:37:33,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2024-09-11 19:37:33,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:33,059 INFO L225 Difference]: With dead ends: 88 [2024-09-11 19:37:33,059 INFO L226 Difference]: Without dead ends: 77 [2024-09-11 19:37:33,061 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:37:33,061 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:33,061 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 144 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:37:33,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-09-11 19:37:33,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2024-09-11 19:37:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-11 19:37:33,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2024-09-11 19:37:33,077 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 45 [2024-09-11 19:37:33,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:33,077 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2024-09-11 19:37:33,078 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-11 19:37:33,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:33,078 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2024-09-11 19:37:33,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-11 19:37:33,078 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:33,078 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] [2024-09-11 19:37:33,078 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-11 19:37:33,079 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:33,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:33,079 INFO L85 PathProgramCache]: Analyzing trace with hash 601257606, now seen corresponding path program 1 times [2024-09-11 19:37:33,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:33,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101352862] [2024-09-11 19:37:33,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:33,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:33,242 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:33,244 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:37:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:33,245 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:37:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:33,246 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:37:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:33,247 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-11 19:37:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-09-11 19:37:33,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:33,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101352862] [2024-09-11 19:37:33,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101352862] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:37:33,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307079254] [2024-09-11 19:37:33,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:33,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:37:33,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:37:33,251 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:37:33,252 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-11 19:37:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:33,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-11 19:37:33,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:37:33,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-11 19:37:33,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-09-11 19:37:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 19:37:33,433 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:37:33,471 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-11 19:37:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 19:37:33,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307079254] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:37:33,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:37:33,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 19 [2024-09-11 19:37:33,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514631704] [2024-09-11 19:37:33,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:37:33,587 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-11 19:37:33,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:33,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-11 19:37:33,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-09-11 19:37:33,588 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand has 19 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-11 19:37:33,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:33,844 INFO L93 Difference]: Finished difference Result 92 states and 115 transitions. [2024-09-11 19:37:33,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 19:37:33,845 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2024-09-11 19:37:33,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:33,846 INFO L225 Difference]: With dead ends: 92 [2024-09-11 19:37:33,846 INFO L226 Difference]: Without dead ends: 90 [2024-09-11 19:37:33,846 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2024-09-11 19:37:33,847 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 14 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:33,847 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 413 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:37:33,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-09-11 19:37:33,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2024-09-11 19:37:33,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 59 states have internal predecessors, (67), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-11 19:37:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2024-09-11 19:37:33,860 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 45 [2024-09-11 19:37:33,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:33,861 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2024-09-11 19:37:33,861 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-11 19:37:33,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:33,861 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2024-09-11 19:37:33,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-11 19:37:33,862 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:33,862 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] [2024-09-11 19:37:33,877 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-11 19:37:34,066 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:37:34,067 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:34,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:34,067 INFO L85 PathProgramCache]: Analyzing trace with hash 603104648, now seen corresponding path program 1 times [2024-09-11 19:37:34,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:34,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801267433] [2024-09-11 19:37:34,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:34,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:34,162 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:34,164 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:37:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:34,165 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:37:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:34,166 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:37:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:34,167 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-11 19:37:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:34,168 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-11 19:37:34,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:34,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801267433] [2024-09-11 19:37:34,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801267433] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:37:34,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752757178] [2024-09-11 19:37:34,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:34,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:37:34,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:37:34,174 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:37:34,175 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-11 19:37:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:34,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-11 19:37:34,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:37:34,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-11 19:37:34,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-09-11 19:37:34,390 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-11 19:37:34,390 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:37:34,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752757178] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:37:34,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 19:37:34,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 8 [2024-09-11 19:37:34,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914735455] [2024-09-11 19:37:34,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:37:34,392 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:37:34,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:34,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:37:34,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-09-11 19:37:34,393 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 19:37:38,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:37:42,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:37:46,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:37:46,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:46,546 INFO L93 Difference]: Finished difference Result 116 states and 136 transitions. [2024-09-11 19:37:46,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:37:46,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2024-09-11 19:37:46,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:46,547 INFO L225 Difference]: With dead ends: 116 [2024-09-11 19:37:46,547 INFO L226 Difference]: Without dead ends: 97 [2024-09-11 19:37:46,548 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-11 19:37:46,548 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 12 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:46,548 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 209 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 3 Unknown, 0 Unchecked, 12.1s Time] [2024-09-11 19:37:46,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-09-11 19:37:46,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-09-11 19:37:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.164179104477612) internal successors, (78), 71 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-11 19:37:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2024-09-11 19:37:46,559 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 45 [2024-09-11 19:37:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:46,559 INFO L474 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2024-09-11 19:37:46,559 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 19:37:46,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:46,560 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2024-09-11 19:37:46,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-11 19:37:46,560 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:46,560 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] [2024-09-11 19:37:46,573 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-11 19:37:46,764 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-11 19:37:46,765 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:46,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:46,765 INFO L85 PathProgramCache]: Analyzing trace with hash 753234289, now seen corresponding path program 4 times [2024-09-11 19:37:46,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:46,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545197316] [2024-09-11 19:37:46,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:46,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:47,811 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:47,813 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:37:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:47,815 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:37:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:47,817 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:37:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:47,819 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-09-11 19:37:47,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:47,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545197316] [2024-09-11 19:37:47,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545197316] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:37:47,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841362054] [2024-09-11 19:37:47,819 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-11 19:37:47,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:37:47,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:37:47,821 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:37:47,822 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-11 19:37:47,890 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-11 19:37:47,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:37:47,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-09-11 19:37:47,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:37:47,902 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-11 19:37:48,150 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-11 19:37:48,561 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 75 treesize of output 57 [2024-09-11 19:37:48,618 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-11 19:37:48,618 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:37:48,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841362054] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:37:48,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 19:37:48,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2024-09-11 19:37:48,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171019950] [2024-09-11 19:37:48,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 19:37:48,876 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-11 19:37:48,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:48,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-11 19:37:48,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2024-09-11 19:37:48,878 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand has 22 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-11 19:37:49,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:49,462 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2024-09-11 19:37:49,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 19:37:49,463 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2024-09-11 19:37:49,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:49,467 INFO L225 Difference]: With dead ends: 140 [2024-09-11 19:37:49,467 INFO L226 Difference]: Without dead ends: 85 [2024-09-11 19:37:49,468 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=152, Invalid=718, Unknown=0, NotChecked=0, Total=870 [2024-09-11 19:37:49,468 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 5 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:49,468 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 407 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-11 19:37:49,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-09-11 19:37:49,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2024-09-11 19:37:49,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.103448275862069) internal successors, (64), 61 states have internal predecessors, (64), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-11 19:37:49,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2024-09-11 19:37:49,495 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 45 [2024-09-11 19:37:49,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:49,495 INFO L474 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2024-09-11 19:37:49,495 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-11 19:37:49,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:49,496 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2024-09-11 19:37:49,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-09-11 19:37:49,496 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:49,496 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:37:49,509 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-11 19:37:49,700 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-11 19:37:49,701 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:49,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:49,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1531281429, now seen corresponding path program 1 times [2024-09-11 19:37:49,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:49,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612837960] [2024-09-11 19:37:49,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:49,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:49,888 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:49,889 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:37:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:49,891 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:37:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:49,892 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:37:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:49,894 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-11 19:37:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:49,895 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-11 19:37:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:49,898 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 19:37:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-11 19:37:49,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:49,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612837960] [2024-09-11 19:37:49,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612837960] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:37:49,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:37:49,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-11 19:37:49,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660775798] [2024-09-11 19:37:49,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:37:49,905 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-11 19:37:49,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:49,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-11 19:37:49,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-09-11 19:37:49,905 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-11 19:37:50,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:50,056 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2024-09-11 19:37:50,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 19:37:50,056 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 51 [2024-09-11 19:37:50,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:50,058 INFO L225 Difference]: With dead ends: 90 [2024-09-11 19:37:50,058 INFO L226 Difference]: Without dead ends: 86 [2024-09-11 19:37:50,058 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-09-11 19:37:50,059 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:50,059 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 170 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:37:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-11 19:37:50,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-09-11 19:37:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 62 states have internal predecessors, (65), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-11 19:37:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2024-09-11 19:37:50,073 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 51 [2024-09-11 19:37:50,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:50,073 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2024-09-11 19:37:50,073 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-11 19:37:50,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2024-09-11 19:37:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-09-11 19:37:50,074 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:50,074 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:37:50,074 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-11 19:37:50,074 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:50,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:50,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1681149395, now seen corresponding path program 1 times [2024-09-11 19:37:50,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:50,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277934651] [2024-09-11 19:37:50,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:50,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:50,197 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:50,199 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:37:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:50,200 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:37:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:50,201 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:37:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:50,202 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-11 19:37:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:50,203 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 19:37:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:50,205 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-09-11 19:37:50,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:50,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277934651] [2024-09-11 19:37:50,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277934651] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:37:50,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634569033] [2024-09-11 19:37:50,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:50,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:37:50,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:37:50,209 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:37:50,210 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-11 19:37:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:50,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-11 19:37:50,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:37:50,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-11 19:37:50,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-09-11 19:37:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-09-11 19:37:50,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:37:50,427 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 32 treesize of output 28 [2024-09-11 19:37:50,507 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-09-11 19:37:50,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634569033] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:37:50,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:37:50,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 13 [2024-09-11 19:37:50,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170465793] [2024-09-11 19:37:50,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:37:50,508 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-11 19:37:50,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:50,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-11 19:37:50,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-09-11 19:37:50,509 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-11 19:37:54,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:37:58,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:38:02,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:38:02,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:38:02,698 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2024-09-11 19:38:02,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-11 19:38:02,698 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 52 [2024-09-11 19:38:02,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:38:02,699 INFO L225 Difference]: With dead ends: 98 [2024-09-11 19:38:02,699 INFO L226 Difference]: Without dead ends: 87 [2024-09-11 19:38:02,699 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 107 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-09-11 19:38:02,700 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:38:02,700 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 264 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 193 Invalid, 3 Unknown, 0 Unchecked, 12.1s Time] [2024-09-11 19:38:02,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-11 19:38:02,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-09-11 19:38:02,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 61 states have internal predecessors, (64), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-11 19:38:02,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-09-11 19:38:02,709 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 52 [2024-09-11 19:38:02,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:38:02,710 INFO L474 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-09-11 19:38:02,710 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-11 19:38:02,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:38:02,710 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-09-11 19:38:02,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-09-11 19:38:02,711 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:38:02,711 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:38:02,725 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-11 19:38:02,911 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-11 19:38:02,912 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:38:02,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:38:02,912 INFO L85 PathProgramCache]: Analyzing trace with hash -710336108, now seen corresponding path program 1 times [2024-09-11 19:38:02,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:38:02,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256101446] [2024-09-11 19:38:02,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:38:02,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:38:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:03,188 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:38:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:03,189 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:38:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:03,191 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:38:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:03,192 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:38:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:03,194 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-11 19:38:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:03,195 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-11 19:38:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:03,197 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 19:38:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:03,199 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-11 19:38:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:03,201 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-09-11 19:38:03,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:38:03,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256101446] [2024-09-11 19:38:03,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256101446] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:38:03,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:38:03,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-11 19:38:03,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006753393] [2024-09-11 19:38:03,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:38:03,202 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-11 19:38:03,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:38:03,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-11 19:38:03,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-09-11 19:38:03,203 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-11 19:38:03,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:38:03,337 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2024-09-11 19:38:03,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 19:38:03,337 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 57 [2024-09-11 19:38:03,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:38:03,338 INFO L225 Difference]: With dead ends: 87 [2024-09-11 19:38:03,338 INFO L226 Difference]: Without dead ends: 55 [2024-09-11 19:38:03,338 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-09-11 19:38:03,339 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 14 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:38:03,339 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 147 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:38:03,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-11 19:38:03,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-09-11 19:38:03,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 19:38:03,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2024-09-11 19:38:03,351 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 57 [2024-09-11 19:38:03,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:38:03,352 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2024-09-11 19:38:03,352 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-11 19:38:03,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:38:03,352 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2024-09-11 19:38:03,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-11 19:38:03,353 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:38:03,353 INFO L216 NwaCegarLoop]: trace histogram [4, 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] [2024-09-11 19:38:03,353 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-11 19:38:03,353 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:38:03,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:38:03,353 INFO L85 PathProgramCache]: Analyzing trace with hash -375919658, now seen corresponding path program 1 times [2024-09-11 19:38:03,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:38:03,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286056674] [2024-09-11 19:38:03,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:38:03,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:38:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:03,514 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:38:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:03,517 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:38:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:03,518 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:38:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:03,518 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:38:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:03,519 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-11 19:38:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:03,521 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 19:38:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:03,522 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-11 19:38:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-09-11 19:38:03,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:38:03,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286056674] [2024-09-11 19:38:03,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286056674] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:38:03,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:38:03,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-11 19:38:03,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754034306] [2024-09-11 19:38:03,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:38:03,525 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-11 19:38:03,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:38:03,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-11 19:38:03,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-09-11 19:38:03,526 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-11 19:38:03,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:38:03,615 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2024-09-11 19:38:03,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 19:38:03,615 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-09-11 19:38:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:38:03,616 INFO L225 Difference]: With dead ends: 61 [2024-09-11 19:38:03,616 INFO L226 Difference]: Without dead ends: 57 [2024-09-11 19:38:03,616 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-09-11 19:38:03,616 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 9 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:38:03,617 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 166 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:38:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-11 19:38:03,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-09-11 19:38:03,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 19:38:03,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2024-09-11 19:38:03,625 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 58 [2024-09-11 19:38:03,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:38:03,625 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2024-09-11 19:38:03,625 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-11 19:38:03,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:38:03,625 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2024-09-11 19:38:03,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-09-11 19:38:03,626 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:38:03,626 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:38:03,626 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-11 19:38:03,626 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:38:03,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:38:03,626 INFO L85 PathProgramCache]: Analyzing trace with hash 182628671, now seen corresponding path program 1 times [2024-09-11 19:38:03,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:38:03,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972213302] [2024-09-11 19:38:03,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:38:03,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:38:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:13,897 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:38:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:13,900 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:38:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:13,902 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:38:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:13,904 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:38:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:13,906 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-11 19:38:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:13,950 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 19:38:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:13,975 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-11 19:38:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:14,002 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-11 19:38:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-09-11 19:38:14,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:38:14,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972213302] [2024-09-11 19:38:14,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972213302] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:38:14,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36365272] [2024-09-11 19:38:14,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:38:14,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:38:14,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:38:14,027 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:38:14,028 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-11 19:38:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:14,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-09-11 19:38:14,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:38:14,135 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-11 19:38:14,528 INFO L349 Elim1Store]: treesize reduction 49, result has 15.5 percent of original size [2024-09-11 19:38:14,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 53 [2024-09-11 19:38:14,557 INFO L349 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2024-09-11 19:38:14,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2024-09-11 19:38:25,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-11 19:38:25,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-11 19:39:24,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 19:39:24,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 316 treesize of output 342 [2024-09-11 19:39:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 13 proven. 33 refuted. 8 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 19:39:24,490 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:39:24,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2024-09-11 19:39:24,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 130 [2024-09-11 19:39:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-09-11 19:39:28,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36365272] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:39:28,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:39:28,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 26, 18] total 52 [2024-09-11 19:39:28,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960049711] [2024-09-11 19:39:28,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:39:28,393 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-09-11 19:39:28,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:39:28,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-09-11 19:39:28,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=2380, Unknown=11, NotChecked=0, Total=2652 [2024-09-11 19:39:28,395 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 52 states, 48 states have (on average 1.8125) internal successors, (87), 49 states have internal predecessors, (87), 11 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 7 states have call predecessors, (22), 10 states have call successors, (22) [2024-09-11 19:39:38,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:39:42,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:39:51,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:39:59,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:40:07,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:40:12,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:40:16,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:40:29,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:40:33,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:40:37,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:40:41,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:40:45,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:40:49,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:40:53,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:41:03,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:41:07,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:41:12,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:41:16,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:41:20,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 19:41:20,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:41:20,768 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2024-09-11 19:41:20,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-11 19:41:20,769 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 48 states have (on average 1.8125) internal successors, (87), 49 states have internal predecessors, (87), 11 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 7 states have call predecessors, (22), 10 states have call successors, (22) Word has length 64 [2024-09-11 19:41:20,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:41:20,769 INFO L225 Difference]: With dead ends: 60 [2024-09-11 19:41:20,769 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 19:41:20,771 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 107 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1267 ImplicationChecksByTransitivity, 101.7s TimeCoverageRelationStatistics Valid=531, Invalid=4562, Unknown=19, NotChecked=0, Total=5112 [2024-09-11 19:41:20,771 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 10 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 80.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 80.9s IncrementalHoareTripleChecker+Time [2024-09-11 19:41:20,771 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 229 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 897 Invalid, 19 Unknown, 0 Unchecked, 80.9s Time] [2024-09-11 19:41:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 19:41:20,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 19:41:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:41:20,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 19:41:20,772 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2024-09-11 19:41:20,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:41:20,772 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 19:41:20,772 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 48 states have (on average 1.8125) internal successors, (87), 49 states have internal predecessors, (87), 11 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 7 states have call predecessors, (22), 10 states have call successors, (22) [2024-09-11 19:41:20,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:41:20,773 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 19:41:20,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 19:41:20,780 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 19:41:20,802 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-11 19:41:20,981 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:41:20,985 INFO L408 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:41:20,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 19:41:33,299 WARN L293 SmtUtils]: Spent 12.15s on a formula simplification. DAG size of input: 97 DAG size of output: 60 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter)