./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/insertion_sort-2-2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version de325976 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/loops/insertion_sort-2-2.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 f08b02f494e898be2e8c5098de245f701022f3f8b39ac6682b3bca3a03512826 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-de32597-m [2024-09-18 15:30:51,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-18 15:30:51,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-18 15:30:51,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-18 15:30:51,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-18 15:30:51,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-18 15:30:51,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-18 15:30:51,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-18 15:30:51,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-18 15:30:51,105 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-18 15:30:51,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-18 15:30:51,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-18 15:30:51,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-18 15:30:51,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-18 15:30:51,109 INFO L153 SettingsManager]: * Use SBE=true [2024-09-18 15:30:51,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-18 15:30:51,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-18 15:30:51,109 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-18 15:30:51,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-18 15:30:51,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-18 15:30:51,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-18 15:30:51,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-18 15:30:51,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-18 15:30:51,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-18 15:30:51,114 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-18 15:30:51,115 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-18 15:30:51,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-18 15:30:51,115 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-18 15:30:51,115 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-18 15:30:51,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-18 15:30:51,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-18 15:30:51,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-18 15:30:51,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-18 15:30:51,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-18 15:30:51,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-18 15:30:51,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-18 15:30:51,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-18 15:30:51,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-18 15:30:51,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-18 15:30:51,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-18 15:30:51,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-18 15:30:51,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-18 15:30:51,118 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 -> f08b02f494e898be2e8c5098de245f701022f3f8b39ac6682b3bca3a03512826 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-18 15:30:51,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-18 15:30:51,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-18 15:30:51,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-18 15:30:51,366 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-18 15:30:51,366 INFO L274 PluginConnector]: CDTParser initialized [2024-09-18 15:30:51,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops/insertion_sort-2-2.c [2024-09-18 15:30:52,620 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-18 15:30:52,786 INFO L384 CDTParser]: Found 1 translation units. [2024-09-18 15:30:52,786 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/insertion_sort-2-2.c [2024-09-18 15:30:52,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/81dda7a2e/7ee61652bba94d0b997441c30bb10219/FLAG1c2476a32 [2024-09-18 15:30:53,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/81dda7a2e/7ee61652bba94d0b997441c30bb10219 [2024-09-18 15:30:53,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-18 15:30:53,208 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-18 15:30:53,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-18 15:30:53,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-18 15:30:53,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-18 15:30:53,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 03:30:53" (1/1) ... [2024-09-18 15:30:53,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bdc9359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:30:53, skipping insertion in model container [2024-09-18 15:30:53,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 03:30:53" (1/1) ... [2024-09-18 15:30:53,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-18 15:30:53,370 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/insertion_sort-2-2.c[330,343] [2024-09-18 15:30:53,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-18 15:30:53,397 INFO L200 MainTranslator]: Completed pre-run [2024-09-18 15:30:53,405 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/insertion_sort-2-2.c[330,343] [2024-09-18 15:30:53,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-18 15:30:53,425 INFO L204 MainTranslator]: Completed translation [2024-09-18 15:30:53,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:30:53 WrapperNode [2024-09-18 15:30:53,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-18 15:30:53,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-18 15:30:53,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-18 15:30:53,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-18 15:30:53,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:30:53" (1/1) ... [2024-09-18 15:30:53,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:30:53" (1/1) ... [2024-09-18 15:30:53,451 INFO L138 Inliner]: procedures = 15, calls = 19, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-18 15:30:53,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-18 15:30:53,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-18 15:30:53,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-18 15:30:53,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-18 15:30:53,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:30:53" (1/1) ... [2024-09-18 15:30:53,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:30:53" (1/1) ... [2024-09-18 15:30:53,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:30:53" (1/1) ... [2024-09-18 15:30:53,480 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-09-18 15:30:53,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:30:53" (1/1) ... [2024-09-18 15:30:53,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:30:53" (1/1) ... [2024-09-18 15:30:53,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:30:53" (1/1) ... [2024-09-18 15:30:53,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:30:53" (1/1) ... [2024-09-18 15:30:53,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:30:53" (1/1) ... [2024-09-18 15:30:53,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:30:53" (1/1) ... [2024-09-18 15:30:53,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-18 15:30:53,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-18 15:30:53,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-18 15:30:53,504 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-18 15:30:53,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:30:53" (1/1) ... [2024-09-18 15:30:53,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-18 15:30:53,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:30:53,530 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-18 15:30:53,533 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-18 15:30:53,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-18 15:30:53,585 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-18 15:30:53,585 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-18 15:30:53,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-18 15:30:53,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-18 15:30:53,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-18 15:30:53,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-18 15:30:53,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-18 15:30:53,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-18 15:30:53,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-18 15:30:53,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-18 15:30:53,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-18 15:30:53,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-18 15:30:53,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-18 15:30:53,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-18 15:30:53,586 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-18 15:30:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-18 15:30:53,640 INFO L242 CfgBuilder]: Building ICFG [2024-09-18 15:30:53,642 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-18 15:30:53,822 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-09-18 15:30:53,822 INFO L291 CfgBuilder]: Performing block encoding [2024-09-18 15:30:53,848 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-18 15:30:53,848 INFO L318 CfgBuilder]: Removed 4 assume(true) statements. [2024-09-18 15:30:53,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 03:30:53 BoogieIcfgContainer [2024-09-18 15:30:53,849 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-18 15:30:53,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-18 15:30:53,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-18 15:30:53,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-18 15:30:53,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.09 03:30:53" (1/3) ... [2024-09-18 15:30:53,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32276aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 03:30:53, skipping insertion in model container [2024-09-18 15:30:53,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:30:53" (2/3) ... [2024-09-18 15:30:53,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32276aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 03:30:53, skipping insertion in model container [2024-09-18 15:30:53,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 03:30:53" (3/3) ... [2024-09-18 15:30:53,855 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort-2-2.c [2024-09-18 15:30:53,867 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-18 15:30:53,868 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-18 15:30:53,905 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-18 15:30:53,912 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;@7f8bbf0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-18 15:30:53,912 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-18 15:30:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-18 15:30:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-18 15:30:53,922 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:30:53,922 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:30:53,923 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:30:53,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:30:53,927 INFO L85 PathProgramCache]: Analyzing trace with hash 921479043, now seen corresponding path program 1 times [2024-09-18 15:30:53,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:30:53,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039092371] [2024-09-18 15:30:53,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:30:53,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:30:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:30:54,078 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:30:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:30:54,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-18 15:30:54,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:30:54,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039092371] [2024-09-18 15:30:54,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039092371] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:30:54,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:30:54,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-18 15:30:54,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887173162] [2024-09-18 15:30:54,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:30:54,105 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-18 15:30:54,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:30:54,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-18 15:30:54,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-18 15:30:54,136 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:30:54,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:30:54,159 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2024-09-18 15:30:54,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-18 15:30:54,164 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-18 15:30:54,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:30:54,170 INFO L225 Difference]: With dead ends: 49 [2024-09-18 15:30:54,170 INFO L226 Difference]: Without dead ends: 23 [2024-09-18 15:30:54,173 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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-18 15:30:54,177 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-18 15:30:54,178 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-18 15:30:54,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-18 15:30:54,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-18 15:30:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-18 15:30:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-09-18 15:30:54,211 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2024-09-18 15:30:54,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:30:54,211 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-09-18 15:30:54,212 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:30:54,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:30:54,212 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-09-18 15:30:54,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-18 15:30:54,213 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:30:54,213 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:30:54,214 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-18 15:30:54,214 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:30:54,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:30:54,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1576012003, now seen corresponding path program 1 times [2024-09-18 15:30:54,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:30:54,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188142353] [2024-09-18 15:30:54,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:30:54,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:30:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:30:54,483 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:30:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:30:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-18 15:30:54,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:30:54,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188142353] [2024-09-18 15:30:54,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188142353] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:30:54,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:30:54,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-18 15:30:54,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40878925] [2024-09-18 15:30:54,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:30:54,490 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 15:30:54,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:30:54,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 15:30:54,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-18 15:30:54,491 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:30:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:30:54,531 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-09-18 15:30:54,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-18 15:30:54,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-18 15:30:54,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:30:54,533 INFO L225 Difference]: With dead ends: 43 [2024-09-18 15:30:54,533 INFO L226 Difference]: Without dead ends: 24 [2024-09-18 15:30:54,533 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-18 15:30:54,538 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-18 15:30:54,538 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-18 15:30:54,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-18 15:30:54,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-18 15:30:54,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-18 15:30:54,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-09-18 15:30:54,542 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2024-09-18 15:30:54,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:30:54,543 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-09-18 15:30:54,543 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:30:54,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:30:54,543 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-09-18 15:30:54,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-18 15:30:54,544 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:30:54,544 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:30:54,544 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-18 15:30:54,544 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:30:54,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:30:54,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1045249472, now seen corresponding path program 1 times [2024-09-18 15:30:54,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:30:54,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174606499] [2024-09-18 15:30:54,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:30:54,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:30:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:30:54,709 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:30:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:30:54,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-18 15:30:54,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:30:54,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174606499] [2024-09-18 15:30:54,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174606499] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 15:30:54,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245394135] [2024-09-18 15:30:54,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:30:54,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:30:54,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:30:54,717 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-18 15:30:54,718 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-18 15:30:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:30:54,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-18 15:30:54,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:30:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-18 15:30:54,819 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-18 15:30:54,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245394135] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:30:54,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-18 15:30:54,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-09-18 15:30:54,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259745669] [2024-09-18 15:30:54,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:30:54,820 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 15:30:54,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:30:54,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 15:30:54,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:30:54,821 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:30:54,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:30:54,844 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-09-18 15:30:54,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-18 15:30:54,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-18 15:30:54,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:30:54,845 INFO L225 Difference]: With dead ends: 40 [2024-09-18 15:30:54,845 INFO L226 Difference]: Without dead ends: 29 [2024-09-18 15:30:54,845 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:30:54,846 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-18 15:30:54,846 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 59 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-18 15:30:54,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-18 15:30:54,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2024-09-18 15:30:54,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-18 15:30:54,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-09-18 15:30:54,850 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2024-09-18 15:30:54,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:30:54,850 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-09-18 15:30:54,850 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:30:54,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:30:54,851 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-09-18 15:30:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-18 15:30:54,851 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:30:54,851 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:30:54,867 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-18 15:30:55,051 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:30:55,053 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:30:55,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:30:55,054 INFO L85 PathProgramCache]: Analyzing trace with hash 530421245, now seen corresponding path program 1 times [2024-09-18 15:30:55,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:30:55,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058152057] [2024-09-18 15:30:55,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:30:55,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:30:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:30:55,195 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:30:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:30:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-18 15:30:55,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:30:55,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058152057] [2024-09-18 15:30:55,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058152057] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 15:30:55,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370935050] [2024-09-18 15:30:55,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:30:55,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:30:55,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:30:55,204 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-18 15:30:55,206 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-18 15:30:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:30:55,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-18 15:30:55,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:30:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-18 15:30:55,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:30:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-18 15:30:55,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370935050] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 15:30:55,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-18 15:30:55,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-09-18 15:30:55,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192269701] [2024-09-18 15:30:55,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-18 15:30:55,455 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-18 15:30:55,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:30:55,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-18 15:30:55,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-09-18 15:30:55,456 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:30:55,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:30:55,510 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2024-09-18 15:30:55,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-18 15:30:55,512 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-18 15:30:55,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:30:55,512 INFO L225 Difference]: With dead ends: 47 [2024-09-18 15:30:55,513 INFO L226 Difference]: Without dead ends: 30 [2024-09-18 15:30:55,513 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-09-18 15:30:55,514 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-18 15:30:55,514 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-18 15:30:55,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-18 15:30:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-09-18 15:30:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-18 15:30:55,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-09-18 15:30:55,522 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 21 [2024-09-18 15:30:55,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:30:55,522 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-09-18 15:30:55,522 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:30:55,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:30:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-09-18 15:30:55,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-18 15:30:55,524 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:30:55,524 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:30:55,538 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-18 15:30:55,725 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:30:55,725 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:30:55,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:30:55,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1034611302, now seen corresponding path program 2 times [2024-09-18 15:30:55,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:30:55,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004881385] [2024-09-18 15:30:55,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:30:55,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:30:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:30:56,230 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:30:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:30:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-18 15:30:56,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:30:56,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004881385] [2024-09-18 15:30:56,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004881385] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 15:30:56,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911524900] [2024-09-18 15:30:56,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-18 15:30:56,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:30:56,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:30:56,239 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-18 15:30:56,243 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-18 15:30:56,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-18 15:30:56,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-18 15:30:56,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-18 15:30:56,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:30:56,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-09-18 15:30:56,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-18 15:30:56,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-09-18 15:30:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-18 15:30:56,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:30:56,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 43 treesize of output 37 [2024-09-18 15:30:56,577 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-09-18 15:30:56,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 66 [2024-09-18 15:30:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-18 15:30:56,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911524900] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 15:30:56,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-18 15:30:56,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 23 [2024-09-18 15:30:56,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387478992] [2024-09-18 15:30:56,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-18 15:30:56,636 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-18 15:30:56,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:30:56,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-18 15:30:56,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2024-09-18 15:30:56,637 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:30:57,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:30:57,096 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2024-09-18 15:30:57,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-18 15:30:57,097 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-18 15:30:57,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:30:57,098 INFO L225 Difference]: With dead ends: 76 [2024-09-18 15:30:57,099 INFO L226 Difference]: Without dead ends: 61 [2024-09-18 15:30:57,099 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2024-09-18 15:30:57,100 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 75 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-18 15:30:57,100 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 169 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-18 15:30:57,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-18 15:30:57,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 44. [2024-09-18 15:30:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-18 15:30:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2024-09-18 15:30:57,117 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 22 [2024-09-18 15:30:57,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:30:57,117 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2024-09-18 15:30:57,117 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:30:57,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:30:57,118 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2024-09-18 15:30:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-18 15:30:57,118 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:30:57,118 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:30:57,131 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-18 15:30:57,323 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:30:57,324 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:30:57,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:30:57,324 INFO L85 PathProgramCache]: Analyzing trace with hash -78593507, now seen corresponding path program 1 times [2024-09-18 15:30:57,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:30:57,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700376187] [2024-09-18 15:30:57,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:30:57,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:30:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:30:57,874 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:30:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:30:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-18 15:30:57,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:30:57,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700376187] [2024-09-18 15:30:57,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700376187] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 15:30:57,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994689239] [2024-09-18 15:30:57,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:30:57,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:30:57,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:30:57,882 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-18 15:30:57,883 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-18 15:30:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:30:57,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-18 15:30:57,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:30:58,036 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 42 treesize of output 22 [2024-09-18 15:30:58,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-18 15:30:58,190 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 1 case distinctions, treesize of input 42 treesize of output 22 [2024-09-18 15:30:58,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-18 15:30:58,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2024-09-18 15:30:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-18 15:30:58,324 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:30:58,708 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 64 treesize of output 56 [2024-09-18 15:30:58,724 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-09-18 15:30:58,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 334 treesize of output 282 [2024-09-18 15:30:58,822 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-18 15:30:58,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994689239] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 15:30:58,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-18 15:30:58,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 32 [2024-09-18 15:30:58,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825790600] [2024-09-18 15:30:58,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-18 15:30:58,823 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-18 15:30:58,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:30:58,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-18 15:30:58,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2024-09-18 15:30:58,824 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:31:00,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:31:00,341 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2024-09-18 15:31:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-18 15:31:00,342 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-09-18 15:31:00,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:31:00,343 INFO L225 Difference]: With dead ends: 107 [2024-09-18 15:31:00,343 INFO L226 Difference]: Without dead ends: 76 [2024-09-18 15:31:00,345 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=375, Invalid=2487, Unknown=0, NotChecked=0, Total=2862 [2024-09-18 15:31:00,345 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 74 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-18 15:31:00,345 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 253 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-18 15:31:00,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-18 15:31:00,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 38. [2024-09-18 15:31:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-18 15:31:00,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-09-18 15:31:00,353 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 25 [2024-09-18 15:31:00,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:31:00,353 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-09-18 15:31:00,353 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-18 15:31:00,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:31:00,353 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-09-18 15:31:00,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-18 15:31:00,354 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:31:00,354 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-18 15:31:00,367 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-18 15:31:00,554 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:31:00,555 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:31:00,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:31:00,556 INFO L85 PathProgramCache]: Analyzing trace with hash -80162640, now seen corresponding path program 1 times [2024-09-18 15:31:00,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:31:00,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434224926] [2024-09-18 15:31:00,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:31:00,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:31:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:31:00,663 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:31:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:31:00,665 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-18 15:31:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:31:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-18 15:31:00,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:31:00,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434224926] [2024-09-18 15:31:00,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434224926] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 15:31:00,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900764004] [2024-09-18 15:31:00,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:31:00,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:31:00,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:31:00,671 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-18 15:31:00,672 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-18 15:31:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:31:00,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-18 15:31:00,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:31:00,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-18 15:31:00,774 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:31:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-18 15:31:00,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900764004] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 15:31:00,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-18 15:31:00,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-09-18 15:31:00,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182093196] [2024-09-18 15:31:00,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-18 15:31:00,889 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-18 15:31:00,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:31:00,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-18 15:31:00,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-09-18 15:31:00,890 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-18 15:31:01,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:31:01,048 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2024-09-18 15:31:01,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-18 15:31:01,049 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2024-09-18 15:31:01,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:31:01,050 INFO L225 Difference]: With dead ends: 81 [2024-09-18 15:31:01,050 INFO L226 Difference]: Without dead ends: 45 [2024-09-18 15:31:01,051 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-09-18 15:31:01,052 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 44 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:31:01,052 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 207 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:31:01,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-18 15:31:01,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2024-09-18 15:31:01,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-18 15:31:01,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-09-18 15:31:01,067 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 29 [2024-09-18 15:31:01,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:31:01,068 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-09-18 15:31:01,068 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-18 15:31:01,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:31:01,068 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-09-18 15:31:01,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-18 15:31:01,069 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:31:01,069 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:31:01,082 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-18 15:31:01,269 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-18 15:31:01,270 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:31:01,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:31:01,270 INFO L85 PathProgramCache]: Analyzing trace with hash 485904074, now seen corresponding path program 2 times [2024-09-18 15:31:01,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:31:01,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480790011] [2024-09-18 15:31:01,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:31:01,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:31:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:31:01,857 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:31:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:31:01,859 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-18 15:31:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:31:01,863 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-18 15:31:01,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:31:01,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480790011] [2024-09-18 15:31:01,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480790011] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 15:31:01,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103244399] [2024-09-18 15:31:01,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-18 15:31:01,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:31:01,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:31:01,865 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-18 15:31:01,866 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-18 15:31:01,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-18 15:31:01,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-18 15:31:01,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-18 15:31:01,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:31:02,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-09-18 15:31:02,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-18 15:31:02,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-09-18 15:31:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-18 15:31:02,246 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:31:10,386 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 45 treesize of output 39 [2024-09-18 15:31:10,398 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-09-18 15:31:10,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 58 [2024-09-18 15:31:10,416 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-18 15:31:10,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103244399] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 15:31:10,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-18 15:31:10,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 13] total 31 [2024-09-18 15:31:10,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182961399] [2024-09-18 15:31:10,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-18 15:31:10,416 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-09-18 15:31:10,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:31:10,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-09-18 15:31:10,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=823, Unknown=2, NotChecked=0, Total=930 [2024-09-18 15:31:10,418 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 29 states have internal predecessors, (68), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-18 15:31:14,441 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-18 15:31:18,455 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-18 15:31:22,472 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-18 15:31:26,496 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-18 15:31:30,562 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-18 15:31:34,579 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-18 15:31:38,714 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-18 15:31:42,872 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-18 15:31:46,896 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-18 15:31:50,932 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-18 15:31:54,968 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-18 15:31:58,985 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-18 15:32:02,997 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-18 15:32:07,004 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-18 15:32:11,019 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-18 15:32:11,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:32:11,166 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2024-09-18 15:32:11,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-18 15:32:11,167 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 29 states have internal predecessors, (68), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 35 [2024-09-18 15:32:11,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:32:11,169 INFO L225 Difference]: With dead ends: 89 [2024-09-18 15:32:11,169 INFO L226 Difference]: Without dead ends: 87 [2024-09-18 15:32:11,172 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=222, Invalid=1668, Unknown=2, NotChecked=0, Total=1892 [2024-09-18 15:32:11,172 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 83 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 21 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.5s IncrementalHoareTripleChecker+Time [2024-09-18 15:32:11,173 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 438 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 738 Invalid, 15 Unknown, 0 Unchecked, 60.5s Time] [2024-09-18 15:32:11,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-18 15:32:11,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2024-09-18 15:32:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 50 states have internal predecessors, (61), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-18 15:32:11,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2024-09-18 15:32:11,191 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 35 [2024-09-18 15:32:11,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:32:11,192 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2024-09-18 15:32:11,192 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 29 states have internal predecessors, (68), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-18 15:32:11,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:32:11,192 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2024-09-18 15:32:11,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-18 15:32:11,195 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:32:11,195 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:32:11,212 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-18 15:32:11,395 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:32:11,396 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:32:11,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:32:11,397 INFO L85 PathProgramCache]: Analyzing trace with hash -178294159, now seen corresponding path program 1 times [2024-09-18 15:32:11,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:32:11,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626715931] [2024-09-18 15:32:11,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:32:11,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:32:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:32:12,001 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:32:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:32:12,004 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-18 15:32:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:32:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-18 15:32:12,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:32:12,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626715931] [2024-09-18 15:32:12,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626715931] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 15:32:12,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427060417] [2024-09-18 15:32:12,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:32:12,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:32:12,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:32:12,010 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-18 15:32:12,011 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-18 15:32:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:32:12,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-09-18 15:32:12,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:32:12,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-09-18 15:32:12,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-18 15:32:12,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 20 [2024-09-18 15:32:12,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-18 15:32:12,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2024-09-18 15:32:12,600 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-18 15:32:12,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:32:12,904 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 74 treesize of output 66 [2024-09-18 15:32:12,923 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-09-18 15:32:12,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 494 treesize of output 426 [2024-09-18 15:32:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-18 15:32:13,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427060417] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 15:32:13,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-18 15:32:13,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 15] total 44 [2024-09-18 15:32:13,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453683970] [2024-09-18 15:32:13,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-18 15:32:13,073 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-09-18 15:32:13,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:32:13,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-09-18 15:32:13,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1705, Unknown=0, NotChecked=0, Total=1892 [2024-09-18 15:32:13,075 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 44 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 41 states have internal predecessors, (82), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-18 15:32:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:32:14,930 INFO L93 Difference]: Finished difference Result 166 states and 206 transitions. [2024-09-18 15:32:14,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-09-18 15:32:14,934 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 41 states have internal predecessors, (82), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 38 [2024-09-18 15:32:14,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:32:14,938 INFO L225 Difference]: With dead ends: 166 [2024-09-18 15:32:14,938 INFO L226 Difference]: Without dead ends: 130 [2024-09-18 15:32:14,942 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1741 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=657, Invalid=5663, Unknown=0, NotChecked=0, Total=6320 [2024-09-18 15:32:14,945 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 115 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-18 15:32:14,946 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 567 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-18 15:32:14,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-09-18 15:32:14,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 93. [2024-09-18 15:32:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 81 states have internal predecessors, (100), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-18 15:32:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2024-09-18 15:32:14,978 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 38 [2024-09-18 15:32:14,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:32:14,978 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2024-09-18 15:32:14,979 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 41 states have internal predecessors, (82), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-18 15:32:14,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:32:14,979 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2024-09-18 15:32:14,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-18 15:32:14,980 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:32:14,980 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:32:14,993 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-18 15:32:15,181 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:32:15,182 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:32:15,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:32:15,182 INFO L85 PathProgramCache]: Analyzing trace with hash 917365120, now seen corresponding path program 3 times [2024-09-18 15:32:15,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:32:15,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943618571] [2024-09-18 15:32:15,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:32:15,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:32:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:32:15,340 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:32:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:32:15,341 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-18 15:32:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:32:15,344 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-18 15:32:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:32:15,346 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-18 15:32:15,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:32:15,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943618571] [2024-09-18 15:32:15,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943618571] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 15:32:15,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654521791] [2024-09-18 15:32:15,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-18 15:32:15,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:32:15,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:32:15,348 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-18 15:32:15,349 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-18 15:32:15,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-18 15:32:15,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-18 15:32:15,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-18 15:32:15,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:32:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-18 15:32:15,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:32:15,685 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-18 15:32:15,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654521791] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 15:32:15,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-18 15:32:15,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2024-09-18 15:32:15,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668608387] [2024-09-18 15:32:15,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-18 15:32:15,686 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-18 15:32:15,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:32:15,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-18 15:32:15,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-09-18 15:32:15,687 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-18 15:32:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:32:15,870 INFO L93 Difference]: Finished difference Result 212 states and 275 transitions. [2024-09-18 15:32:15,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-18 15:32:15,870 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2024-09-18 15:32:15,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:32:15,871 INFO L225 Difference]: With dead ends: 212 [2024-09-18 15:32:15,871 INFO L226 Difference]: Without dead ends: 135 [2024-09-18 15:32:15,872 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-09-18 15:32:15,872 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:32:15,872 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 340 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:32:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-09-18 15:32:15,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 118. [2024-09-18 15:32:15,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 103 states have (on average 1.2524271844660195) internal successors, (129), 106 states have internal predecessors, (129), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-18 15:32:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 145 transitions. [2024-09-18 15:32:15,898 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 145 transitions. Word has length 42 [2024-09-18 15:32:15,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:32:15,899 INFO L474 AbstractCegarLoop]: Abstraction has 118 states and 145 transitions. [2024-09-18 15:32:15,899 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-18 15:32:15,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:32:15,899 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 145 transitions. [2024-09-18 15:32:15,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-18 15:32:15,900 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:32:15,900 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:32:15,912 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-18 15:32:16,100 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:32:16,101 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:32:16,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:32:16,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1981868692, now seen corresponding path program 1 times [2024-09-18 15:32:16,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:32:16,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361811942] [2024-09-18 15:32:16,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:32:16,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:32:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:32:17,461 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:32:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:32:17,464 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-18 15:32:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:32:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-18 15:32:17,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:32:17,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361811942] [2024-09-18 15:32:17,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361811942] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 15:32:17,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349730932] [2024-09-18 15:32:17,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:32:17,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:32:17,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:32:17,471 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-18 15:32:17,472 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-18 15:32:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:32:17,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-18 15:32:17,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:32:17,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-09-18 15:32:17,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-18 15:32:17,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-09-18 15:32:17,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-18 15:32:17,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 28 [2024-09-18 15:32:17,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-18 15:32:17,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-18 15:32:17,935 INFO L349 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2024-09-18 15:32:17,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 34 [2024-09-18 15:32:26,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-18 15:32:26,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-09-18 15:32:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-18 15:32:26,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:32:26,846 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 114 treesize of output 104 [2024-09-18 15:32:26,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-18 15:32:26,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3498 treesize of output 3289 [2024-09-18 15:32:32,250 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-18 15:32:32,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349730932] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 15:32:32,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-18 15:32:32,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 20] total 52 [2024-09-18 15:32:32,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665905029] [2024-09-18 15:32:32,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-18 15:32:32,251 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-09-18 15:32:32,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:32:32,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-09-18 15:32:32,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=2360, Unknown=2, NotChecked=0, Total=2652 [2024-09-18 15:32:32,253 INFO L87 Difference]: Start difference. First operand 118 states and 145 transitions. Second operand has 52 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 49 states have internal predecessors, (83), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-18 15:32:36,292 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-18 15:32:40,317 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-18 15:32:44,344 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-18 15:32:48,378 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-18 15:32:52,496 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-18 15:32:56,570 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-18 15:33:00,894 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-18 15:33:13,473 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-18 15:33:17,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 [1] [2024-09-18 15:33:21,598 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 [1] [2024-09-18 15:33:25,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-18 15:33:29,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-18 15:33:33,683 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 [1] [2024-09-18 15:33:37,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-18 15:33:41,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-18 15:33:45,754 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 [1] [2024-09-18 15:33:49,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-18 15:33:53,844 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int#1| |c_main_~#v~0.base|)) (.cse5 (* c_main_~i~0 4)) (.cse2 (= c_main_~i~0 0)) (.cse0 (= 2 c_main_~j~0)) (.cse1 (not |c_main_#t~short9|))) (and .cse0 (or .cse1 (and .cse2 (<= (select .cse3 0) (select .cse3 8)))) (forall ((main_~key~0 Int)) (let ((.cse4 (store .cse3 (+ .cse5 |c_main_~#v~0.offset| 4) main_~key~0))) (< (select .cse4 (+ |c_main_~#v~0.offset| 4)) (+ 1 (select .cse4 (+ |c_main_~#v~0.offset| 8)))))) (exists ((|v_main_~#v~0.base_BEFORE_CALL_5| Int)) (let ((.cse6 (select |c_#memory_int#1| |v_main_~#v~0.base_BEFORE_CALL_5|))) (<= (select .cse6 4) (select .cse6 8)))) (let ((.cse7 (store .cse3 (+ .cse5 4) c_main_~key~0))) (<= (select .cse7 4) (select .cse7 8))) (or (let ((.cse8 (= c_main_~j~0 1))) (and (or .cse2 (not .cse8)) (or .cse8 (= c_main_~i~0 1)) (not .cse0))) .cse1 (< c_main_~j~0 1)) (= |c_main_~#v~0.offset| 0))) is different from false [2024-09-18 15:34:38,700 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 [1] [2024-09-18 15:34:42,714 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 [1] [2024-09-18 15:34:46,729 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 [1] [2024-09-18 15:34:50,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-18 15:34:54,771 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 [1] [2024-09-18 15:34:58,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-18 15:35:02,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-18 15:35:06,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-18 15:35:10,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-18 15:35:14,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-18 15:35:18,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]