./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 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/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 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-12 20:58:36,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 20:58:36,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 20:58:36,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 20:58:36,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 20:58:36,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 20:58:36,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 20:58:36,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 20:58:36,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 20:58:36,335 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 20:58:36,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 20:58:36,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 20:58:36,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 20:58:36,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 20:58:36,336 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 20:58:36,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 20:58:36,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 20:58:36,337 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 20:58:36,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 20:58:36,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 20:58:36,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 20:58:36,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 20:58:36,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 20:58:36,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 20:58:36,338 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 20:58:36,338 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 20:58:36,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 20:58:36,339 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 20:58:36,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 20:58:36,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 20:58:36,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 20:58:36,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 20:58:36,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 20:58:36,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 20:58:36,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 20:58:36,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 20:58:36,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 20:58:36,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 20:58:36,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 20:58:36,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 20:58:36,342 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 20:58:36,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 20:58:36,342 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 [2024-09-12 20:58:36,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 20:58:36,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 20:58:36,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 20:58:36,548 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 20:58:36,548 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 20:58:36,549 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-12 20:58:37,679 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 20:58:37,852 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 20:58:37,853 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/insertion_sort-2-2.c [2024-09-12 20:58:37,860 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/ae79e319a/05592b1fba124692b437ea8045c2da75/FLAG41a8299a1 [2024-09-12 20:58:38,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/ae79e319a/05592b1fba124692b437ea8045c2da75 [2024-09-12 20:58:38,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 20:58:38,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 20:58:38,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 20:58:38,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 20:58:38,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 20:58:38,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 08:58:38" (1/1) ... [2024-09-12 20:58:38,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10848ec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:58:38, skipping insertion in model container [2024-09-12 20:58:38,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 08:58:38" (1/1) ... [2024-09-12 20:58:38,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 20:58:38,384 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/insertion_sort-2-2.c[330,343] [2024-09-12 20:58:38,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 20:58:38,406 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 20:58:38,413 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/insertion_sort-2-2.c[330,343] [2024-09-12 20:58:38,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 20:58:38,434 INFO L204 MainTranslator]: Completed translation [2024-09-12 20:58:38,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:58:38 WrapperNode [2024-09-12 20:58:38,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 20:58:38,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 20:58:38,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 20:58:38,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 20:58:38,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:58:38" (1/1) ... [2024-09-12 20:58:38,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:58:38" (1/1) ... [2024-09-12 20:58:38,448 INFO L138 Inliner]: procedures = 15, calls = 19, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 20:58:38,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 20:58:38,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 20:58:38,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 20:58:38,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 20:58:38,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:58:38" (1/1) ... [2024-09-12 20:58:38,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:58:38" (1/1) ... [2024-09-12 20:58:38,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:58:38" (1/1) ... [2024-09-12 20:58:38,475 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-12 20:58:38,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:58:38" (1/1) ... [2024-09-12 20:58:38,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:58:38" (1/1) ... [2024-09-12 20:58:38,480 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:58:38" (1/1) ... [2024-09-12 20:58:38,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:58:38" (1/1) ... [2024-09-12 20:58:38,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:58:38" (1/1) ... [2024-09-12 20:58:38,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:58:38" (1/1) ... [2024-09-12 20:58:38,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 20:58:38,492 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 20:58:38,493 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 20:58:38,493 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 20:58:38,493 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:58:38" (1/1) ... [2024-09-12 20:58:38,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 20:58:38,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:58:38,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 20:58:38,518 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 20:58:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 20:58:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 20:58:38,550 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 20:58:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 20:58:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-12 20:58:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-12 20:58:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-12 20:58:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-12 20:58:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 20:58:38,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 20:58:38,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 20:58:38,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 20:58:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-12 20:58:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-12 20:58:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 20:58:38,552 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 20:58:38,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-12 20:58:38,603 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 20:58:38,605 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 20:58:38,721 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-09-12 20:58:38,721 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 20:58:38,742 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 20:58:38,742 INFO L318 CfgBuilder]: Removed 4 assume(true) statements. [2024-09-12 20:58:38,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 08:58:38 BoogieIcfgContainer [2024-09-12 20:58:38,743 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 20:58:38,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 20:58:38,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 20:58:38,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 20:58:38,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 08:58:38" (1/3) ... [2024-09-12 20:58:38,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fa080f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 08:58:38, skipping insertion in model container [2024-09-12 20:58:38,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:58:38" (2/3) ... [2024-09-12 20:58:38,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fa080f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 08:58:38, skipping insertion in model container [2024-09-12 20:58:38,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 08:58:38" (3/3) ... [2024-09-12 20:58:38,752 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort-2-2.c [2024-09-12 20:58:38,765 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 20:58:38,766 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 20:58:38,806 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 20:58:38,811 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;@3b7d979a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 20:58:38,811 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 20:58:38,814 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-12 20:58:38,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 20:58:38,820 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:38,820 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 20:58:38,820 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:38,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:38,826 INFO L85 PathProgramCache]: Analyzing trace with hash 921479043, now seen corresponding path program 1 times [2024-09-12 20:58:38,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:38,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565110830] [2024-09-12 20:58:38,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:38,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:38,943 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:38,953 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-12 20:58:38,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:38,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565110830] [2024-09-12 20:58:38,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565110830] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 20:58:38,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 20:58:38,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 20:58:38,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50074450] [2024-09-12 20:58:38,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 20:58:38,959 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 20:58:38,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:58:38,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 20:58:38,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 20:58:38,976 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-12 20:58:38,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:58:38,998 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2024-09-12 20:58:39,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 20:58:39,003 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-12 20:58:39,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:58:39,007 INFO L225 Difference]: With dead ends: 49 [2024-09-12 20:58:39,007 INFO L226 Difference]: Without dead ends: 23 [2024-09-12 20:58:39,009 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-12 20:58:39,011 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-12 20:58:39,012 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-12 20:58:39,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-12 20:58:39,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-12 20:58:39,031 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-12 20:58:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-09-12 20:58:39,033 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2024-09-12 20:58:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:58:39,033 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-09-12 20:58:39,034 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-12 20:58:39,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-09-12 20:58:39,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 20:58:39,035 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:39,035 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 20:58:39,035 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 20:58:39,035 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:39,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:39,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1576012003, now seen corresponding path program 1 times [2024-09-12 20:58:39,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:39,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884700733] [2024-09-12 20:58:39,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:39,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:39,283 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:39,290 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-12 20:58:39,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:39,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884700733] [2024-09-12 20:58:39,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884700733] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 20:58:39,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 20:58:39,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 20:58:39,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966458376] [2024-09-12 20:58:39,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 20:58:39,295 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 20:58:39,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:58:39,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 20:58:39,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 20:58:39,296 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-12 20:58:39,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:58:39,341 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-09-12 20:58:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 20:58:39,342 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-12 20:58:39,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:58:39,343 INFO L225 Difference]: With dead ends: 43 [2024-09-12 20:58:39,343 INFO L226 Difference]: Without dead ends: 24 [2024-09-12 20:58:39,344 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-12 20:58:39,345 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-12 20:58:39,346 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-12 20:58:39,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-12 20:58:39,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-12 20:58:39,350 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-12 20:58:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-09-12 20:58:39,350 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2024-09-12 20:58:39,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:58:39,350 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-09-12 20:58:39,351 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-12 20:58:39,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:39,351 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-09-12 20:58:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 20:58:39,353 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:39,353 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 20:58:39,353 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 20:58:39,354 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:39,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:39,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1045249472, now seen corresponding path program 1 times [2024-09-12 20:58:39,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:39,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045783459] [2024-09-12 20:58:39,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:39,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:39,569 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:39,575 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-12 20:58:39,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:39,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045783459] [2024-09-12 20:58:39,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045783459] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 20:58:39,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372445972] [2024-09-12 20:58:39,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:39,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:39,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:58:39,582 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 20:58:39,583 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 20:58:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:39,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 20:58:39,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:58:39,713 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-12 20:58:39,713 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 20:58:39,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372445972] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 20:58:39,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 20:58:39,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-09-12 20:58:39,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911216788] [2024-09-12 20:58:39,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 20:58:39,714 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 20:58:39,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:58:39,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 20:58:39,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-12 20:58:39,715 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-12 20:58:39,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:58:39,746 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-09-12 20:58:39,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 20:58:39,747 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-12 20:58:39,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:58:39,747 INFO L225 Difference]: With dead ends: 40 [2024-09-12 20:58:39,748 INFO L226 Difference]: Without dead ends: 29 [2024-09-12 20:58:39,748 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-12 20:58:39,749 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-12 20:58:39,751 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-12 20:58:39,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-12 20:58:39,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2024-09-12 20:58:39,756 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-12 20:58:39,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-09-12 20:58:39,757 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2024-09-12 20:58:39,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:58:39,757 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-09-12 20:58:39,758 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-12 20:58:39,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:39,758 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-09-12 20:58:39,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 20:58:39,759 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:39,759 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-12 20:58:39,772 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-12 20:58:39,962 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-12 20:58:39,963 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:39,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:39,963 INFO L85 PathProgramCache]: Analyzing trace with hash 530421245, now seen corresponding path program 1 times [2024-09-12 20:58:39,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:39,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321359552] [2024-09-12 20:58:39,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:39,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:40,076 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:40,079 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-12 20:58:40,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:40,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321359552] [2024-09-12 20:58:40,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321359552] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 20:58:40,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460922034] [2024-09-12 20:58:40,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:40,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:40,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:58:40,085 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 20:58:40,087 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 20:58:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:40,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-12 20:58:40,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:58:40,153 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-12 20:58:40,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 20:58:40,308 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-12 20:58:40,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460922034] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 20:58:40,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 20:58:40,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-09-12 20:58:40,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971880798] [2024-09-12 20:58:40,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 20:58:40,312 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 20:58:40,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:58:40,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 20:58:40,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-09-12 20:58:40,312 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-12 20:58:40,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:58:40,380 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2024-09-12 20:58:40,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 20:58:40,380 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-12 20:58:40,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:58:40,382 INFO L225 Difference]: With dead ends: 47 [2024-09-12 20:58:40,382 INFO L226 Difference]: Without dead ends: 30 [2024-09-12 20:58:40,383 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-12 20:58:40,383 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-12 20:58:40,384 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-12 20:58:40,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-12 20:58:40,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-09-12 20:58:40,389 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-12 20:58:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-09-12 20:58:40,391 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 21 [2024-09-12 20:58:40,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:58:40,391 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-09-12 20:58:40,391 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-12 20:58:40,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-09-12 20:58:40,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-12 20:58:40,393 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:40,393 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-12 20:58:40,405 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-12 20:58:40,593 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:40,594 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:40,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:40,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1034611302, now seen corresponding path program 2 times [2024-09-12 20:58:40,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:40,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807108853] [2024-09-12 20:58:40,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:40,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:41,068 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:41,071 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-12 20:58:41,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:41,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807108853] [2024-09-12 20:58:41,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807108853] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 20:58:41,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396088603] [2024-09-12 20:58:41,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 20:58:41,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:41,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:58:41,073 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 20:58:41,074 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 20:58:41,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 20:58:41,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 20:58:41,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-12 20:58:41,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:58:41,187 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-12 20:58:41,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 20:58:41,207 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-12 20:58:41,230 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-12 20:58:41,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 20:58:41,344 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-12 20:58:41,363 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-09-12 20:58:41,364 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-12 20:58:41,426 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-12 20:58:41,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396088603] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 20:58:41,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 20:58:41,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 23 [2024-09-12 20:58:41,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355358119] [2024-09-12 20:58:41,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 20:58:41,427 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-12 20:58:41,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:58:41,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-12 20:58:41,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2024-09-12 20:58:41,428 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-12 20:58:41,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:58:41,868 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2024-09-12 20:58:41,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-12 20:58:41,868 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-12 20:58:41,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:58:41,870 INFO L225 Difference]: With dead ends: 76 [2024-09-12 20:58:41,871 INFO L226 Difference]: Without dead ends: 61 [2024-09-12 20:58:41,872 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-12 20:58:41,873 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 75 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 20:58:41,873 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-12 20:58:41,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-12 20:58:41,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 44. [2024-09-12 20:58:41,885 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-12 20:58:41,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2024-09-12 20:58:41,887 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 22 [2024-09-12 20:58:41,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:58:41,887 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2024-09-12 20:58:41,887 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-12 20:58:41,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:41,887 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2024-09-12 20:58:41,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-12 20:58:41,888 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:41,888 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-12 20:58:41,900 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 20:58:42,088 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:42,089 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:42,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:42,089 INFO L85 PathProgramCache]: Analyzing trace with hash -78593507, now seen corresponding path program 1 times [2024-09-12 20:58:42,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:42,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475985982] [2024-09-12 20:58:42,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:42,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:42,505 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:42,508 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-12 20:58:42,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:42,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475985982] [2024-09-12 20:58:42,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475985982] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 20:58:42,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127976736] [2024-09-12 20:58:42,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:42,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:42,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:58:42,510 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 20:58:42,511 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 20:58:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:42,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-12 20:58:42,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:58:42,617 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-12 20:58:42,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 20:58:42,717 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-12 20:58:42,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 20:58:42,752 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-12 20:58:42,791 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-12 20:58:42,791 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 20:58:43,012 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-12 20:58:43,022 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-09-12 20:58:43,023 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-12 20:58:43,073 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-12 20:58:43,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127976736] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 20:58:43,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 20:58:43,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 32 [2024-09-12 20:58:43,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519650898] [2024-09-12 20:58:43,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 20:58:43,074 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-12 20:58:43,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:58:43,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-12 20:58:43,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2024-09-12 20:58:43,075 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-12 20:58:44,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:58:44,029 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2024-09-12 20:58:44,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-12 20:58:44,030 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-12 20:58:44,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:58:44,031 INFO L225 Difference]: With dead ends: 107 [2024-09-12 20:58:44,032 INFO L226 Difference]: Without dead ends: 76 [2024-09-12 20:58:44,032 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=375, Invalid=2487, Unknown=0, NotChecked=0, Total=2862 [2024-09-12 20:58:44,033 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 74 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-09-12 20:58:44,033 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.4s Time] [2024-09-12 20:58:44,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-12 20:58:44,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 38. [2024-09-12 20:58:44,045 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-12 20:58:44,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-09-12 20:58:44,045 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 25 [2024-09-12 20:58:44,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:58:44,045 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-09-12 20:58:44,045 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-12 20:58:44,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:44,046 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-09-12 20:58:44,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-12 20:58:44,046 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:44,046 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-12 20:58:44,061 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 20:58:44,249 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-12 20:58:44,249 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:44,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:44,250 INFO L85 PathProgramCache]: Analyzing trace with hash -80162640, now seen corresponding path program 1 times [2024-09-12 20:58:44,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:44,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508389779] [2024-09-12 20:58:44,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:44,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:44,353 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:44,355 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-12 20:58:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:44,358 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-12 20:58:44,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:44,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508389779] [2024-09-12 20:58:44,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508389779] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 20:58:44,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717723684] [2024-09-12 20:58:44,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:44,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:44,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:58:44,360 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 20:58:44,361 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 20:58:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:44,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-12 20:58:44,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:58:44,469 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-12 20:58:44,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 20:58:44,607 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-12 20:58:44,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717723684] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 20:58:44,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 20:58:44,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-09-12 20:58:44,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459781909] [2024-09-12 20:58:44,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 20:58:44,608 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-12 20:58:44,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:58:44,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-12 20:58:44,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-09-12 20:58:44,609 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-12 20:58:44,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:58:44,719 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2024-09-12 20:58:44,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 20:58:44,719 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-12 20:58:44,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:58:44,721 INFO L225 Difference]: With dead ends: 81 [2024-09-12 20:58:44,721 INFO L226 Difference]: Without dead ends: 45 [2024-09-12 20:58:44,722 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-09-12 20:58:44,722 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-12 20:58:44,723 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-12 20:58:44,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-12 20:58:44,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2024-09-12 20:58:44,731 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-12 20:58:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-09-12 20:58:44,733 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 29 [2024-09-12 20:58:44,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:58:44,733 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-09-12 20:58:44,734 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-12 20:58:44,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-09-12 20:58:44,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-12 20:58:44,735 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:44,735 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-12 20:58:44,750 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-12 20:58:44,936 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-12 20:58:44,936 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:44,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:44,936 INFO L85 PathProgramCache]: Analyzing trace with hash 485904074, now seen corresponding path program 2 times [2024-09-12 20:58:44,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:44,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277853094] [2024-09-12 20:58:44,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:44,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:45,514 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:45,517 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-12 20:58:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:45,522 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-12 20:58:45,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:45,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277853094] [2024-09-12 20:58:45,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277853094] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 20:58:45,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621574230] [2024-09-12 20:58:45,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 20:58:45,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:45,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:58:45,525 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 20:58:45,526 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-12 20:58:45,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 20:58:45,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 20:58:45,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-12 20:58:45,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:58:45,746 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-12 20:58:45,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 20:58:45,894 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-12 20:58:45,930 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-12 20:58:45,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 20:58:54,084 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-12 20:58:54,096 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-09-12 20:58:54,097 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-12 20:58:54,113 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-12 20:58:54,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621574230] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 20:58:54,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 20:58:54,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 13] total 31 [2024-09-12 20:58:54,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899134385] [2024-09-12 20:58:54,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 20:58:54,114 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-09-12 20:58:54,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:58:54,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-09-12 20:58:54,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=823, Unknown=2, NotChecked=0, Total=930 [2024-09-12 20:58:54,115 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-12 20:58:58,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 20:59:02,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 20:59:06,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 20:59:10,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 20:59:14,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 20:59:18,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 20:59:22,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 20:59:26,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 20:59:30,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 20:59:34,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 20:59:38,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 20:59:42,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 20:59:46,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 20:59:50,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 20:59:54,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 20:59:54,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:59:54,713 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2024-09-12 20:59:54,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-12 20:59:54,713 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-12 20:59:54,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:59:54,715 INFO L225 Difference]: With dead ends: 89 [2024-09-12 20:59:54,716 INFO L226 Difference]: Without dead ends: 87 [2024-09-12 20:59:54,717 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=222, Invalid=1668, Unknown=2, NotChecked=0, Total=1892 [2024-09-12 20:59:54,717 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 83 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 21 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.3s 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.4s IncrementalHoareTripleChecker+Time [2024-09-12 20:59:54,718 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.4s Time] [2024-09-12 20:59:54,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-12 20:59:54,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2024-09-12 20:59:54,731 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-12 20:59:54,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2024-09-12 20:59:54,733 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 35 [2024-09-12 20:59:54,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:59:54,734 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2024-09-12 20:59:54,734 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-12 20:59:54,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:59:54,734 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2024-09-12 20:59:54,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-12 20:59:54,736 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:59:54,736 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-12 20:59:54,752 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-12 20:59:54,936 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-12 20:59:54,937 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:59:54,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:59:54,937 INFO L85 PathProgramCache]: Analyzing trace with hash -178294159, now seen corresponding path program 1 times [2024-09-12 20:59:54,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:59:54,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763275838] [2024-09-12 20:59:54,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:59:54,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:59:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:59:55,481 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:59:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:59:55,483 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-12 20:59:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:59:55,487 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-12 20:59:55,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:59:55,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763275838] [2024-09-12 20:59:55,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763275838] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 20:59:55,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136026171] [2024-09-12 20:59:55,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:59:55,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:59:55,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:59:55,489 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 20:59:55,490 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-12 20:59:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:59:55,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-09-12 20:59:55,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:59:55,683 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-12 20:59:55,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 20:59:55,796 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-12 20:59:56,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 20:59:56,006 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-12 20:59:56,044 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-12 20:59:56,044 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 20:59:56,312 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-12 20:59:56,327 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-09-12 20:59:56,328 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-12 20:59:56,466 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-12 20:59:56,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136026171] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 20:59:56,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 20:59:56,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 15] total 44 [2024-09-12 20:59:56,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590337058] [2024-09-12 20:59:56,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 20:59:56,466 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-09-12 20:59:56,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:59:56,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-09-12 20:59:56,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1705, Unknown=0, NotChecked=0, Total=1892 [2024-09-12 20:59:56,467 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-12 20:59:57,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:59:57,865 INFO L93 Difference]: Finished difference Result 166 states and 206 transitions. [2024-09-12 20:59:57,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-09-12 20:59:57,865 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-12 20:59:57,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:59:57,866 INFO L225 Difference]: With dead ends: 166 [2024-09-12 20:59:57,866 INFO L226 Difference]: Without dead ends: 130 [2024-09-12 20:59:57,868 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1741 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=657, Invalid=5663, Unknown=0, NotChecked=0, Total=6320 [2024-09-12 20:59:57,869 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 115 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-09-12 20:59:57,869 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.6s Time] [2024-09-12 20:59:57,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-09-12 20:59:57,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 93. [2024-09-12 20:59:57,886 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-12 20:59:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2024-09-12 20:59:57,887 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 38 [2024-09-12 20:59:57,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:59:57,887 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2024-09-12 20:59:57,888 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-12 20:59:57,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:59:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2024-09-12 20:59:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-12 20:59:57,889 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:59:57,889 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-12 20:59:57,901 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-12 20:59:58,093 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-12 20:59:58,093 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:59:58,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:59:58,094 INFO L85 PathProgramCache]: Analyzing trace with hash 917365120, now seen corresponding path program 3 times [2024-09-12 20:59:58,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:59:58,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589474485] [2024-09-12 20:59:58,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:59:58,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:59:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:59:58,252 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:59:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:59:58,254 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-12 20:59:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:59:58,257 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-12 20:59:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:59:58,259 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-12 20:59:58,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:59:58,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589474485] [2024-09-12 20:59:58,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589474485] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 20:59:58,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199132814] [2024-09-12 20:59:58,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 20:59:58,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:59:58,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:59:58,261 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 20:59:58,262 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-12 20:59:58,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-12 20:59:58,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 20:59:58,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-12 20:59:58,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:59:58,454 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-12 20:59:58,455 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 20:59:58,629 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-12 20:59:58,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199132814] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 20:59:58,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 20:59:58,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2024-09-12 20:59:58,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491040209] [2024-09-12 20:59:58,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 20:59:58,630 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-12 20:59:58,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:59:58,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-12 20:59:58,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-09-12 20:59:58,631 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-12 20:59:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:59:58,821 INFO L93 Difference]: Finished difference Result 212 states and 275 transitions. [2024-09-12 20:59:58,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 20:59:58,821 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-12 20:59:58,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:59:58,822 INFO L225 Difference]: With dead ends: 212 [2024-09-12 20:59:58,822 INFO L226 Difference]: Without dead ends: 135 [2024-09-12 20:59:58,823 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-09-12 20:59:58,823 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-12 20:59:58,823 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-12 20:59:58,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-09-12 20:59:58,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 118. [2024-09-12 20:59:58,847 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-12 20:59:58,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 145 transitions. [2024-09-12 20:59:58,848 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 145 transitions. Word has length 42 [2024-09-12 20:59:58,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:59:58,848 INFO L474 AbstractCegarLoop]: Abstraction has 118 states and 145 transitions. [2024-09-12 20:59:58,848 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-12 20:59:58,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:59:58,848 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 145 transitions. [2024-09-12 20:59:58,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-12 20:59:58,849 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:59:58,849 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-12 20:59:58,861 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-12 20:59:59,053 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-12 20:59:59,053 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:59:59,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:59:59,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1981868692, now seen corresponding path program 1 times [2024-09-12 20:59:59,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:59:59,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148922574] [2024-09-12 20:59:59,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:59:59,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:59:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:00:00,062 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:00:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:00:00,064 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-12 21:00:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:00:00,066 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-12 21:00:00,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:00:00,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148922574] [2024-09-12 21:00:00,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148922574] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:00:00,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95022736] [2024-09-12 21:00:00,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:00:00,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:00:00,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:00:00,068 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-12 21:00:00,069 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-12 21:00:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:00:00,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-12 21:00:00,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:00:00,209 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-12 21:00:00,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 21:00:00,283 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-12 21:00:00,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 21:00:00,372 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-12 21:00:00,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-12 21:00:00,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-12 21:00:00,520 INFO L349 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2024-09-12 21:00:00,520 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-12 21:00:08,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 21:00:08,667 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-12 21:00:08,703 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-12 21:00:08,703 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:00:13,275 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-12 21:00:13,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 21:00:13,317 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-12 21:00:14,462 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-12 21:00:14,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95022736] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:00:14,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:00:14,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 20] total 52 [2024-09-12 21:00:14,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710267862] [2024-09-12 21:00:14,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:00:14,463 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-09-12 21:00:14,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:00:14,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-09-12 21:00:14,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=2360, Unknown=2, NotChecked=0, Total=2652 [2024-09-12 21:00:14,464 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-12 21:00:18,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 21:00:22,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 21:00:26,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 21:00:30,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 21:00:34,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 21:00:38,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 21:00:42,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 21:00:51,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 21:00:55,117 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-12 21:00:59,164 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-12 21:01:03,202 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-12 21:01:07,246 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-12 21:01:11,288 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-12 21:01:15,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:01:19,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:01:23,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:01:27,469 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-12 21:01:31,548 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-12 21:01:35,723 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#1| |c_main_~#v~0.base|)) (.cse2 (* c_main_~i~0 4))) (and (forall ((main_~key~0 Int)) (let ((.cse0 (store .cse1 (+ .cse2 |c_main_~#v~0.offset| 4) main_~key~0))) (< (select .cse0 (+ |c_main_~#v~0.offset| 4)) (+ 1 (select .cse0 (+ |c_main_~#v~0.offset| 8)))))) (let ((.cse3 (store .cse1 (+ .cse2 4) c_main_~key~0))) (<= (select .cse3 4) (select .cse3 8))) (= |c_main_~#v~0.offset| 0))) is different from false [2024-09-12 21:02:24,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 21:02:28,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 21:02:32,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 21:02:36,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 21:02:40,196 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_main_~i~0 4)) (.cse1 (select |c_#memory_int#1| |c_main_~#v~0.base|))) (and (forall ((main_~key~0 Int)) (let ((.cse0 (store .cse1 (+ .cse2 |c_main_~#v~0.offset| 4) main_~key~0))) (< (select .cse0 (+ |c_main_~#v~0.offset| 4)) (+ 1 (select .cse0 (+ |c_main_~#v~0.offset| 8)))))) (let ((.cse3 (store .cse1 (+ .cse2 4) c_main_~key~0))) (<= (select .cse3 4) (select .cse3 8))) (<= (select .cse1 4) (select .cse1 8)) (= |c_main_~#v~0.offset| 0))) is different from false [2024-09-12 21:02:44,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 21:02:48,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 21:02:52,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 21:02:52,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:02:52,910 INFO L93 Difference]: Finished difference Result 285 states and 352 transitions. [2024-09-12 21:02:52,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-09-12 21:02:52,911 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 41 [2024-09-12 21:02:52,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:02:52,912 INFO L225 Difference]: With dead ends: 285 [2024-09-12 21:02:52,912 INFO L226 Difference]: Without dead ends: 189 [2024-09-12 21:02:52,913 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1797 ImplicationChecksByTransitivity, 74.2s TimeCoverageRelationStatistics Valid=667, Invalid=5034, Unknown=11, NotChecked=450, Total=6162 [2024-09-12 21:02:52,914 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 146 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 63 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 96.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 97.2s IncrementalHoareTripleChecker+Time [2024-09-12 21:02:52,914 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 315 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1019 Invalid, 24 Unknown, 147 Unchecked, 97.2s Time] [2024-09-12 21:02:52,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-09-12 21:02:52,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 143. [2024-09-12 21:02:52,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 126 states have (on average 1.2142857142857142) internal successors, (153), 130 states have internal predecessors, (153), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-12 21:02:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 171 transitions. [2024-09-12 21:02:52,949 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 171 transitions. Word has length 41 [2024-09-12 21:02:52,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:02:52,949 INFO L474 AbstractCegarLoop]: Abstraction has 143 states and 171 transitions. [2024-09-12 21:02:52,949 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has 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-12 21:02:52,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:02:52,949 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 171 transitions. [2024-09-12 21:02:52,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-12 21:02:52,950 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:02:52,950 INFO L216 NwaCegarLoop]: trace histogram [5, 3, 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] [2024-09-12 21:02:52,962 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-12 21:02:53,151 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-12 21:02:53,152 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:02:53,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:02:53,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1767795145, now seen corresponding path program 2 times [2024-09-12 21:02:53,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:02:53,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272843546] [2024-09-12 21:02:53,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:02:53,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:02:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:02:54,225 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:02:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:02:54,227 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-12 21:02:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:02:54,230 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:02:54,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:02:54,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272843546] [2024-09-12 21:02:54,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272843546] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:02:54,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161486724] [2024-09-12 21:02:54,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 21:02:54,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:02:54,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:02:54,231 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:02:54,232 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-12 21:02:54,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 21:02:54,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:02:54,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-09-12 21:02:54,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:02:54,335 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-12 21:02:54,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 21:02:54,449 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-12 21:02:54,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 21:02:54,475 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 40 treesize of output 27 [2024-09-12 21:02:54,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 21:02:54,538 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 51 treesize of output 30 [2024-09-12 21:02:54,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-12 21:02:54,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-12 21:02:54,705 INFO L349 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2024-09-12 21:02:54,706 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 48 treesize of output 36 [2024-09-12 21:02:54,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 21:02:54,880 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-12 21:02:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 21:02:54,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:03:03,975 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 155 treesize of output 143 [2024-09-12 21:03:04,092 INFO L349 Elim1Store]: treesize reduction 16, result has 76.1 percent of original size [2024-09-12 21:03:04,093 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 839359 treesize of output 806610 [2024-09-12 21:03:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 21:03:05,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161486724] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:03:05,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:03:05,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 19] total 46 [2024-09-12 21:03:05,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504839671] [2024-09-12 21:03:05,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:03:05,918 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-09-12 21:03:05,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:03:05,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-09-12 21:03:05,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1860, Unknown=2, NotChecked=0, Total=2070 [2024-09-12 21:03:05,919 INFO L87 Difference]: Start difference. First operand 143 states and 171 transitions. Second operand has 46 states, 44 states have (on average 2.0) internal successors, (88), 44 states have internal predecessors, (88), 5 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-12 21:03:11,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:03:13,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:03:17,740 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-12 21:03:22,067 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-12 21:03:23,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:03:27,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 [1] [2024-09-12 21:03:31,983 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-12 21:03:36,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-12 21:04:27,205 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-12 21:04:31,221 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-12 21:04:35,236 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-12 21:04:39,260 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-12 21:04:43,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-12 21:05:27,953 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-12 21:05:32,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:05:36,248 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-12 21:05:40,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:06:01,204 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-12 21:06:05,248 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-12 21:06:09,282 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-12 21:07:14,822 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-12 21:07:18,831 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-12 21:07:22,842 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-12 21:07:26,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:07:51,906 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-12 21:07:55,945 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-12 21:08:00,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:08:04,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:08:08,347 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, 1] [2024-09-12 21:08:12,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:08:16,659 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-12 21:08:20,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:08:27,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:08:31,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-12 21:08:35,464 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-12 21:08:37,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:08:49,438 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-12 21:08:53,482 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-12 21:08:57,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:08:59,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:09:03,893 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-12 21:09:07,937 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-12 21:09:11,974 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-12 21:09:16,016 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-12 21:09:20,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:09:24,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-12 21:09:28,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:09:32,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:09:36,267 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-12 21:09:40,308 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-12 21:09:44,351 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-12 21:10:13,187 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-12 21:10:17,195 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-12 21:10:46,002 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-12 21:11:50,311 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-12 21:11:54,325 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-12 21:11:58,346 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_main_~#v~0.offset| 4)) (.cse6 (+ |c_main_~#v~0.offset| 8)) (.cse1 (select |c_#memory_int#1| |c_main_~#v~0.base|)) (.cse2 (= c_main_~j~0 1))) (and (or (let ((.cse0 (+ c_main_~i~0 1))) (and (not (= .cse0 0)) (<= 0 .cse0))) (< (select .cse1 4) (select .cse1 8))) (or (and (= c_main_~i~0 0) .cse2) (< 0 c_main_~i~0)) (forall ((v_ArrVal_240 Int) (v_ArrVal_239 Int)) (let ((.cse3 (* c_main_~i~0 4))) (let ((.cse7 (+ .cse3 |c_main_~#v~0.offset|))) (or (< (select .cse1 (+ .cse3 |c_main_~#v~0.offset| (- 4))) v_ArrVal_240) (let ((.cse4 (store (store .cse1 (+ .cse3 |c_main_~#v~0.offset| 4) v_ArrVal_239) .cse7 v_ArrVal_240))) (< (select .cse4 .cse5) (+ (select .cse4 .cse6) 1))) (< v_ArrVal_239 (select .cse1 .cse7)))))) (= |c_main_~#v~0.offset| 0) (forall ((v_ArrVal_240 Int) (v_ArrVal_239 Int)) (let ((.cse8 (* c_main_~j~0 4))) (let ((.cse10 (+ |c_main_~#v~0.offset| (- 4) .cse8))) (or (< (select .cse1 (+ |c_main_~#v~0.offset| .cse8 (- 8))) v_ArrVal_240) (let ((.cse9 (store (store .cse1 (+ |c_main_~#v~0.offset| .cse8) v_ArrVal_239) .cse10 v_ArrVal_240))) (< (select .cse9 .cse5) (+ (select .cse9 .cse6) 1))) (< v_ArrVal_239 (select .cse1 .cse10)))))) (or (< 1 c_main_~j~0) .cse2))) is different from false [2024-09-12 21:12:03,017 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-12 21:12:07,028 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-12 21:12:11,063 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-12 21:12:15,071 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-12 21:12:19,082 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-12 21:12:23,411 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-12 21:12:25,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:12:29,236 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-12 21:12:35,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:12:39,688 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-12 21:12:43,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-12 21:12:47,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:12:51,784 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] Killed by 15