./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/eureka_05.i --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/eureka_05.i -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 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab --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:31,464 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 20:58:31,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 20:58:31,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 20:58:31,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 20:58:31,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 20:58:31,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 20:58:31,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 20:58:31,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 20:58:31,572 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 20:58:31,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 20:58:31,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 20:58:31,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 20:58:31,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 20:58:31,574 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 20:58:31,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 20:58:31,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 20:58:31,577 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 20:58:31,577 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 20:58:31,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 20:58:31,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 20:58:31,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 20:58:31,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 20:58:31,579 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 20:58:31,579 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 20:58:31,579 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 20:58:31,579 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 20:58:31,580 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 20:58:31,580 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 20:58:31,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 20:58:31,580 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 20:58:31,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 20:58:31,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 20:58:31,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 20:58:31,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 20:58:31,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 20:58:31,581 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 20:58:31,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 20:58:31,582 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 20:58:31,582 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 20:58:31,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 20:58:31,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 20:58:31,584 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 -> 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab 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:31,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 20:58:31,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 20:58:31,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 20:58:31,845 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 20:58:31,845 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 20:58:31,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops/eureka_05.i [2024-09-12 20:58:33,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 20:58:33,393 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 20:58:33,394 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/eureka_05.i [2024-09-12 20:58:33,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a33bed04a/1383a415aef14a89a46a07d096bcec38/FLAGf71a7e5dd [2024-09-12 20:58:33,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a33bed04a/1383a415aef14a89a46a07d096bcec38 [2024-09-12 20:58:33,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 20:58:33,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 20:58:33,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 20:58:33,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 20:58:33,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 20:58:33,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 08:58:33" (1/1) ... [2024-09-12 20:58:33,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b9bf886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:58:33, skipping insertion in model container [2024-09-12 20:58:33,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 08:58:33" (1/1) ... [2024-09-12 20:58:33,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 20:58:33,999 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/eureka_05.i[810,823] [2024-09-12 20:58:34,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 20:58:34,088 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 20:58:34,130 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/eureka_05.i[810,823] [2024-09-12 20:58:34,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 20:58:34,171 INFO L204 MainTranslator]: Completed translation [2024-09-12 20:58:34,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:58:34 WrapperNode [2024-09-12 20:58:34,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 20:58:34,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 20:58:34,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 20:58:34,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 20:58:34,183 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:34" (1/1) ... [2024-09-12 20:58:34,190 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:34" (1/1) ... [2024-09-12 20:58:34,195 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 20:58:34,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 20:58:34,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 20:58:34,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 20:58:34,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 20:58:34,204 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:34" (1/1) ... [2024-09-12 20:58:34,205 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:34" (1/1) ... [2024-09-12 20:58:34,206 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:34" (1/1) ... [2024-09-12 20:58:34,224 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 11, 2]. 73 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 3 writes are split as follows [0, 2, 1]. [2024-09-12 20:58:34,225 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:34" (1/1) ... [2024-09-12 20:58:34,225 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:34" (1/1) ... [2024-09-12 20:58:34,232 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:34" (1/1) ... [2024-09-12 20:58:34,236 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:34" (1/1) ... [2024-09-12 20:58:34,237 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:34" (1/1) ... [2024-09-12 20:58:34,238 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:34" (1/1) ... [2024-09-12 20:58:34,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 20:58:34,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 20:58:34,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 20:58:34,243 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 20:58:34,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:58:34" (1/1) ... [2024-09-12 20:58:34,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 20:58:34,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:58:34,280 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:34,283 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:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 20:58:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 20:58:34,333 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 20:58:34,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 20:58:34,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-12 20:58:34,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-12 20:58:34,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-12 20:58:34,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-12 20:58:34,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-12 20:58:34,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-12 20:58:34,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 20:58:34,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 20:58:34,336 INFO L130 BoogieDeclarations]: Found specification of procedure SelectionSort [2024-09-12 20:58:34,336 INFO L138 BoogieDeclarations]: Found implementation of procedure SelectionSort [2024-09-12 20:58:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 20:58:34,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 20:58:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-12 20:58:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-12 20:58:34,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-12 20:58:34,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 20:58:34,338 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 20:58:34,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-12 20:58:34,431 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 20:58:34,434 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 20:58:34,593 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-09-12 20:58:34,593 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 20:58:34,620 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 20:58:34,621 INFO L318 CfgBuilder]: Removed 4 assume(true) statements. [2024-09-12 20:58:34,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 08:58:34 BoogieIcfgContainer [2024-09-12 20:58:34,621 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 20:58:34,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 20:58:34,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 20:58:34,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 20:58:34,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 08:58:33" (1/3) ... [2024-09-12 20:58:34,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af333e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 08:58:34, skipping insertion in model container [2024-09-12 20:58:34,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:58:34" (2/3) ... [2024-09-12 20:58:34,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af333e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 08:58:34, skipping insertion in model container [2024-09-12 20:58:34,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 08:58:34" (3/3) ... [2024-09-12 20:58:34,630 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i [2024-09-12 20:58:34,645 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 20:58:34,646 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 20:58:34,695 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 20:58:34,701 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;@3f79ae35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 20:58:34,701 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 20:58:34,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 20:58:34,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 20:58:34,712 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:34,713 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 20:58:34,714 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:34,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:34,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2080310768, now seen corresponding path program 1 times [2024-09-12 20:58:34,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:34,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901554436] [2024-09-12 20:58:34,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:34,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:34,928 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:34,956 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 20:58:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:34,962 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:34,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:34,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901554436] [2024-09-12 20:58:34,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901554436] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 20:58:34,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 20:58:34,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 20:58:34,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113529027] [2024-09-12 20:58:34,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 20:58:34,977 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 20:58:34,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:58:35,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 20:58:35,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 20:58:35,015 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 20:58:35,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:58:35,192 INFO L93 Difference]: Finished difference Result 65 states and 92 transitions. [2024-09-12 20:58:35,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 20:58:35,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-09-12 20:58:35,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:58:35,202 INFO L225 Difference]: With dead ends: 65 [2024-09-12 20:58:35,202 INFO L226 Difference]: Without dead ends: 36 [2024-09-12 20:58:35,206 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 20:58:35,210 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 61 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 20:58:35,211 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 7 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 20:58:35,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-12 20:58:35,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 25. [2024-09-12 20:58:35,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 20:58:35,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-09-12 20:58:35,264 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 17 [2024-09-12 20:58:35,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:58:35,265 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-09-12 20:58:35,265 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 20:58:35,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:35,267 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-09-12 20:58:35,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 20:58:35,268 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:35,268 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 20:58:35,269 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 20:58:35,269 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:35,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:35,270 INFO L85 PathProgramCache]: Analyzing trace with hash 156377847, now seen corresponding path program 1 times [2024-09-12 20:58:35,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:35,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895992577] [2024-09-12 20:58:35,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:35,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:35,382 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:35,409 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 20:58:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:35,422 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:35,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:35,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895992577] [2024-09-12 20:58:35,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895992577] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 20:58:35,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 20:58:35,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 20:58:35,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92257754] [2024-09-12 20:58:35,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 20:58:35,426 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 20:58:35,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:58:35,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 20:58:35,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 20:58:35,429 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 20:58:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:58:35,651 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2024-09-12 20:58:35,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 20:58:35,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-09-12 20:58:35,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:58:35,653 INFO L225 Difference]: With dead ends: 56 [2024-09-12 20:58:35,653 INFO L226 Difference]: Without dead ends: 37 [2024-09-12 20:58:35,654 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-12 20:58:35,655 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 57 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 20:58:35,655 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 5 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 20:58:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-12 20:58:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2024-09-12 20:58:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 20:58:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-09-12 20:58:35,665 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 17 [2024-09-12 20:58:35,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:58:35,665 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-09-12 20:58:35,666 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 20:58:35,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:35,666 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-09-12 20:58:35,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 20:58:35,671 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:35,671 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 20:58:35,671 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 20:58:35,671 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:35,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:35,672 INFO L85 PathProgramCache]: Analyzing trace with hash 364897058, now seen corresponding path program 1 times [2024-09-12 20:58:35,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:35,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71467785] [2024-09-12 20:58:35,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:35,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:35,778 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:35,797 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-12 20:58:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:35,804 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:35,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:35,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71467785] [2024-09-12 20:58:35,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71467785] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 20:58:35,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534966662] [2024-09-12 20:58:35,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:35,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:35,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:58:35,811 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:35,813 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:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:35,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-12 20:58:35,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:58:35,893 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:35,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 20:58:35,927 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:35,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534966662] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 20:58:35,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 20:58:35,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2024-09-12 20:58:35,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753639485] [2024-09-12 20:58:35,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 20:58:35,928 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 20:58:35,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:58:35,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 20:58:35,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-09-12 20:58:35,933 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 20:58:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:58:36,179 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2024-09-12 20:58:36,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 20:58:36,182 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2024-09-12 20:58:36,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:58:36,183 INFO L225 Difference]: With dead ends: 65 [2024-09-12 20:58:36,183 INFO L226 Difference]: Without dead ends: 46 [2024-09-12 20:58:36,184 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-09-12 20:58:36,185 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 66 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 20:58:36,187 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 7 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 20:58:36,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-12 20:58:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 29. [2024-09-12 20:58:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 20:58:36,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-09-12 20:58:36,207 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2024-09-12 20:58:36,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:58:36,208 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-09-12 20:58:36,208 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 20:58:36,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:36,209 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-09-12 20:58:36,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 20:58:36,209 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:36,209 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 20:58:36,228 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:36,410 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:36,411 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:36,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:36,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1764338249, now seen corresponding path program 2 times [2024-09-12 20:58:36,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:36,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797567311] [2024-09-12 20:58:36,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:36,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:36,513 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:36,533 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 20:58:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:36,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-12 20:58:36,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:36,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797567311] [2024-09-12 20:58:36,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797567311] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 20:58:36,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 20:58:36,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 20:58:36,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827065254] [2024-09-12 20:58:36,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 20:58:36,562 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 20:58:36,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:58:36,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 20:58:36,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-12 20:58:36,566 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 20:58:36,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:58:36,733 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2024-09-12 20:58:36,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 20:58:36,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-09-12 20:58:36,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:58:36,736 INFO L225 Difference]: With dead ends: 46 [2024-09-12 20:58:36,736 INFO L226 Difference]: Without dead ends: 34 [2024-09-12 20:58:36,738 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-09-12 20:58:36,739 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 75 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 20:58:36,740 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 7 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 20:58:36,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-12 20:58:36,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-09-12 20:58:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 20:58:36,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-09-12 20:58:36,758 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 21 [2024-09-12 20:58:36,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:58:36,759 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-09-12 20:58:36,759 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 20:58:36,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:36,760 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-09-12 20:58:36,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-12 20:58:36,762 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:36,763 INFO L216 NwaCegarLoop]: trace histogram [4, 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:36,763 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 20:58:36,764 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:36,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:36,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1674322940, now seen corresponding path program 1 times [2024-09-12 20:58:36,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:36,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739247081] [2024-09-12 20:58:36,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:36,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:36,886 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:36,905 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 20:58:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-12 20:58:36,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:36,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739247081] [2024-09-12 20:58:36,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739247081] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 20:58:36,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856361272] [2024-09-12 20:58:36,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:36,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:36,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:58:36,979 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:36,981 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:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:37,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 20:58:37,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:58:37,111 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 20:58:37,111 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 20:58:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 20:58:37,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856361272] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 20:58:37,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 20:58:37,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-09-12 20:58:37,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054767944] [2024-09-12 20:58:37,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 20:58:37,176 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-12 20:58:37,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:58:37,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-12 20:58:37,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-09-12 20:58:37,177 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-12 20:58:37,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:58:37,669 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2024-09-12 20:58:37,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-12 20:58:37,669 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 24 [2024-09-12 20:58:37,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:58:37,671 INFO L225 Difference]: With dead ends: 70 [2024-09-12 20:58:37,671 INFO L226 Difference]: Without dead ends: 50 [2024-09-12 20:58:37,672 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2024-09-12 20:58:37,672 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 109 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 20:58:37,673 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 13 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 20:58:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-09-12 20:58:37,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 32. [2024-09-12 20:58:37,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 20:58:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-09-12 20:58:37,684 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2024-09-12 20:58:37,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:58:37,685 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-09-12 20:58:37,685 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-12 20:58:37,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:37,686 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-09-12 20:58:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-12 20:58:37,687 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:37,687 INFO L216 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 20:58:37,705 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 20:58:37,891 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:37,892 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:37,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:37,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2009987497, now seen corresponding path program 1 times [2024-09-12 20:58:37,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:37,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013665508] [2024-09-12 20:58:37,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:37,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:37,965 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:37,978 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 20:58:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:38,023 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-12 20:58:38,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:38,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013665508] [2024-09-12 20:58:38,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013665508] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 20:58:38,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610939211] [2024-09-12 20:58:38,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:38,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:38,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:58:38,027 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:38,029 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:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:38,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 20:58:38,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:58:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-12 20:58:38,167 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 20:58:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-12 20:58:38,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610939211] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 20:58:38,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 20:58:38,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2024-09-12 20:58:38,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360696527] [2024-09-12 20:58:38,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 20:58:38,328 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-12 20:58:38,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:58:38,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-12 20:58:38,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-09-12 20:58:38,330 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 13 states have internal predecessors, (41), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-12 20:58:38,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:58:38,886 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2024-09-12 20:58:38,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-12 20:58:38,887 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 13 states have internal predecessors, (41), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2024-09-12 20:58:38,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:58:38,888 INFO L225 Difference]: With dead ends: 83 [2024-09-12 20:58:38,888 INFO L226 Difference]: Without dead ends: 66 [2024-09-12 20:58:38,888 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=767, Unknown=0, NotChecked=0, Total=1056 [2024-09-12 20:58:38,889 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 290 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 20:58:38,889 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 13 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 20:58:38,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-12 20:58:38,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2024-09-12 20:58:38,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 54 states have internal predecessors, (69), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 20:58:38,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2024-09-12 20:58:38,909 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 28 [2024-09-12 20:58:38,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:58:38,909 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2024-09-12 20:58:38,909 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 13 states have internal predecessors, (41), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-12 20:58:38,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:38,910 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2024-09-12 20:58:38,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-12 20:58:38,911 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:38,911 INFO L216 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 20:58:38,929 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:39,112 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-12 20:58:39,112 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:39,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:39,113 INFO L85 PathProgramCache]: Analyzing trace with hash 752690779, now seen corresponding path program 2 times [2024-09-12 20:58:39,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:39,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748776568] [2024-09-12 20:58:39,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:39,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:39,227 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:39,238 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 20:58:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:39,347 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-09-12 20:58:39,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:39,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748776568] [2024-09-12 20:58:39,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748776568] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 20:58:39,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551036656] [2024-09-12 20:58:39,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 20:58:39,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:39,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:58:39,350 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:39,351 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:39,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 20:58:39,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 20:58:39,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 20:58:39,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:58:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-09-12 20:58:39,625 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 20:58:39,882 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-09-12 20:58:39,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551036656] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 20:58:39,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 20:58:39,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 19 [2024-09-12 20:58:39,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127656597] [2024-09-12 20:58:39,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 20:58:39,885 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-12 20:58:39,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:58:39,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-12 20:58:39,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2024-09-12 20:58:39,886 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 16 states have internal predecessors, (76), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-12 20:58:40,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:58:40,155 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2024-09-12 20:58:40,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-12 20:58:40,155 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 16 states have internal predecessors, (76), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 58 [2024-09-12 20:58:40,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:58:40,156 INFO L225 Difference]: With dead ends: 84 [2024-09-12 20:58:40,158 INFO L226 Difference]: Without dead ends: 72 [2024-09-12 20:58:40,159 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2024-09-12 20:58:40,159 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 137 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 20:58:40,160 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 8 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 20:58:40,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-09-12 20:58:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-09-12 20:58:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.296875) internal successors, (83), 64 states have internal predecessors, (83), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 20:58:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2024-09-12 20:58:40,188 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 58 [2024-09-12 20:58:40,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:58:40,189 INFO L474 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2024-09-12 20:58:40,189 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 16 states have internal predecessors, (76), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-12 20:58:40,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2024-09-12 20:58:40,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-09-12 20:58:40,191 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:40,192 INFO L216 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 20:58:40,209 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:40,393 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:40,393 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:40,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:40,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1101248827, now seen corresponding path program 3 times [2024-09-12 20:58:40,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:40,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736494999] [2024-09-12 20:58:40,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:40,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:40,511 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:40,522 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 20:58:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-09-12 20:58:40,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:40,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736494999] [2024-09-12 20:58:40,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736494999] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 20:58:40,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553637348] [2024-09-12 20:58:40,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 20:58:40,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:40,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:58:40,653 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:40,654 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:40,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-12 20:58:40,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 20:58:40,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-12 20:58:40,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:58:40,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-12 20:58:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-09-12 20:58:41,043 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 20:58:41,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553637348] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 20:58:41,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 20:58:41,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2024-09-12 20:58:41,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688122936] [2024-09-12 20:58:41,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 20:58:41,044 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 20:58:41,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:58:41,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 20:58:41,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-09-12 20:58:41,045 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 20:58:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:58:41,219 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2024-09-12 20:58:41,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 20:58:41,220 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2024-09-12 20:58:41,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:58:41,221 INFO L225 Difference]: With dead ends: 81 [2024-09-12 20:58:41,221 INFO L226 Difference]: Without dead ends: 79 [2024-09-12 20:58:41,221 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2024-09-12 20:58:41,222 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 20:58:41,222 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 107 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 20:58:41,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-09-12 20:58:41,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2024-09-12 20:58:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 69 states have internal predecessors, (87), 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:58:41,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2024-09-12 20:58:41,253 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 64 [2024-09-12 20:58:41,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:58:41,253 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2024-09-12 20:58:41,253 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 20:58:41,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:41,254 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2024-09-12 20:58:41,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-09-12 20:58:41,256 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:41,256 INFO L216 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 20:58:41,273 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:41,456 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-12 20:58:41,457 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:41,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:41,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2042194420, now seen corresponding path program 1 times [2024-09-12 20:58:41,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:41,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38072808] [2024-09-12 20:58:41,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:41,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:41,584 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:41,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 20:58:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:41,719 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-12 20:58:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 2 proven. 147 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-09-12 20:58:41,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:41,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38072808] [2024-09-12 20:58:41,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38072808] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 20:58:41,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793744104] [2024-09-12 20:58:41,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:41,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:41,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:58:41,726 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:41,727 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:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:41,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 20:58:41,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:58:42,001 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 27 proven. 120 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-12 20:58:42,001 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 20:58:42,314 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 29 proven. 120 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-09-12 20:58:42,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793744104] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 20:58:42,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 20:58:42,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 21 [2024-09-12 20:58:42,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638618180] [2024-09-12 20:58:42,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 20:58:42,315 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-12 20:58:42,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:58:42,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-12 20:58:42,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2024-09-12 20:58:42,316 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 19 states have internal predecessors, (89), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-12 20:58:42,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:58:42,803 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2024-09-12 20:58:42,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-12 20:58:42,803 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 19 states have internal predecessors, (89), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 71 [2024-09-12 20:58:42,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:58:42,807 INFO L225 Difference]: With dead ends: 106 [2024-09-12 20:58:42,807 INFO L226 Difference]: Without dead ends: 81 [2024-09-12 20:58:42,808 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=1046, Unknown=0, NotChecked=0, Total=1406 [2024-09-12 20:58:42,809 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 168 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 20:58:42,812 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 10 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 20:58:42,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-09-12 20:58:42,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-09-12 20:58:42,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 70 states have internal predecessors, (88), 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:58:42,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2024-09-12 20:58:42,838 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 71 [2024-09-12 20:58:42,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:58:42,838 INFO L474 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2024-09-12 20:58:42,839 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 19 states have internal predecessors, (89), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-12 20:58:42,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:42,840 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2024-09-12 20:58:42,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-12 20:58:42,841 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:42,841 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 20:58:42,860 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-12 20:58:43,044 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:43,044 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:43,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:43,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2083039638, now seen corresponding path program 2 times [2024-09-12 20:58:43,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:43,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595952161] [2024-09-12 20:58:43,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:43,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:43,963 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:43,993 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 20:58:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:44,735 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-12 20:58:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:44,739 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 2 proven. 142 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-09-12 20:58:44,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:44,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595952161] [2024-09-12 20:58:44,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595952161] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 20:58:44,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069535093] [2024-09-12 20:58:44,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 20:58:44,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:44,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:58:44,741 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:58:44,755 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:58:44,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 20:58:44,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 20:58:44,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-12 20:58:44,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:58:44,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 20:58:44,952 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 15 treesize of output 7 [2024-09-12 20:58:45,386 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-09-12 20:58:45,387 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 20:58:45,960 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 96 proven. 15 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-09-12 20:58:45,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069535093] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 20:58:45,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 20:58:45,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 41 [2024-09-12 20:58:45,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294235747] [2024-09-12 20:58:45,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 20:58:45,961 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-09-12 20:58:45,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:58:45,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-09-12 20:58:45,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1480, Unknown=0, NotChecked=0, Total=1640 [2024-09-12 20:58:45,966 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 41 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 37 states have internal predecessors, (92), 6 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-12 20:58:47,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:58:47,728 INFO L93 Difference]: Finished difference Result 161 states and 198 transitions. [2024-09-12 20:58:47,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-09-12 20:58:47,728 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 37 states have internal predecessors, (92), 6 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 74 [2024-09-12 20:58:47,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:58:47,730 INFO L225 Difference]: With dead ends: 161 [2024-09-12 20:58:47,730 INFO L226 Difference]: Without dead ends: 101 [2024-09-12 20:58:47,732 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=602, Invalid=3688, Unknown=0, NotChecked=0, Total=4290 [2024-09-12 20:58:47,732 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 216 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 20:58:47,732 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 8 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 20:58:47,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-09-12 20:58:47,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 88. [2024-09-12 20:58:47,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 79 states have internal predecessors, (98), 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:58:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2024-09-12 20:58:47,762 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 74 [2024-09-12 20:58:47,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:58:47,762 INFO L474 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2024-09-12 20:58:47,762 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 37 states have internal predecessors, (92), 6 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-12 20:58:47,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:47,763 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2024-09-12 20:58:47,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-12 20:58:47,764 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:47,764 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 20:58:47,781 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-12 20:58:47,967 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:47,968 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:47,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:47,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1642634130, now seen corresponding path program 1 times [2024-09-12 20:58:47,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:47,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005174834] [2024-09-12 20:58:47,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:47,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:48,342 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:48,357 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 20:58:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:49,028 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-12 20:58:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 2 proven. 129 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-09-12 20:58:49,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:49,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005174834] [2024-09-12 20:58:49,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005174834] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 20:58:49,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473103308] [2024-09-12 20:58:49,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:49,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:49,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:58:49,035 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:58:49,037 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:58:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:49,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-12 20:58:49,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:58:49,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 20:58:49,205 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 15 treesize of output 7 [2024-09-12 20:58:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-09-12 20:58:49,564 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 20:58:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 80 proven. 7 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-09-12 20:58:49,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473103308] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 20:58:49,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 20:58:49,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 36 [2024-09-12 20:58:49,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735372793] [2024-09-12 20:58:49,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 20:58:49,961 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-09-12 20:58:49,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:58:49,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-09-12 20:58:49,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1093, Unknown=0, NotChecked=0, Total=1260 [2024-09-12 20:58:49,962 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 36 states, 36 states have (on average 2.361111111111111) internal successors, (85), 32 states have internal predecessors, (85), 5 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-12 20:58:50,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:58:50,588 INFO L93 Difference]: Finished difference Result 159 states and 193 transitions. [2024-09-12 20:58:50,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-12 20:58:50,588 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.361111111111111) internal successors, (85), 32 states have internal predecessors, (85), 5 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 74 [2024-09-12 20:58:50,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:58:50,590 INFO L225 Difference]: With dead ends: 159 [2024-09-12 20:58:50,590 INFO L226 Difference]: Without dead ends: 101 [2024-09-12 20:58:50,591 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=377, Invalid=1975, Unknown=0, NotChecked=0, Total=2352 [2024-09-12 20:58:50,592 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 106 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 20:58:50,592 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 5 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 20:58:50,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-09-12 20:58:50,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2024-09-12 20:58:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 82 states have internal predecessors, (101), 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:58:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2024-09-12 20:58:50,623 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 74 [2024-09-12 20:58:50,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:58:50,623 INFO L474 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2024-09-12 20:58:50,624 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.361111111111111) internal successors, (85), 32 states have internal predecessors, (85), 5 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-12 20:58:50,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:50,624 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2024-09-12 20:58:50,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-12 20:58:50,625 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:50,625 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 7, 5, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 20:58:50,639 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:58:50,825 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:50,825 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:50,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:50,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2086534804, now seen corresponding path program 2 times [2024-09-12 20:58:50,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:50,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704122223] [2024-09-12 20:58:50,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:50,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:51,390 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:51,409 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 20:58:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:51,431 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-12 20:58:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-12 20:58:51,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:51,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704122223] [2024-09-12 20:58:51,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704122223] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 20:58:51,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900241530] [2024-09-12 20:58:51,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 20:58:51,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:51,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:58:51,438 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 20:58:51,440 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 20:58:51,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 20:58:51,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 20:58:51,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-12 20:58:51,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:58:51,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 20:58:51,610 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 15 treesize of output 7 [2024-09-12 20:58:51,870 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2024-09-12 20:58:51,870 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 20:58:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-09-12 20:58:52,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900241530] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-12 20:58:52,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-12 20:58:52,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17, 8] total 29 [2024-09-12 20:58:52,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150748995] [2024-09-12 20:58:52,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 20:58:52,165 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 20:58:52,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:58:52,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 20:58:52,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2024-09-12 20:58:52,166 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 20:58:52,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:58:52,378 INFO L93 Difference]: Finished difference Result 158 states and 191 transitions. [2024-09-12 20:58:52,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 20:58:52,379 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 74 [2024-09-12 20:58:52,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:58:52,380 INFO L225 Difference]: With dead ends: 158 [2024-09-12 20:58:52,380 INFO L226 Difference]: Without dead ends: 94 [2024-09-12 20:58:52,381 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056 [2024-09-12 20:58:52,381 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 20:58:52,382 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 67 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 20:58:52,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-09-12 20:58:52,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2024-09-12 20:58:52,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 76 states have internal predecessors, (94), 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:58:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2024-09-12 20:58:52,415 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 74 [2024-09-12 20:58:52,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:58:52,416 INFO L474 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2024-09-12 20:58:52,416 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 20:58:52,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:52,416 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2024-09-12 20:58:52,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-12 20:58:52,418 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:52,418 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 20:58:52,435 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 20:58:52,618 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-12 20:58:52,619 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:52,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:52,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2132308138, now seen corresponding path program 3 times [2024-09-12 20:58:52,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:52,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310934716] [2024-09-12 20:58:52,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:52,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:53,234 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:53,255 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 20:58:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:53,898 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-12 20:58:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 2 proven. 142 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-09-12 20:58:53,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:53,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310934716] [2024-09-12 20:58:53,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310934716] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 20:58:53,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767736998] [2024-09-12 20:58:53,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 20:58:53,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:53,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:58:53,904 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 20:58:53,905 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 20:58:53,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-12 20:58:53,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 20:58:53,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-12 20:58:53,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:58:53,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2024-09-12 20:58:54,025 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 33 treesize of output 32 [2024-09-12 20:58:54,553 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-09-12 20:58:54,553 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 20:58:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-09-12 20:58:54,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767736998] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 20:58:54,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 20:58:54,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 10] total 36 [2024-09-12 20:58:54,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668853719] [2024-09-12 20:58:54,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 20:58:54,783 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-09-12 20:58:54,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:58:54,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-09-12 20:58:54,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1137, Unknown=0, NotChecked=0, Total=1260 [2024-09-12 20:58:54,785 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand has 36 states, 34 states have (on average 2.411764705882353) internal successors, (82), 33 states have internal predecessors, (82), 10 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-09-12 20:58:56,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:58:56,215 INFO L93 Difference]: Finished difference Result 151 states and 184 transitions. [2024-09-12 20:58:56,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-12 20:58:56,215 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 2.411764705882353) internal successors, (82), 33 states have internal predecessors, (82), 10 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 74 [2024-09-12 20:58:56,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:58:56,216 INFO L225 Difference]: With dead ends: 151 [2024-09-12 20:58:56,216 INFO L226 Difference]: Without dead ends: 90 [2024-09-12 20:58:56,218 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 136 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=447, Invalid=3335, Unknown=0, NotChecked=0, Total=3782 [2024-09-12 20:58:56,218 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 110 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 20:58:56,218 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 30 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 20:58:56,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-09-12 20:58:56,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-09-12 20:58:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 78 states have internal predecessors, (94), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 20:58:56,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2024-09-12 20:58:56,250 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 74 [2024-09-12 20:58:56,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:58:56,251 INFO L474 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2024-09-12 20:58:56,251 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 2.411764705882353) internal successors, (82), 33 states have internal predecessors, (82), 10 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-09-12 20:58:56,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2024-09-12 20:58:56,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-09-12 20:58:56,252 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:58:56,252 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 7, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 20:58:56,265 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-12 20:58:56,452 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-12 20:58:56,453 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:58:56,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:58:56,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1023722515, now seen corresponding path program 4 times [2024-09-12 20:58:56,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:58:56,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344541792] [2024-09-12 20:58:56,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:58:56,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:58:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:56,741 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 20:58:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:56,752 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 20:58:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:58,147 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-12 20:58:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:58,149 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-12 20:58:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:58:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 27 proven. 152 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-09-12 20:58:58,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:58:58,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344541792] [2024-09-12 20:58:58,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344541792] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 20:58:58,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180046672] [2024-09-12 20:58:58,152 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 20:58:58,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:58:58,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:58:58,155 INFO L229 MonitoredProcess]: Starting monitored process 12 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:58,156 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-12 20:58:58,274 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 20:58:58,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 20:58:58,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-09-12 20:58:58,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:58:58,460 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 28 treesize of output 7 [2024-09-12 20:58:58,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 20:58:58,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 47 [2024-09-12 20:58:58,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 20:58:58,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 53 treesize of output 17 [2024-09-12 20:58:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 84 proven. 122 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-09-12 20:58:58,936 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 20:59:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 164 proven. 24 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-09-12 20:59:03,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180046672] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 20:59:03,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 20:59:03,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22, 15] total 60 [2024-09-12 20:59:03,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121917353] [2024-09-12 20:59:03,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 20:59:03,904 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-09-12 20:59:03,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:59:03,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-09-12 20:59:03,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=3216, Unknown=1, NotChecked=0, Total=3540 [2024-09-12 20:59:03,906 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 58 states have internal predecessors, (119), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-12 20:59:14,302 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 20:59:18,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 20:59:30,462 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 20:59:43,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 20:59:47,699 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:00:05,122 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:09,371 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:13,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:00:26,918 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:30,950 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,392 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,417 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:01:11,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:01:30,098 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:01:34,159 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:01:38,186 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:01:58,214 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:02:24,773 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_SelectionSort_~lh~0 4))) (let ((.cse1 (select |c_#memory_int#1| |c_~#array~0.base|)) (.cse8 (+ .cse7 |c_~#array~0.offset|))) (let ((.cse4 (+ 5 c_SelectionSort_~lh~0)) (.cse2 (+ .cse7 |c_~#array~0.offset| 8)) (.cse5 (* c_SelectionSort_~i~0 4)) (.cse3 (select .cse1 .cse8))) (and (= |c_~#array~0.base| |c_old(~#array~0.base)|) (let ((.cse0 (= |c_#memory_int#1| |c_old(#memory_int#1)|))) (or (and (= (+ c_SelectionSort_~lh~0 3) c_SelectionSort_~rh~0) (or (and .cse0 (= 3 c_SelectionSort_~rh~0) (not (= (select .cse1 (+ |c_~#array~0.offset| 12)) 0))) (< (select .cse1 .cse2) .cse3))) (and .cse0 (not (= (select .cse1 (+ |c_~#array~0.offset| 8)) 0))) (< c_SelectionSort_~i~0 .cse4))) (= |c_old(~#array~0.offset)| |c_~#array~0.offset|) (< (select .cse1 (+ (* 4 c_SelectionSort_~rh~0) |c_~#array~0.offset|)) (+ (select .cse1 (+ |c_~#array~0.offset| .cse5)) 1)) (<= c_SelectionSort_~i~0 .cse4) (= |c_old(~n~0)| c_~n~0) (forall ((v_ArrVal_626 Int)) (or (let ((.cse6 (let ((.cse9 (+ |c_~#array~0.offset| .cse5 4))) (store (store .cse1 .cse8 (select .cse1 .cse9)) .cse9 v_ArrVal_626)))) (< (select .cse6 .cse2) (+ (select .cse6 (+ .cse7 |c_~#array~0.offset| 12)) 1))) (< v_ArrVal_626 .cse3))))))) is different from false [2024-09-12 21:02:42,097 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:02:55,563 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:17,022 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:03:18,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:03:22,712 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,363 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:40,442 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:44,480 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:58,675 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:02,692 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:12,527 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_SelectionSort_~lh~0 4))) (let ((.cse6 (+ |c_~#array~0.offset| (* c_SelectionSort_~i~0 4))) (.cse10 (+ (* 4 c_SelectionSort_~rh~0) |c_~#array~0.offset|)) (.cse3 (select |c_#memory_int#1| |c_~#array~0.base|)) (.cse4 (+ .cse11 |c_~#array~0.offset|))) (let ((.cse7 (select .cse3 .cse4)) (.cse2 (+ .cse11 |c_~#array~0.offset| 12)) (.cse9 (select .cse3 .cse10)) (.cse5 (select .cse3 .cse6)) (.cse1 (+ .cse11 |c_~#array~0.offset| 8))) (and (= |c_~#array~0.base| |c_old(~#array~0.base)|) (forall ((v_ArrVal_626 Int)) (or (let ((.cse0 (store (store .cse3 .cse4 .cse5) .cse6 v_ArrVal_626))) (< (select .cse0 .cse1) (+ (select .cse0 .cse2) 1))) (< v_ArrVal_626 .cse7))) (= |c_old(~#array~0.offset)| |c_~#array~0.offset|) (forall ((v_ArrVal_626 Int)) (or (< v_ArrVal_626 .cse7) (let ((.cse8 (store (store .cse3 .cse4 .cse9) .cse10 v_ArrVal_626))) (< (select .cse8 .cse1) (+ (select .cse8 .cse2) 1))))) (< .cse9 (+ .cse5 1)) (< (select .cse3 (+ .cse11 |c_~#array~0.offset| 4)) (+ (select .cse3 .cse1) 1)) (= |c_old(~n~0)| c_~n~0))))) is different from false [2024-09-12 21:04:21,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:04:21,931 INFO L93 Difference]: Finished difference Result 829 states and 1164 transitions. [2024-09-12 21:04:21,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 274 states. [2024-09-12 21:04:21,931 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 58 states have internal predecessors, (119), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 81 [2024-09-12 21:04:21,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:04:21,934 INFO L225 Difference]: With dead ends: 829 [2024-09-12 21:04:21,934 INFO L226 Difference]: Without dead ends: 603 [2024-09-12 21:04:21,945 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 326 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 42898 ImplicationChecksByTransitivity, 210.8s TimeCoverageRelationStatistics Valid=8260, Invalid=97670, Unknown=28, NotChecked=1298, Total=107256 [2024-09-12 21:04:21,946 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 1122 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 4364 mSolverCounterSat, 260 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 111.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 4764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 4364 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 112.3s IncrementalHoareTripleChecker+Time [2024-09-12 21:04:21,946 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 26 Invalid, 4764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 4364 Invalid, 24 Unknown, 116 Unchecked, 112.3s Time] [2024-09-12 21:04:21,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-09-12 21:04:22,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 338. [2024-09-12 21:04:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 326 states have (on average 1.3865030674846626) internal successors, (452), 327 states have internal predecessors, (452), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 21:04:22,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 463 transitions. [2024-09-12 21:04:22,119 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 463 transitions. Word has length 81 [2024-09-12 21:04:22,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:04:22,119 INFO L474 AbstractCegarLoop]: Abstraction has 338 states and 463 transitions. [2024-09-12 21:04:22,119 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 58 states have internal predecessors, (119), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-12 21:04:22,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:04:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 463 transitions. [2024-09-12 21:04:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-09-12 21:04:22,121 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:04:22,121 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:04:22,135 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-09-12 21:04:22,321 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-12 21:04:22,321 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:04:22,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:04:22,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1332082735, now seen corresponding path program 5 times [2024-09-12 21:04:22,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:04:22,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111447581] [2024-09-12 21:04:22,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:04:22,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:04:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:04:22,623 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:04:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:04:22,637 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 21:04:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:04:23,231 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-12 21:04:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:04:23,234 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-12 21:04:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:04:23,237 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 4 proven. 129 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-09-12 21:04:23,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:04:23,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111447581] [2024-09-12 21:04:23,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111447581] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:04:23,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256866047] [2024-09-12 21:04:23,237 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-12 21:04:23,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:04:23,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:04:23,240 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:04:23,242 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-12 21:04:23,353 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-09-12 21:04:23,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:04:23,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-12 21:04:23,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:04:23,460 INFO L349 Elim1Store]: treesize reduction 28, result has 37.8 percent of original size [2024-09-12 21:04:23,460 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 1 case distinctions, treesize of input 41 treesize of output 17 [2024-09-12 21:04:23,851 INFO L349 Elim1Store]: treesize reduction 119, result has 23.7 percent of original size [2024-09-12 21:04:23,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 40 [2024-09-12 21:04:23,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 21:04:23,964 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 46 treesize of output 10 [2024-09-12 21:04:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 154 proven. 38 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-09-12 21:04:23,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:04:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 162 proven. 19 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-09-12 21:04:37,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256866047] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:04:37,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:04:37,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 15] total 48 [2024-09-12 21:04:37,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072464571] [2024-09-12 21:04:37,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:04:37,842 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-09-12 21:04:37,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:04:37,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-09-12 21:04:37,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2050, Unknown=3, NotChecked=0, Total=2256 [2024-09-12 21:04:37,844 INFO L87 Difference]: Start difference. First operand 338 states and 463 transitions. Second operand has 48 states, 48 states have (on average 2.0) internal successors, (96), 46 states have internal predecessors, (96), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-12 21:05:43,200 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (* c_SelectionSort_~lh~0 4))) (let ((.cse2 (+ .cse18 |c_~#array~0.offset| 4)) (.cse3 (+ .cse18 |c_~#array~0.offset| 8)) (.cse5 (+ .cse18 |c_~#array~0.offset|)) (.cse4 (select |c_#memory_int#1| |c_~#array~0.base|)) (.cse15 (+ (* 4 c_SelectionSort_~rh~0) |c_~#array~0.offset|))) (let ((.cse0 (+ 2 c_SelectionSort_~rh~0)) (.cse7 (+ c_SelectionSort_~i~0 1)) (.cse10 (select .cse4 .cse15)) (.cse8 (forall ((v_SelectionSort_~rh~0_242 Int) (v_ArrVal_703 Int)) (or (let ((.cse16 (let ((.cse17 (+ |c_~#array~0.offset| (* v_SelectionSort_~rh~0_242 4)))) (store (store .cse4 .cse5 (select .cse4 .cse17)) .cse17 v_ArrVal_703)))) (< (select .cse16 .cse2) (+ (select .cse16 .cse3) 1))) (< (+ v_SelectionSort_~rh~0_242 1) c_~n~0)))) (.cse9 (select .cse4 (+ |c_~#array~0.offset| (* c_~n~0 4) (- 8)))) (.cse11 (not (= (+ c_SelectionSort_~i~0 3) c_~n~0)))) (and (= |c_~#array~0.base| |c_old(~#array~0.base)|) (= |c_old(~#array~0.offset)| |c_~#array~0.offset|) (<= c_SelectionSort_~i~0 .cse0) (or (forall ((v_SelectionSort_~rh~0_242 Int) (v_ArrVal_703 Int)) (or (let ((.cse1 (let ((.cse6 (+ |c_~#array~0.offset| (* v_SelectionSort_~rh~0_242 4)))) (store (store .cse4 .cse5 (select .cse4 .cse6)) .cse6 v_ArrVal_703)))) (< (select .cse1 .cse2) (+ (select .cse1 .cse3) 1))) (< v_SelectionSort_~rh~0_242 .cse7))) (not (= (+ c_SelectionSort_~i~0 2) c_~n~0))) (or .cse8 (< .cse9 .cse10) .cse11) (<= .cse0 c_~n~0) (= |c_old(~n~0)| c_~n~0) (or (< .cse7 c_~n~0) (forall ((v_SelectionSort_~rh~0_242 Int) (v_ArrVal_703 Int)) (or (let ((.cse12 (let ((.cse13 (+ |c_~#array~0.offset| (* v_SelectionSort_~rh~0_242 4)))) (store (store .cse4 .cse5 (select .cse4 .cse13)) .cse13 v_ArrVal_703)))) (< (select .cse12 .cse2) (+ (select .cse12 .cse3) 1))) (< v_SelectionSort_~rh~0_242 c_SelectionSort_~i~0)))) (forall ((v_ArrVal_703 Int)) (let ((.cse14 (store (store .cse4 .cse5 .cse10) .cse15 v_ArrVal_703))) (< (select .cse14 .cse2) (+ (select .cse14 .cse3) 1)))) (or .cse8 (< .cse9 (select .cse4 (+ |c_~#array~0.offset| (* c_SelectionSort_~i~0 4)))) .cse11))))) is different from false [2024-09-12 21:05:52,409 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:56,461 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:14,408 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (* c_SelectionSort_~lh~0 4))) (let ((.cse1 (+ .cse17 |c_~#array~0.offset| 4)) (.cse2 (+ .cse17 |c_~#array~0.offset| 8)) (.cse4 (+ .cse17 |c_~#array~0.offset|)) (.cse3 (select |c_#memory_int#1| |c_~#array~0.base|)) (.cse14 (+ (* 4 c_SelectionSort_~rh~0) |c_~#array~0.offset|))) (let ((.cse6 (+ c_SelectionSort_~i~0 1)) (.cse9 (select .cse3 .cse14)) (.cse7 (forall ((v_SelectionSort_~rh~0_242 Int) (v_ArrVal_703 Int)) (or (let ((.cse15 (let ((.cse16 (+ |c_~#array~0.offset| (* v_SelectionSort_~rh~0_242 4)))) (store (store .cse3 .cse4 (select .cse3 .cse16)) .cse16 v_ArrVal_703)))) (< (select .cse15 .cse1) (+ (select .cse15 .cse2) 1))) (< (+ v_SelectionSort_~rh~0_242 1) c_~n~0)))) (.cse8 (select .cse3 (+ |c_~#array~0.offset| (* c_~n~0 4) (- 8)))) (.cse10 (not (= (+ c_SelectionSort_~i~0 3) c_~n~0)))) (and (= |c_~#array~0.base| |c_old(~#array~0.base)|) (= |c_old(~#array~0.offset)| |c_~#array~0.offset|) (or (forall ((v_SelectionSort_~rh~0_242 Int) (v_ArrVal_703 Int)) (or (let ((.cse0 (let ((.cse5 (+ |c_~#array~0.offset| (* v_SelectionSort_~rh~0_242 4)))) (store (store .cse3 .cse4 (select .cse3 .cse5)) .cse5 v_ArrVal_703)))) (< (select .cse0 .cse1) (+ (select .cse0 .cse2) 1))) (< v_SelectionSort_~rh~0_242 .cse6))) (not (= (+ c_SelectionSort_~i~0 2) c_~n~0))) (<= .cse6 c_~n~0) (or .cse7 (< .cse8 .cse9) .cse10) (= |c_old(~n~0)| c_~n~0) (or (< .cse6 c_~n~0) (forall ((v_SelectionSort_~rh~0_242 Int) (v_ArrVal_703 Int)) (or (let ((.cse11 (let ((.cse12 (+ |c_~#array~0.offset| (* v_SelectionSort_~rh~0_242 4)))) (store (store .cse3 .cse4 (select .cse3 .cse12)) .cse12 v_ArrVal_703)))) (< (select .cse11 .cse1) (+ (select .cse11 .cse2) 1))) (< v_SelectionSort_~rh~0_242 c_SelectionSort_~i~0)))) (forall ((v_ArrVal_703 Int)) (let ((.cse13 (store (store .cse3 .cse4 .cse9) .cse14 v_ArrVal_703))) (< (select .cse13 .cse1) (+ (select .cse13 .cse2) 1)))) (or .cse7 (< .cse8 (select .cse3 (+ |c_~#array~0.offset| (* c_SelectionSort_~i~0 4)))) .cse10) (= c_SelectionSort_~i~0 (+ c_SelectionSort_~rh~0 1)))))) is different from false [2024-09-12 21:06:52,228 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:23,846 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:27,883 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:31,910 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:35,917 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:39,971 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:07:43,999 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:48,037 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:52,047 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:56,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 [1] [2024-09-12 21:08:00,127 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:04,148 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:08,177 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:08:12,196 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:16,288 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:08:20,842 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:25,674 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:34,125 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:46,451 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:08:50,491 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:54,513 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:09:03,071 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,297 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,367 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:09:15,408 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:19,614 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:31,875 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:35,918 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:39,958 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:45,856 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:49,885 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:10:43,222 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:55,443 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:03,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:11:08,001 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:11:12,013 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:16,059 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:11:20,209 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:24,334 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:28,497 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:32,602 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:36,899 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:40,920 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:11:45,155 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:49,202 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:11:53,252 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:11:57,299 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:01,353 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:05,374 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:12:09,423 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:13,471 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:17,518 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:21,568 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:25,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:12:29,677 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:33,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 21:12:37,784 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:41,836 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:45,884 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:49,933 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] Killed by 15