./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/heapsort.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 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/loop-invgen/heapsort.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 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:17:14,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:17:14,100 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:17:14,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:17:14,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:17:14,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:17:14,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:17:14,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:17:14,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:17:14,133 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:17:14,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:17:14,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:17:14,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:17:14,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:17:14,135 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:17:14,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:17:14,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:17:14,136 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:17:14,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:17:14,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:17:14,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:17:14,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:17:14,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:17:14,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:17:14,137 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:17:14,137 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:17:14,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:17:14,137 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:17:14,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:17:14,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:17:14,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:17:14,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:17:14,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:17:14,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:17:14,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:17:14,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:17:14,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:17:14,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:17:14,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:17:14,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:17:14,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:17:14,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:17:14,141 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 -> 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 14:17:14,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:17:14,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:17:14,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:17:14,403 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:17:14,404 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:17:14,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/heapsort.i [2024-10-15 14:17:15,583 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:17:15,762 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:17:15,763 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/heapsort.i [2024-10-15 14:17:15,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/74a217f17/09f61551033143129b0c0c22f3878745/FLAG5f19a53db [2024-10-15 14:17:16,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/74a217f17/09f61551033143129b0c0c22f3878745 [2024-10-15 14:17:16,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:17:16,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:17:16,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:17:16,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:17:16,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:17:16,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:17:16" (1/1) ... [2024-10-15 14:17:16,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55b4b49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:16, skipping insertion in model container [2024-10-15 14:17:16,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:17:16" (1/1) ... [2024-10-15 14:17:16,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:17:16,346 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2024-10-15 14:17:16,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:17:16,378 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:17:16,389 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2024-10-15 14:17:16,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:17:16,415 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:17:16,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:16 WrapperNode [2024-10-15 14:17:16,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:17:16,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:17:16,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:17:16,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:17:16,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:16" (1/1) ... [2024-10-15 14:17:16,431 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:16" (1/1) ... [2024-10-15 14:17:16,437 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:17:16,439 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:17:16,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:17:16,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:17:16,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:17:16,448 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:16" (1/1) ... [2024-10-15 14:17:16,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:16" (1/1) ... [2024-10-15 14:17:16,450 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:16" (1/1) ... [2024-10-15 14:17:16,465 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-15 14:17:16,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:16" (1/1) ... [2024-10-15 14:17:16,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:16" (1/1) ... [2024-10-15 14:17:16,472 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:16" (1/1) ... [2024-10-15 14:17:16,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:16" (1/1) ... [2024-10-15 14:17:16,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:16" (1/1) ... [2024-10-15 14:17:16,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:16" (1/1) ... [2024-10-15 14:17:16,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:17:16,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:17:16,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:17:16,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:17:16,481 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:16" (1/1) ... [2024-10-15 14:17:16,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:17:16,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:17:16,509 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-10-15 14:17:16,511 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-10-15 14:17:16,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:17:16,548 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:17:16,548 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:17:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:17:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:17:16,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:17:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:17:16,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:17:16,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 14:17:16,551 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 14:17:16,603 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:17:16,605 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:17:16,784 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-15 14:17:16,784 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:17:16,802 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:17:16,802 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 14:17:16,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:17:16 BoogieIcfgContainer [2024-10-15 14:17:16,803 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:17:16,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:17:16,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:17:16,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:17:16,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:17:16" (1/3) ... [2024-10-15 14:17:16,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27160048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:17:16, skipping insertion in model container [2024-10-15 14:17:16,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:16" (2/3) ... [2024-10-15 14:17:16,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27160048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:17:16, skipping insertion in model container [2024-10-15 14:17:16,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:17:16" (3/3) ... [2024-10-15 14:17:16,809 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort.i [2024-10-15 14:17:16,822 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:17:16,822 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 14:17:16,863 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:17:16,868 INFO L333 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;@75ff9b10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:17:16,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 14:17:16,871 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-15 14:17:16,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-15 14:17:16,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:16,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:16,878 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:16,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:16,883 INFO L85 PathProgramCache]: Analyzing trace with hash 855475308, now seen corresponding path program 1 times [2024-10-15 14:17:16,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:16,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861775024] [2024-10-15 14:17:16,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:16,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:17,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:17,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:17,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861775024] [2024-10-15 14:17:17,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861775024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:17,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:17,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:17:17,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352748466] [2024-10-15 14:17:17,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:17,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:17,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:17,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:17,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:17,218 INFO L87 Difference]: Start difference. First operand has 43 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:17:17,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:17,468 INFO L93 Difference]: Finished difference Result 113 states and 211 transitions. [2024-10-15 14:17:17,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:17,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-15 14:17:17,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:17,478 INFO L225 Difference]: With dead ends: 113 [2024-10-15 14:17:17,478 INFO L226 Difference]: Without dead ends: 69 [2024-10-15 14:17:17,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:17:17,485 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 34 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:17,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 293 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:17:17,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-15 14:17:17,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2024-10-15 14:17:17,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 26 states have call successors, (26), 4 states have call predecessors, (26), 3 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-15 14:17:17,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2024-10-15 14:17:17,529 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 14 [2024-10-15 14:17:17,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:17,530 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2024-10-15 14:17:17,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:17:17,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:17,531 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2024-10-15 14:17:17,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-15 14:17:17,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:17,532 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:17,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:17:17,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:17,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:17,533 INFO L85 PathProgramCache]: Analyzing trace with hash 843231207, now seen corresponding path program 1 times [2024-10-15 14:17:17,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:17,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733993165] [2024-10-15 14:17:17,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:17,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:17,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:17,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:17,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733993165] [2024-10-15 14:17:17,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733993165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:17,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:17,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:17:17,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712618886] [2024-10-15 14:17:17,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:17,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:17,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:17,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:17,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:17,695 INFO L87 Difference]: Start difference. First operand 59 states and 91 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:17:17,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:17,867 INFO L93 Difference]: Finished difference Result 117 states and 183 transitions. [2024-10-15 14:17:17,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:17,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-15 14:17:17,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:17,870 INFO L225 Difference]: With dead ends: 117 [2024-10-15 14:17:17,872 INFO L226 Difference]: Without dead ends: 115 [2024-10-15 14:17:17,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:17:17,874 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 29 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:17,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 209 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:17,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-15 14:17:17,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2024-10-15 14:17:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 52 states have internal predecessors, (72), 48 states have call successors, (48), 6 states have call predecessors, (48), 5 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-15 14:17:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 167 transitions. [2024-10-15 14:17:17,898 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 167 transitions. Word has length 14 [2024-10-15 14:17:17,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:17,898 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 167 transitions. [2024-10-15 14:17:17,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:17:17,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:17,900 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 167 transitions. [2024-10-15 14:17:17,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-15 14:17:17,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:17,901 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:17,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 14:17:17,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:17,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:17,903 INFO L85 PathProgramCache]: Analyzing trace with hash 842919880, now seen corresponding path program 1 times [2024-10-15 14:17:17,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:17,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530812895] [2024-10-15 14:17:17,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:17,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:17,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:17,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:17:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:18,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:18,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530812895] [2024-10-15 14:17:18,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530812895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:18,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:18,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:17:18,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963942516] [2024-10-15 14:17:18,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:18,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:18,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:18,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:18,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:18,010 INFO L87 Difference]: Start difference. First operand 106 states and 167 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 14:17:18,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:18,164 INFO L93 Difference]: Finished difference Result 161 states and 257 transitions. [2024-10-15 14:17:18,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:17:18,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 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 19 [2024-10-15 14:17:18,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:18,168 INFO L225 Difference]: With dead ends: 161 [2024-10-15 14:17:18,168 INFO L226 Difference]: Without dead ends: 159 [2024-10-15 14:17:18,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:17:18,169 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 31 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:18,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 200 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:18,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-15 14:17:18,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 142. [2024-10-15 14:17:18,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 63 states have (on average 1.380952380952381) internal successors, (87), 67 states have internal predecessors, (87), 72 states have call successors, (72), 7 states have call predecessors, (72), 6 states have return successors, (71), 67 states have call predecessors, (71), 71 states have call successors, (71) [2024-10-15 14:17:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 230 transitions. [2024-10-15 14:17:18,196 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 230 transitions. Word has length 19 [2024-10-15 14:17:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:18,196 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 230 transitions. [2024-10-15 14:17:18,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 14:17:18,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 230 transitions. [2024-10-15 14:17:18,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-15 14:17:18,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:18,197 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:18,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 14:17:18,198 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:18,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:18,198 INFO L85 PathProgramCache]: Analyzing trace with hash 303375166, now seen corresponding path program 1 times [2024-10-15 14:17:18,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:18,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532730966] [2024-10-15 14:17:18,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:18,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:18,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:18,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:17:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:18,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:18,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532730966] [2024-10-15 14:17:18,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532730966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:18,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:18,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:18,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154457986] [2024-10-15 14:17:18,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:18,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:18,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:18,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:18,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:18,312 INFO L87 Difference]: Start difference. First operand 142 states and 230 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 14:17:18,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:18,516 INFO L93 Difference]: Finished difference Result 208 states and 342 transitions. [2024-10-15 14:17:18,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:18,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 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 19 [2024-10-15 14:17:18,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:18,523 INFO L225 Difference]: With dead ends: 208 [2024-10-15 14:17:18,525 INFO L226 Difference]: Without dead ends: 206 [2024-10-15 14:17:18,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:17:18,527 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 43 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:18,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 221 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:18,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-15 14:17:18,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2024-10-15 14:17:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 94 states have internal predecessors, (122), 108 states have call successors, (108), 8 states have call predecessors, (108), 7 states have return successors, (107), 100 states have call predecessors, (107), 107 states have call successors, (107) [2024-10-15 14:17:18,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 337 transitions. [2024-10-15 14:17:18,590 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 337 transitions. Word has length 19 [2024-10-15 14:17:18,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:18,591 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 337 transitions. [2024-10-15 14:17:18,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 14:17:18,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:18,592 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 337 transitions. [2024-10-15 14:17:18,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-15 14:17:18,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:18,594 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:18,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-15 14:17:18,595 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:18,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:18,595 INFO L85 PathProgramCache]: Analyzing trace with hash -283430848, now seen corresponding path program 1 times [2024-10-15 14:17:18,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:18,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237377374] [2024-10-15 14:17:18,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:18,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:18,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:18,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:17:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:18,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:18,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237377374] [2024-10-15 14:17:18,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237377374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:18,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:18,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 14:17:18,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508340081] [2024-10-15 14:17:18,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:18,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-15 14:17:18,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:18,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 14:17:18,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 14:17:18,627 INFO L87 Difference]: Start difference. First operand 203 states and 337 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 14:17:18,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:18,716 INFO L93 Difference]: Finished difference Result 387 states and 649 transitions. [2024-10-15 14:17:18,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 14:17:18,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (4), 2 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 19 [2024-10-15 14:17:18,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:18,720 INFO L225 Difference]: With dead ends: 387 [2024-10-15 14:17:18,721 INFO L226 Difference]: Without dead ends: 305 [2024-10-15 14:17:18,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 14:17:18,723 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 11 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:18,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 134 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:17:18,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-15 14:17:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 250. [2024-10-15 14:17:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 106 states have (on average 1.4150943396226414) internal successors, (150), 114 states have internal predecessors, (150), 136 states have call successors, (136), 8 states have call predecessors, (136), 7 states have return successors, (135), 127 states have call predecessors, (135), 135 states have call successors, (135) [2024-10-15 14:17:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 421 transitions. [2024-10-15 14:17:18,790 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 421 transitions. Word has length 19 [2024-10-15 14:17:18,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:18,790 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 421 transitions. [2024-10-15 14:17:18,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 14:17:18,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:18,791 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 421 transitions. [2024-10-15 14:17:18,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-15 14:17:18,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:18,792 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:18,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-15 14:17:18,792 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:18,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:18,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1858602097, now seen corresponding path program 1 times [2024-10-15 14:17:18,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:18,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565316813] [2024-10-15 14:17:18,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:18,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:18,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:18,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:17:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:18,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:17:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:18,870 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 14:17:18,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:18,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565316813] [2024-10-15 14:17:18,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565316813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:18,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:18,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:17:18,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898819144] [2024-10-15 14:17:18,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:18,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:18,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:18,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:18,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:18,872 INFO L87 Difference]: Start difference. First operand 250 states and 421 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-15 14:17:19,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:19,025 INFO L93 Difference]: Finished difference Result 338 states and 568 transitions. [2024-10-15 14:17:19,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:19,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-10-15 14:17:19,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:19,029 INFO L225 Difference]: With dead ends: 338 [2024-10-15 14:17:19,029 INFO L226 Difference]: Without dead ends: 336 [2024-10-15 14:17:19,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:17:19,030 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 42 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:19,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 248 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:19,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-10-15 14:17:19,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 304. [2024-10-15 14:17:19,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 132 states have (on average 1.4242424242424243) internal successors, (188), 146 states have internal predecessors, (188), 162 states have call successors, (162), 10 states have call predecessors, (162), 9 states have return successors, (161), 147 states have call predecessors, (161), 161 states have call successors, (161) [2024-10-15 14:17:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 511 transitions. [2024-10-15 14:17:19,103 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 511 transitions. Word has length 26 [2024-10-15 14:17:19,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:19,103 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 511 transitions. [2024-10-15 14:17:19,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-15 14:17:19,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:19,104 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 511 transitions. [2024-10-15 14:17:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-15 14:17:19,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:19,105 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:19,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-15 14:17:19,105 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:19,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:19,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1261754835, now seen corresponding path program 1 times [2024-10-15 14:17:19,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:19,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936969468] [2024-10-15 14:17:19,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:19,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:19,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:19,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:17:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:19,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:17:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:19,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-15 14:17:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 14:17:19,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:19,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936969468] [2024-10-15 14:17:19,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936969468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:19,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:19,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:17:19,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339644020] [2024-10-15 14:17:19,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:19,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:19,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:19,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:19,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:19,179 INFO L87 Difference]: Start difference. First operand 304 states and 511 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 14:17:19,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:19,365 INFO L93 Difference]: Finished difference Result 370 states and 611 transitions. [2024-10-15 14:17:19,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:17:19,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-10-15 14:17:19,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:19,368 INFO L225 Difference]: With dead ends: 370 [2024-10-15 14:17:19,368 INFO L226 Difference]: Without dead ends: 368 [2024-10-15 14:17:19,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:17:19,369 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 25 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:19,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 251 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:19,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-15 14:17:19,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 344. [2024-10-15 14:17:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 146 states have (on average 1.4109589041095891) internal successors, (206), 164 states have internal predecessors, (206), 186 states have call successors, (186), 12 states have call predecessors, (186), 11 states have return successors, (185), 167 states have call predecessors, (185), 185 states have call successors, (185) [2024-10-15 14:17:19,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 577 transitions. [2024-10-15 14:17:19,426 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 577 transitions. Word has length 29 [2024-10-15 14:17:19,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:19,426 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 577 transitions. [2024-10-15 14:17:19,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 14:17:19,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:19,427 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 577 transitions. [2024-10-15 14:17:19,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-15 14:17:19,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:19,427 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:19,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-15 14:17:19,428 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:19,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:19,428 INFO L85 PathProgramCache]: Analyzing trace with hash 887335745, now seen corresponding path program 1 times [2024-10-15 14:17:19,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:19,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121893248] [2024-10-15 14:17:19,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:19,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:19,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:19,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:17:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:19,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:17:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:19,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 14:17:19,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:19,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121893248] [2024-10-15 14:17:19,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121893248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:19,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:19,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:17:19,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620096707] [2024-10-15 14:17:19,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:19,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:17:19,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:19,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:17:19,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:17:19,484 INFO L87 Difference]: Start difference. First operand 344 states and 577 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-15 14:17:19,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:19,729 INFO L93 Difference]: Finished difference Result 795 states and 1334 transitions. [2024-10-15 14:17:19,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:19,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-10-15 14:17:19,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:19,737 INFO L225 Difference]: With dead ends: 795 [2024-10-15 14:17:19,737 INFO L226 Difference]: Without dead ends: 540 [2024-10-15 14:17:19,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:19,740 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 53 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:19,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 183 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:19,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-10-15 14:17:19,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 345. [2024-10-15 14:17:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 147 states have (on average 1.401360544217687) internal successors, (206), 165 states have internal predecessors, (206), 186 states have call successors, (186), 12 states have call predecessors, (186), 11 states have return successors, (185), 167 states have call predecessors, (185), 185 states have call successors, (185) [2024-10-15 14:17:19,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 577 transitions. [2024-10-15 14:17:19,844 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 577 transitions. Word has length 28 [2024-10-15 14:17:19,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:19,845 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 577 transitions. [2024-10-15 14:17:19,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-15 14:17:19,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:19,846 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 577 transitions. [2024-10-15 14:17:19,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-15 14:17:19,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:19,847 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:19,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-15 14:17:19,848 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:19,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:19,849 INFO L85 PathProgramCache]: Analyzing trace with hash 969267811, now seen corresponding path program 1 times [2024-10-15 14:17:19,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:19,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185030734] [2024-10-15 14:17:19,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:19,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:19,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:19,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:17:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:19,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:17:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:19,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:17:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:19,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 14:17:19,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:19,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185030734] [2024-10-15 14:17:19,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185030734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:19,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:19,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:19,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28905342] [2024-10-15 14:17:19,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:19,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:19,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:19,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:19,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:19,965 INFO L87 Difference]: Start difference. First operand 345 states and 577 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 14:17:20,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:20,201 INFO L93 Difference]: Finished difference Result 542 states and 924 transitions. [2024-10-15 14:17:20,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:20,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2024-10-15 14:17:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:20,206 INFO L225 Difference]: With dead ends: 542 [2024-10-15 14:17:20,206 INFO L226 Difference]: Without dead ends: 540 [2024-10-15 14:17:20,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:17:20,207 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 52 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:20,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 271 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:20,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-10-15 14:17:20,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 492. [2024-10-15 14:17:20,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 202 states have (on average 1.4306930693069306) internal successors, (289), 232 states have internal predecessors, (289), 277 states have call successors, (277), 13 states have call predecessors, (277), 12 states have return successors, (276), 246 states have call predecessors, (276), 276 states have call successors, (276) [2024-10-15 14:17:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 842 transitions. [2024-10-15 14:17:20,279 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 842 transitions. Word has length 31 [2024-10-15 14:17:20,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:20,280 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 842 transitions. [2024-10-15 14:17:20,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 14:17:20,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:20,280 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 842 transitions. [2024-10-15 14:17:20,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-15 14:17:20,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:20,281 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:20,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-15 14:17:20,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:20,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:20,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1109816421, now seen corresponding path program 1 times [2024-10-15 14:17:20,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:20,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855137016] [2024-10-15 14:17:20,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:20,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:20,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:20,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:17:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:20,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:17:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:20,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:17:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:20,344 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 14:17:20,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:20,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855137016] [2024-10-15 14:17:20,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855137016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:20,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:20,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:20,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4840706] [2024-10-15 14:17:20,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:20,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:20,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:20,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:20,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:20,346 INFO L87 Difference]: Start difference. First operand 492 states and 842 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 14:17:20,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:20,557 INFO L93 Difference]: Finished difference Result 562 states and 954 transitions. [2024-10-15 14:17:20,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:17:20,557 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2024-10-15 14:17:20,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:20,563 INFO L225 Difference]: With dead ends: 562 [2024-10-15 14:17:20,563 INFO L226 Difference]: Without dead ends: 560 [2024-10-15 14:17:20,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:17:20,564 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 75 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:20,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 208 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:20,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-10-15 14:17:20,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 499. [2024-10-15 14:17:20,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 205 states have (on average 1.424390243902439) internal successors, (292), 235 states have internal predecessors, (292), 280 states have call successors, (280), 14 states have call predecessors, (280), 13 states have return successors, (279), 249 states have call predecessors, (279), 279 states have call successors, (279) [2024-10-15 14:17:20,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 851 transitions. [2024-10-15 14:17:20,661 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 851 transitions. Word has length 31 [2024-10-15 14:17:20,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:20,661 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 851 transitions. [2024-10-15 14:17:20,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 14:17:20,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:20,662 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 851 transitions. [2024-10-15 14:17:20,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-15 14:17:20,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:20,664 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:20,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-15 14:17:20,664 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:20,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:20,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1192529802, now seen corresponding path program 1 times [2024-10-15 14:17:20,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:20,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460997438] [2024-10-15 14:17:20,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:20,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:20,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:20,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:17:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:20,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:17:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:20,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-15 14:17:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:20,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-15 14:17:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:20,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-15 14:17:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-15 14:17:20,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:20,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460997438] [2024-10-15 14:17:20,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460997438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:20,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:20,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:20,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776783626] [2024-10-15 14:17:20,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:20,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:20,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:20,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:20,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:20,756 INFO L87 Difference]: Start difference. First operand 499 states and 851 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-15 14:17:21,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:21,027 INFO L93 Difference]: Finished difference Result 557 states and 928 transitions. [2024-10-15 14:17:21,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:21,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2024-10-15 14:17:21,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:21,031 INFO L225 Difference]: With dead ends: 557 [2024-10-15 14:17:21,032 INFO L226 Difference]: Without dead ends: 555 [2024-10-15 14:17:21,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:17:21,033 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 35 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:21,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 259 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:21,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-10-15 14:17:21,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 503. [2024-10-15 14:17:21,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 208 states have (on average 1.4182692307692308) internal successors, (295), 238 states have internal predecessors, (295), 280 states have call successors, (280), 15 states have call predecessors, (280), 14 states have return successors, (279), 249 states have call predecessors, (279), 279 states have call successors, (279) [2024-10-15 14:17:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 854 transitions. [2024-10-15 14:17:21,143 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 854 transitions. Word has length 41 [2024-10-15 14:17:21,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:21,144 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 854 transitions. [2024-10-15 14:17:21,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-15 14:17:21,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 854 transitions. [2024-10-15 14:17:21,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-15 14:17:21,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:21,146 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:21,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-15 14:17:21,146 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:21,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:21,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2122421222, now seen corresponding path program 1 times [2024-10-15 14:17:21,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:21,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121156073] [2024-10-15 14:17:21,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:21,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:21,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:21,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:17:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:21,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:17:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:21,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:17:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:21,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:17:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:21,217 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 14:17:21,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:21,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121156073] [2024-10-15 14:17:21,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121156073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:21,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:21,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:21,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642015271] [2024-10-15 14:17:21,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:21,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:21,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:21,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:21,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:21,219 INFO L87 Difference]: Start difference. First operand 503 states and 854 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:17:21,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:21,415 INFO L93 Difference]: Finished difference Result 534 states and 893 transitions. [2024-10-15 14:17:21,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:21,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2024-10-15 14:17:21,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:21,421 INFO L225 Difference]: With dead ends: 534 [2024-10-15 14:17:21,422 INFO L226 Difference]: Without dead ends: 532 [2024-10-15 14:17:21,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:17:21,423 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 28 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:21,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 188 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:21,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-10-15 14:17:21,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 511. [2024-10-15 14:17:21,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 214 states have (on average 1.4065420560747663) internal successors, (301), 244 states have internal predecessors, (301), 280 states have call successors, (280), 17 states have call predecessors, (280), 16 states have return successors, (279), 249 states have call predecessors, (279), 279 states have call successors, (279) [2024-10-15 14:17:21,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 860 transitions. [2024-10-15 14:17:21,533 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 860 transitions. Word has length 41 [2024-10-15 14:17:21,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:21,534 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 860 transitions. [2024-10-15 14:17:21,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:17:21,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:21,534 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 860 transitions. [2024-10-15 14:17:21,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-15 14:17:21,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:21,536 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:21,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-15 14:17:21,537 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:21,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:21,537 INFO L85 PathProgramCache]: Analyzing trace with hash 290316784, now seen corresponding path program 1 times [2024-10-15 14:17:21,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:21,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993589669] [2024-10-15 14:17:21,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:21,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:21,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:21,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:17:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:21,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:17:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:21,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:17:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:21,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:17:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:21,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-15 14:17:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:21,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-15 14:17:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-15 14:17:21,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:21,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993589669] [2024-10-15 14:17:21,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993589669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:21,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:21,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:21,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916673242] [2024-10-15 14:17:21,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:21,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:21,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:21,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:21,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:21,617 INFO L87 Difference]: Start difference. First operand 511 states and 860 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-15 14:17:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:21,809 INFO L93 Difference]: Finished difference Result 578 states and 966 transitions. [2024-10-15 14:17:21,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:21,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2024-10-15 14:17:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:21,813 INFO L225 Difference]: With dead ends: 578 [2024-10-15 14:17:21,814 INFO L226 Difference]: Without dead ends: 576 [2024-10-15 14:17:21,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:17:21,815 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 41 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:21,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 234 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:21,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-10-15 14:17:21,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 515. [2024-10-15 14:17:21,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 217 states have (on average 1.400921658986175) internal successors, (304), 247 states have internal predecessors, (304), 280 states have call successors, (280), 18 states have call predecessors, (280), 17 states have return successors, (279), 249 states have call predecessors, (279), 279 states have call successors, (279) [2024-10-15 14:17:21,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 863 transitions. [2024-10-15 14:17:21,930 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 863 transitions. Word has length 53 [2024-10-15 14:17:21,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:21,930 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 863 transitions. [2024-10-15 14:17:21,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-15 14:17:21,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:21,931 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 863 transitions. [2024-10-15 14:17:21,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-15 14:17:21,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:21,932 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:21,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-15 14:17:21,932 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:21,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:21,933 INFO L85 PathProgramCache]: Analyzing trace with hash 822747500, now seen corresponding path program 1 times [2024-10-15 14:17:21,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:21,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066968163] [2024-10-15 14:17:21,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:21,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:21,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:21,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:17:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:21,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:17:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:21,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:17:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:21,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-15 14:17:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:21,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-15 14:17:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:22,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-15 14:17:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:22,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-15 14:17:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:22,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:17:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-15 14:17:22,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:22,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066968163] [2024-10-15 14:17:22,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066968163] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:17:22,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819187811] [2024-10-15 14:17:22,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:22,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:22,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:17:22,013 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-10-15 14:17:22,014 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 14:17:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:22,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 14:17:22,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:17:22,204 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-15 14:17:22,205 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:17:22,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819187811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:22,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:17:22,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-10-15 14:17:22,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881262419] [2024-10-15 14:17:22,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:22,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:22,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:22,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:22,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:17:22,207 INFO L87 Difference]: Start difference. First operand 515 states and 863 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-15 14:17:22,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:22,532 INFO L93 Difference]: Finished difference Result 932 states and 1539 transitions. [2024-10-15 14:17:22,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:22,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 61 [2024-10-15 14:17:22,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:22,538 INFO L225 Difference]: With dead ends: 932 [2024-10-15 14:17:22,538 INFO L226 Difference]: Without dead ends: 476 [2024-10-15 14:17:22,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-15 14:17:22,541 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 34 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:22,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 216 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:22,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-10-15 14:17:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 446. [2024-10-15 14:17:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 196 states have (on average 1.3673469387755102) internal successors, (268), 220 states have internal predecessors, (268), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 207 states have call predecessors, (231), 231 states have call successors, (231) [2024-10-15 14:17:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 731 transitions. [2024-10-15 14:17:22,626 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 731 transitions. Word has length 61 [2024-10-15 14:17:22,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:22,626 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 731 transitions. [2024-10-15 14:17:22,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-15 14:17:22,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 731 transitions. [2024-10-15 14:17:22,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-15 14:17:22,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:22,628 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:22,642 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-15 14:17:22,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-15 14:17:22,829 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:22,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:22,830 INFO L85 PathProgramCache]: Analyzing trace with hash 968879790, now seen corresponding path program 1 times [2024-10-15 14:17:22,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:22,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823119510] [2024-10-15 14:17:22,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:22,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:22,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:22,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:17:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:22,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:17:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:22,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-15 14:17:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:22,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-15 14:17:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:22,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-15 14:17:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:22,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-15 14:17:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:22,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-15 14:17:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:22,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-15 14:17:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:22,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-15 14:17:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:22,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-15 14:17:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:22,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-15 14:17:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:22,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-15 14:17:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-15 14:17:22,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:22,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823119510] [2024-10-15 14:17:22,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823119510] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:17:22,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924105531] [2024-10-15 14:17:22,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:22,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:22,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:17:22,960 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-10-15 14:17:22,961 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 14:17:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:23,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 14:17:23,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:17:23,244 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-10-15 14:17:23,244 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:17:23,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924105531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:23,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:17:23,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2024-10-15 14:17:23,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738117711] [2024-10-15 14:17:23,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:23,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:23,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:23,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:23,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-15 14:17:23,248 INFO L87 Difference]: Start difference. First operand 446 states and 731 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-15 14:17:23,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:23,573 INFO L93 Difference]: Finished difference Result 813 states and 1310 transitions. [2024-10-15 14:17:23,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-15 14:17:23,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 83 [2024-10-15 14:17:23,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:23,578 INFO L225 Difference]: With dead ends: 813 [2024-10-15 14:17:23,578 INFO L226 Difference]: Without dead ends: 375 [2024-10-15 14:17:23,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-10-15 14:17:23,581 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 44 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:23,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 212 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:17:23,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-15 14:17:23,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 340. [2024-10-15 14:17:23,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 155 states have (on average 1.3290322580645162) internal successors, (206), 171 states have internal predecessors, (206), 168 states have call successors, (168), 17 states have call predecessors, (168), 16 states have return successors, (167), 151 states have call predecessors, (167), 167 states have call successors, (167) [2024-10-15 14:17:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 541 transitions. [2024-10-15 14:17:23,659 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 541 transitions. Word has length 83 [2024-10-15 14:17:23,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:23,660 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 541 transitions. [2024-10-15 14:17:23,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-15 14:17:23,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:23,661 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 541 transitions. [2024-10-15 14:17:23,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-15 14:17:23,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:23,662 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:23,675 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-15 14:17:23,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-15 14:17:23,866 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:23,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:23,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1787747476, now seen corresponding path program 1 times [2024-10-15 14:17:23,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:23,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612818505] [2024-10-15 14:17:23,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:23,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:23,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:23,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:17:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:23,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:17:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:23,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-15 14:17:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:23,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-15 14:17:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:23,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-15 14:17:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:23,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-15 14:17:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-15 14:17:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-15 14:17:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-15 14:17:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-15 14:17:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-15 14:17:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-15 14:17:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,019 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-15 14:17:24,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:24,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612818505] [2024-10-15 14:17:24,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612818505] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:17:24,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987313355] [2024-10-15 14:17:24,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:24,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:24,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:17:24,023 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-10-15 14:17:24,025 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 14:17:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 14:17:24,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:17:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-10-15 14:17:24,193 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:17:24,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987313355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:24,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:17:24,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-10-15 14:17:24,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438850026] [2024-10-15 14:17:24,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:24,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:24,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:24,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:24,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-15 14:17:24,194 INFO L87 Difference]: Start difference. First operand 340 states and 541 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-15 14:17:24,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:24,377 INFO L93 Difference]: Finished difference Result 639 states and 1012 transitions. [2024-10-15 14:17:24,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:24,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 83 [2024-10-15 14:17:24,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:24,381 INFO L225 Difference]: With dead ends: 639 [2024-10-15 14:17:24,381 INFO L226 Difference]: Without dead ends: 293 [2024-10-15 14:17:24,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-15 14:17:24,383 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 21 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:24,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 183 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:24,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-15 14:17:24,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 283. [2024-10-15 14:17:24,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 144 states have internal predecessors, (170), 136 states have call successors, (136), 17 states have call predecessors, (136), 16 states have return successors, (135), 121 states have call predecessors, (135), 135 states have call successors, (135) [2024-10-15 14:17:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 441 transitions. [2024-10-15 14:17:24,429 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 441 transitions. Word has length 83 [2024-10-15 14:17:24,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:24,429 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 441 transitions. [2024-10-15 14:17:24,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-15 14:17:24,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:24,430 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 441 transitions. [2024-10-15 14:17:24,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-15 14:17:24,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:24,431 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:24,443 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-15 14:17:24,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-15 14:17:24,631 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:24,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:24,632 INFO L85 PathProgramCache]: Analyzing trace with hash -680780915, now seen corresponding path program 1 times [2024-10-15 14:17:24,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:24,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003840334] [2024-10-15 14:17:24,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:24,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:17:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:17:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:17:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:17:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-15 14:17:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-15 14:17:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-15 14:17:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-15 14:17:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-15 14:17:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-15 14:17:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-15 14:17:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-15 14:17:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2024-10-15 14:17:24,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:24,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003840334] [2024-10-15 14:17:24,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003840334] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:17:24,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238258080] [2024-10-15 14:17:24,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:24,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:24,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:17:24,697 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-10-15 14:17:24,698 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 14:17:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:24,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 14:17:24,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:17:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-10-15 14:17:24,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:17:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-15 14:17:24,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238258080] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:17:24,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:17:24,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2024-10-15 14:17:24,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383158874] [2024-10-15 14:17:24,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:17:24,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-15 14:17:24,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:24,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-15 14:17:24,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-15 14:17:24,876 INFO L87 Difference]: Start difference. First operand 283 states and 441 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (31), 6 states have call predecessors, (31), 6 states have call successors, (31) [2024-10-15 14:17:25,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:25,697 INFO L93 Difference]: Finished difference Result 571 states and 876 transitions. [2024-10-15 14:17:25,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-15 14:17:25,698 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (31), 6 states have call predecessors, (31), 6 states have call successors, (31) Word has length 88 [2024-10-15 14:17:25,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:25,700 INFO L225 Difference]: With dead ends: 571 [2024-10-15 14:17:25,701 INFO L226 Difference]: Without dead ends: 343 [2024-10-15 14:17:25,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=402, Invalid=1080, Unknown=0, NotChecked=0, Total=1482 [2024-10-15 14:17:25,702 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 205 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:25,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 731 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-15 14:17:25,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-15 14:17:25,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 237. [2024-10-15 14:17:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 118 states have (on average 1.2372881355932204) internal successors, (146), 127 states have internal predecessors, (146), 102 states have call successors, (102), 17 states have call predecessors, (102), 16 states have return successors, (101), 92 states have call predecessors, (101), 101 states have call successors, (101) [2024-10-15 14:17:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 349 transitions. [2024-10-15 14:17:25,746 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 349 transitions. Word has length 88 [2024-10-15 14:17:25,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:25,747 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 349 transitions. [2024-10-15 14:17:25,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (31), 6 states have call predecessors, (31), 6 states have call successors, (31) [2024-10-15 14:17:25,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 349 transitions. [2024-10-15 14:17:25,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-15 14:17:25,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:25,748 INFO L215 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:25,761 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-15 14:17:25,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:25,949 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:25,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:25,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1903110671, now seen corresponding path program 1 times [2024-10-15 14:17:25,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:25,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905761177] [2024-10-15 14:17:25,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:25,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:26,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:26,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:17:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:26,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:17:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:26,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:17:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:26,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:17:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:26,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-15 14:17:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:26,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-15 14:17:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:26,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-15 14:17:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:26,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-15 14:17:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:26,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-15 14:17:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:26,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-15 14:17:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:26,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-15 14:17:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:26,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-15 14:17:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:26,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-15 14:17:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:26,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-15 14:17:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:26,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-15 14:17:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:26,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-15 14:17:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:26,070 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-15 14:17:26,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:26,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905761177] [2024-10-15 14:17:26,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905761177] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:17:26,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124121394] [2024-10-15 14:17:26,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:26,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:26,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:17:26,072 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-10-15 14:17:26,073 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-15 14:17:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:26,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 14:17:26,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:17:26,257 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 153 proven. 7 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-10-15 14:17:26,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:17:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-15 14:17:26,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124121394] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:17:26,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:17:26,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-10-15 14:17:26,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694943175] [2024-10-15 14:17:26,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:17:26,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-15 14:17:26,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:26,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-15 14:17:26,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2024-10-15 14:17:26,456 INFO L87 Difference]: Start difference. First operand 237 states and 349 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 13 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (45), 13 states have call predecessors, (45), 13 states have call successors, (45) [2024-10-15 14:17:28,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:28,443 INFO L93 Difference]: Finished difference Result 800 states and 1252 transitions. [2024-10-15 14:17:28,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-10-15 14:17:28,443 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 13 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (45), 13 states have call predecessors, (45), 13 states have call successors, (45) Word has length 110 [2024-10-15 14:17:28,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:28,447 INFO L225 Difference]: With dead ends: 800 [2024-10-15 14:17:28,447 INFO L226 Difference]: Without dead ends: 469 [2024-10-15 14:17:28,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=943, Invalid=2839, Unknown=0, NotChecked=0, Total=3782 [2024-10-15 14:17:28,449 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 371 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 484 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:28,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1097 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [484 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-15 14:17:28,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-15 14:17:28,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 372. [2024-10-15 14:17:28,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 173 states have (on average 1.2658959537572254) internal successors, (219), 187 states have internal predecessors, (219), 182 states have call successors, (182), 17 states have call predecessors, (182), 16 states have return successors, (181), 167 states have call predecessors, (181), 181 states have call successors, (181) [2024-10-15 14:17:28,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 582 transitions. [2024-10-15 14:17:28,541 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 582 transitions. Word has length 110 [2024-10-15 14:17:28,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:28,542 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 582 transitions. [2024-10-15 14:17:28,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 13 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (45), 13 states have call predecessors, (45), 13 states have call successors, (45) [2024-10-15 14:17:28,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 582 transitions. [2024-10-15 14:17:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-15 14:17:28,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:28,545 INFO L215 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:28,559 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-15 14:17:28,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-15 14:17:28,746 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:28,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:28,746 INFO L85 PathProgramCache]: Analyzing trace with hash -853516595, now seen corresponding path program 1 times [2024-10-15 14:17:28,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:28,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840440739] [2024-10-15 14:17:28,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:28,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:28,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:28,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:17:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:28,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:17:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:28,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:17:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:28,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:17:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:28,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-15 14:17:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:28,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-15 14:17:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:28,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-15 14:17:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:28,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-15 14:17:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:28,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-15 14:17:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:28,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-15 14:17:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:28,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-15 14:17:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:28,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-15 14:17:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:28,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-15 14:17:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:28,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-15 14:17:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:28,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-15 14:17:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:28,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-15 14:17:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:28,867 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-15 14:17:28,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:28,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840440739] [2024-10-15 14:17:28,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840440739] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:17:28,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637816096] [2024-10-15 14:17:28,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:28,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:28,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:17:28,870 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-10-15 14:17:28,871 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-15 14:17:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:28,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 14:17:28,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:17:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-15 14:17:28,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:17:29,076 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-15 14:17:29,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637816096] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:17:29,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:17:29,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-10-15 14:17:29,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769609915] [2024-10-15 14:17:29,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:17:29,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-15 14:17:29,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:29,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-15 14:17:29,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-15 14:17:29,079 INFO L87 Difference]: Start difference. First operand 372 states and 582 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (33), 3 states have call predecessors, (33), 1 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) [2024-10-15 14:17:29,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:29,415 INFO L93 Difference]: Finished difference Result 434 states and 675 transitions. [2024-10-15 14:17:29,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-15 14:17:29,416 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (33), 3 states have call predecessors, (33), 1 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) Word has length 110 [2024-10-15 14:17:29,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:29,419 INFO L225 Difference]: With dead ends: 434 [2024-10-15 14:17:29,419 INFO L226 Difference]: Without dead ends: 432 [2024-10-15 14:17:29,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 248 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-10-15 14:17:29,420 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 58 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:29,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 394 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:17:29,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-10-15 14:17:29,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 376. [2024-10-15 14:17:29,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 176 states have (on average 1.2613636363636365) internal successors, (222), 190 states have internal predecessors, (222), 182 states have call successors, (182), 18 states have call predecessors, (182), 17 states have return successors, (181), 167 states have call predecessors, (181), 181 states have call successors, (181) [2024-10-15 14:17:29,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 585 transitions. [2024-10-15 14:17:29,506 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 585 transitions. Word has length 110 [2024-10-15 14:17:29,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:29,506 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 585 transitions. [2024-10-15 14:17:29,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (33), 3 states have call predecessors, (33), 1 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) [2024-10-15 14:17:29,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:29,507 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 585 transitions. [2024-10-15 14:17:29,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-15 14:17:29,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:29,508 INFO L215 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:29,522 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-15 14:17:29,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:29,709 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:29,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:29,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1133746567, now seen corresponding path program 2 times [2024-10-15 14:17:29,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:29,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570727088] [2024-10-15 14:17:29,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:29,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:29,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:29,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:17:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:29,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:17:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:29,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:17:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:29,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:17:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:29,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-15 14:17:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:29,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-15 14:17:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:29,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-15 14:17:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:29,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-15 14:17:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:29,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-15 14:17:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:29,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-15 14:17:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:29,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-15 14:17:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:29,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-15 14:17:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:29,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-15 14:17:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:29,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-15 14:17:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:29,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-15 14:17:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:29,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-15 14:17:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:29,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-15 14:17:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:29,811 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 18 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-10-15 14:17:29,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:29,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570727088] [2024-10-15 14:17:29,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570727088] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:17:29,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108928901] [2024-10-15 14:17:29,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:17:29,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:29,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:17:29,813 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-10-15 14:17:29,814 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-15 14:17:29,861 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:17:29,861 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:17:29,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-15 14:17:29,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:17:30,019 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-15 14:17:30,019 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:17:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-15 14:17:30,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108928901] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:17:30,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:17:30,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 19 [2024-10-15 14:17:30,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221463414] [2024-10-15 14:17:30,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:17:30,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-15 14:17:30,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:30,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-15 14:17:30,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-10-15 14:17:30,172 INFO L87 Difference]: Start difference. First operand 376 states and 585 transitions. Second operand has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 17 states have internal predecessors, (69), 10 states have call successors, (56), 3 states have call predecessors, (56), 1 states have return successors, (52), 10 states have call predecessors, (52), 10 states have call successors, (52) [2024-10-15 14:17:31,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:31,244 INFO L93 Difference]: Finished difference Result 698 states and 1108 transitions. [2024-10-15 14:17:31,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-15 14:17:31,245 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 17 states have internal predecessors, (69), 10 states have call successors, (56), 3 states have call predecessors, (56), 1 states have return successors, (52), 10 states have call predecessors, (52), 10 states have call successors, (52) Word has length 115 [2024-10-15 14:17:31,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:31,246 INFO L225 Difference]: With dead ends: 698 [2024-10-15 14:17:31,246 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 14:17:31,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2024-10-15 14:17:31,249 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 281 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:31,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 586 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-15 14:17:31,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 14:17:31,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 14:17:31,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 14:17:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 14:17:31,250 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2024-10-15 14:17:31,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:31,250 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 14:17:31,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 17 states have internal predecessors, (69), 10 states have call successors, (56), 3 states have call predecessors, (56), 1 states have return successors, (52), 10 states have call predecessors, (52), 10 states have call successors, (52) [2024-10-15 14:17:31,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:31,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 14:17:31,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 14:17:31,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 14:17:31,266 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-15 14:17:31,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:31,458 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:31,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.