./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 --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 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 --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:22:36,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:22:36,434 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:22:36,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:22:36,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:22:36,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:22:36,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:22:36,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:22:36,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:22:36,470 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:22:36,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:22:36,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:22:36,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:22:36,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:22:36,472 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:22:36,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:22:36,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:22:36,474 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:22:36,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:22:36,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:22:36,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:22:36,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:22:36,477 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:22:36,477 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:22:36,478 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:22:36,478 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:22:36,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:22:36,478 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:22:36,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:22:36,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:22:36,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:22:36,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:22:36,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:22:36,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:22:36,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:22:36,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:22:36,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:22:36,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:22:36,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:22:36,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:22:36,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:22:36,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:22:36,482 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:22:36,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:22:36,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:22:36,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:22:36,775 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:22:36,775 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:22:36,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/heapsort.i [2024-09-25 10:22:38,095 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:22:38,319 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:22:38,319 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/heapsort.i [2024-09-25 10:22:38,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a5ed5e7f0/f35cb65585ad4cf7bc4949ac3f876a24/FLAG6be78d31b [2024-09-25 10:22:38,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a5ed5e7f0/f35cb65585ad4cf7bc4949ac3f876a24 [2024-09-25 10:22:38,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:22:38,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:22:38,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:22:38,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:22:38,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:22:38,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:22:38" (1/1) ... [2024-09-25 10:22:38,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9d218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:38, skipping insertion in model container [2024-09-25 10:22:38,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:22:38" (1/1) ... [2024-09-25 10:22:38,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:22:38,476 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-09-25 10:22:38,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:22:38,501 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:22:38,512 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-09-25 10:22:38,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:22:38,533 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:22:38,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:38 WrapperNode [2024-09-25 10:22:38,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:22:38,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:22:38,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:22:38,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:22:38,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:38" (1/1) ... [2024-09-25 10:22:38,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:38" (1/1) ... [2024-09-25 10:22:38,553 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:22:38,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:22:38,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:22:38,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:22:38,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:22:38,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:38" (1/1) ... [2024-09-25 10:22:38,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:38" (1/1) ... [2024-09-25 10:22:38,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:38" (1/1) ... [2024-09-25 10:22:38,576 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-09-25 10:22:38,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:38" (1/1) ... [2024-09-25 10:22:38,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:38" (1/1) ... [2024-09-25 10:22:38,581 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:38" (1/1) ... [2024-09-25 10:22:38,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:38" (1/1) ... [2024-09-25 10:22:38,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:38" (1/1) ... [2024-09-25 10:22:38,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:38" (1/1) ... [2024-09-25 10:22:38,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:22:38,590 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:22:38,591 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:22:38,591 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:22:38,592 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:38" (1/1) ... [2024-09-25 10:22:38,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:22:38,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:22:38,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:22:38,619 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:22:38,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:22:38,654 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:22:38,654 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:22:38,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:22:38,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:22:38,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:22:38,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:22:38,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:22:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:22:38,656 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:22:38,709 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:22:38,711 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:22:38,935 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-09-25 10:22:38,935 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:22:38,950 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:22:38,951 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-25 10:22:38,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:22:38 BoogieIcfgContainer [2024-09-25 10:22:38,951 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:22:38,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:22:38,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:22:38,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:22:38,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:22:38" (1/3) ... [2024-09-25 10:22:38,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ef4f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:22:38, skipping insertion in model container [2024-09-25 10:22:38,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:38" (2/3) ... [2024-09-25 10:22:38,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ef4f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:22:38, skipping insertion in model container [2024-09-25 10:22:38,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:22:38" (3/3) ... [2024-09-25 10:22:38,957 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort.i [2024-09-25 10:22:38,971 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:22:38,971 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:22:39,011 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:22:39,016 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@67b38995, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:22:39,017 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:22:39,021 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-09-25 10:22:39,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-25 10:22:39,026 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:39,027 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:39,027 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:39,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:39,031 INFO L85 PathProgramCache]: Analyzing trace with hash 855475308, now seen corresponding path program 1 times [2024-09-25 10:22:39,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:39,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415895669] [2024-09-25 10:22:39,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:39,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:39,349 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:39,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:39,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415895669] [2024-09-25 10:22:39,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415895669] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:39,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:39,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:22:39,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568547343] [2024-09-25 10:22:39,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:39,366 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:39,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:39,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:39,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:39,389 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-09-25 10:22:39,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:39,651 INFO L93 Difference]: Finished difference Result 113 states and 211 transitions. [2024-09-25 10:22:39,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:22:39,653 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-09-25 10:22:39,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:39,660 INFO L225 Difference]: With dead ends: 113 [2024-09-25 10:22:39,660 INFO L226 Difference]: Without dead ends: 69 [2024-09-25 10:22:39,663 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:22:39,667 INFO L434 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-09-25 10:22:39,668 INFO L435 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-09-25 10:22:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-25 10:22:39,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2024-09-25 10:22:39,715 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-09-25 10:22:39,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2024-09-25 10:22:39,720 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 14 [2024-09-25 10:22:39,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:39,722 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2024-09-25 10:22:39,722 INFO L475 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-09-25 10:22:39,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:39,723 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2024-09-25 10:22:39,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-25 10:22:39,724 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:39,724 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:39,724 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:22:39,724 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:39,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:39,725 INFO L85 PathProgramCache]: Analyzing trace with hash 843231207, now seen corresponding path program 1 times [2024-09-25 10:22:39,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:39,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947664207] [2024-09-25 10:22:39,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:39,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:39,838 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:39,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:39,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:39,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947664207] [2024-09-25 10:22:39,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947664207] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:39,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:39,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:22:39,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269780671] [2024-09-25 10:22:39,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:39,848 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:39,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:39,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:39,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:39,849 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-09-25 10:22:39,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:39,988 INFO L93 Difference]: Finished difference Result 117 states and 183 transitions. [2024-09-25 10:22:39,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:22:39,990 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-09-25 10:22:39,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:39,993 INFO L225 Difference]: With dead ends: 117 [2024-09-25 10:22:39,993 INFO L226 Difference]: Without dead ends: 115 [2024-09-25 10:22:39,994 INFO L433 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-09-25 10:22:39,996 INFO L434 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-09-25 10:22:39,996 INFO L435 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-09-25 10:22:39,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-09-25 10:22:40,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2024-09-25 10:22:40,023 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-09-25 10:22:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 167 transitions. [2024-09-25 10:22:40,027 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 167 transitions. Word has length 14 [2024-09-25 10:22:40,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:40,028 INFO L474 AbstractCegarLoop]: Abstraction has 106 states and 167 transitions. [2024-09-25 10:22:40,028 INFO L475 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-09-25 10:22:40,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 167 transitions. [2024-09-25 10:22:40,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-25 10:22:40,036 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:40,036 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:40,036 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:22:40,036 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:40,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:40,037 INFO L85 PathProgramCache]: Analyzing trace with hash 842919880, now seen corresponding path program 1 times [2024-09-25 10:22:40,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:40,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133136850] [2024-09-25 10:22:40,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:40,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:40,194 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:40,197 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:22:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:40,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:40,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:40,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133136850] [2024-09-25 10:22:40,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133136850] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:40,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:40,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:22:40,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997439785] [2024-09-25 10:22:40,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:40,213 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:40,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:40,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:40,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:40,213 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-09-25 10:22:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:40,419 INFO L93 Difference]: Finished difference Result 161 states and 257 transitions. [2024-09-25 10:22:40,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:22:40,421 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-09-25 10:22:40,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:40,423 INFO L225 Difference]: With dead ends: 161 [2024-09-25 10:22:40,425 INFO L226 Difference]: Without dead ends: 159 [2024-09-25 10:22:40,426 INFO L433 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-09-25 10:22:40,427 INFO L434 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.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:40,427 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 200 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:22:40,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-09-25 10:22:40,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 142. [2024-09-25 10:22:40,454 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-09-25 10:22:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 230 transitions. [2024-09-25 10:22:40,456 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 230 transitions. Word has length 19 [2024-09-25 10:22:40,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:40,457 INFO L474 AbstractCegarLoop]: Abstraction has 142 states and 230 transitions. [2024-09-25 10:22:40,457 INFO L475 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-09-25 10:22:40,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:40,457 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 230 transitions. [2024-09-25 10:22:40,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-25 10:22:40,458 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:40,458 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:40,458 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 10:22:40,458 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:40,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:40,459 INFO L85 PathProgramCache]: Analyzing trace with hash 303375166, now seen corresponding path program 1 times [2024-09-25 10:22:40,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:40,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996858874] [2024-09-25 10:22:40,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:40,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:40,596 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:40,599 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:22:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:40,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:40,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996858874] [2024-09-25 10:22:40,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996858874] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:40,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:40,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:22:40,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806672390] [2024-09-25 10:22:40,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:40,612 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:22:40,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:40,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:22:40,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:40,613 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-09-25 10:22:40,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:40,815 INFO L93 Difference]: Finished difference Result 208 states and 342 transitions. [2024-09-25 10:22:40,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:22:40,816 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-09-25 10:22:40,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:40,819 INFO L225 Difference]: With dead ends: 208 [2024-09-25 10:22:40,820 INFO L226 Difference]: Without dead ends: 206 [2024-09-25 10:22:40,820 INFO L433 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-09-25 10:22:40,821 INFO L434 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-09-25 10:22:40,821 INFO L435 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-09-25 10:22:40,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-09-25 10:22:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2024-09-25 10:22:40,887 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-09-25 10:22:40,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 337 transitions. [2024-09-25 10:22:40,890 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 337 transitions. Word has length 19 [2024-09-25 10:22:40,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:40,891 INFO L474 AbstractCegarLoop]: Abstraction has 203 states and 337 transitions. [2024-09-25 10:22:40,895 INFO L475 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-09-25 10:22:40,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:40,896 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 337 transitions. [2024-09-25 10:22:40,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-25 10:22:40,897 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:40,897 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:40,897 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-25 10:22:40,897 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:40,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:40,897 INFO L85 PathProgramCache]: Analyzing trace with hash -283430848, now seen corresponding path program 1 times [2024-09-25 10:22:40,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:40,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238938494] [2024-09-25 10:22:40,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:40,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:40,932 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:40,939 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:22:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:40,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:40,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:40,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238938494] [2024-09-25 10:22:40,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238938494] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:40,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:40,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:22:40,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024592156] [2024-09-25 10:22:40,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:40,946 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:22:40,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:40,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:22:40,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:22:40,947 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-09-25 10:22:41,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:41,092 INFO L93 Difference]: Finished difference Result 387 states and 649 transitions. [2024-09-25 10:22:41,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:22:41,093 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-09-25 10:22:41,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:41,100 INFO L225 Difference]: With dead ends: 387 [2024-09-25 10:22:41,100 INFO L226 Difference]: Without dead ends: 305 [2024-09-25 10:22:41,101 INFO L433 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-09-25 10:22:41,103 INFO L434 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-09-25 10:22:41,105 INFO L435 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-09-25 10:22:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-09-25 10:22:41,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 250. [2024-09-25 10:22:41,164 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-09-25 10:22:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 421 transitions. [2024-09-25 10:22:41,168 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 421 transitions. Word has length 19 [2024-09-25 10:22:41,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:41,168 INFO L474 AbstractCegarLoop]: Abstraction has 250 states and 421 transitions. [2024-09-25 10:22:41,168 INFO L475 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-09-25 10:22:41,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:41,169 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 421 transitions. [2024-09-25 10:22:41,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-25 10:22:41,170 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:41,171 INFO L216 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-09-25 10:22:41,171 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-25 10:22:41,171 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:41,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:41,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1858602097, now seen corresponding path program 1 times [2024-09-25 10:22:41,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:41,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085035102] [2024-09-25 10:22:41,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:41,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:41,235 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:41,237 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:22:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:41,239 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:22:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:22:41,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:41,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085035102] [2024-09-25 10:22:41,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085035102] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:41,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:41,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:22:41,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130282893] [2024-09-25 10:22:41,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:41,246 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:41,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:41,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:41,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:41,247 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-09-25 10:22:41,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:41,422 INFO L93 Difference]: Finished difference Result 338 states and 568 transitions. [2024-09-25 10:22:41,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:22:41,422 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-09-25 10:22:41,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:41,425 INFO L225 Difference]: With dead ends: 338 [2024-09-25 10:22:41,425 INFO L226 Difference]: Without dead ends: 336 [2024-09-25 10:22:41,425 INFO L433 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-09-25 10:22:41,426 INFO L434 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-09-25 10:22:41,427 INFO L435 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-09-25 10:22:41,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-09-25 10:22:41,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 304. [2024-09-25 10:22:41,491 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-09-25 10:22:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 511 transitions. [2024-09-25 10:22:41,494 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 511 transitions. Word has length 26 [2024-09-25 10:22:41,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:41,495 INFO L474 AbstractCegarLoop]: Abstraction has 304 states and 511 transitions. [2024-09-25 10:22:41,495 INFO L475 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-09-25 10:22:41,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:41,495 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 511 transitions. [2024-09-25 10:22:41,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-25 10:22:41,500 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:41,500 INFO L216 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-09-25 10:22:41,500 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-25 10:22:41,500 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:41,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:41,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1261754835, now seen corresponding path program 1 times [2024-09-25 10:22:41,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:41,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039527434] [2024-09-25 10:22:41,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:41,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:41,575 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:41,580 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:22:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:41,584 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:22:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:41,587 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-25 10:22:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:41,591 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 10:22:41,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:41,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039527434] [2024-09-25 10:22:41,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039527434] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:41,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:41,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:22:41,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836812871] [2024-09-25 10:22:41,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:41,593 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:41,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:41,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:41,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:41,594 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-09-25 10:22:41,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:41,765 INFO L93 Difference]: Finished difference Result 370 states and 611 transitions. [2024-09-25 10:22:41,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:22:41,767 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-09-25 10:22:41,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:41,769 INFO L225 Difference]: With dead ends: 370 [2024-09-25 10:22:41,770 INFO L226 Difference]: Without dead ends: 368 [2024-09-25 10:22:41,771 INFO L433 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-09-25 10:22:41,771 INFO L434 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-09-25 10:22:41,772 INFO L435 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-09-25 10:22:41,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-09-25 10:22:41,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 344. [2024-09-25 10:22:41,857 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-09-25 10:22:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 577 transitions. [2024-09-25 10:22:41,860 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 577 transitions. Word has length 29 [2024-09-25 10:22:41,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:41,862 INFO L474 AbstractCegarLoop]: Abstraction has 344 states and 577 transitions. [2024-09-25 10:22:41,862 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (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-09-25 10:22:41,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:41,862 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 577 transitions. [2024-09-25 10:22:41,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-25 10:22:41,863 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:41,863 INFO L216 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-09-25 10:22:41,863 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-25 10:22:41,864 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:41,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:41,864 INFO L85 PathProgramCache]: Analyzing trace with hash 887335745, now seen corresponding path program 1 times [2024-09-25 10:22:41,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:41,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604812535] [2024-09-25 10:22:41,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:41,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:41,920 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:41,924 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:22:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:41,926 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:22:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:41,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:22:41,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:41,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604812535] [2024-09-25 10:22:41,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604812535] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:41,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:41,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:22:41,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429078990] [2024-09-25 10:22:41,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:41,933 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:22:41,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:41,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:22:41,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:22:41,934 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-09-25 10:22:42,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:42,189 INFO L93 Difference]: Finished difference Result 795 states and 1334 transitions. [2024-09-25 10:22:42,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:22:42,189 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-09-25 10:22:42,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:42,193 INFO L225 Difference]: With dead ends: 795 [2024-09-25 10:22:42,193 INFO L226 Difference]: Without dead ends: 540 [2024-09-25 10:22:42,194 INFO L433 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-09-25 10:22:42,195 INFO L434 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-09-25 10:22:42,195 INFO L435 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-09-25 10:22:42,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-09-25 10:22:42,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 345. [2024-09-25 10:22:42,248 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-09-25 10:22:42,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 577 transitions. [2024-09-25 10:22:42,264 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 577 transitions. Word has length 28 [2024-09-25 10:22:42,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:42,264 INFO L474 AbstractCegarLoop]: Abstraction has 345 states and 577 transitions. [2024-09-25 10:22:42,264 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:22:42,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:42,264 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 577 transitions. [2024-09-25 10:22:42,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-25 10:22:42,265 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:42,265 INFO L216 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-09-25 10:22:42,265 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-25 10:22:42,265 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:42,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:42,265 INFO L85 PathProgramCache]: Analyzing trace with hash 969267811, now seen corresponding path program 1 times [2024-09-25 10:22:42,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:42,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877530683] [2024-09-25 10:22:42,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:42,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:42,326 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:42,329 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:22:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:42,331 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:22:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:42,333 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 10:22:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:42,335 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 10:22:42,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:42,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877530683] [2024-09-25 10:22:42,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877530683] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:42,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:42,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:22:42,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821458262] [2024-09-25 10:22:42,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:42,336 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:22:42,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:42,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:22:42,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:42,337 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-09-25 10:22:42,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:42,569 INFO L93 Difference]: Finished difference Result 542 states and 924 transitions. [2024-09-25 10:22:42,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:22:42,570 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-09-25 10:22:42,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:42,573 INFO L225 Difference]: With dead ends: 542 [2024-09-25 10:22:42,573 INFO L226 Difference]: Without dead ends: 540 [2024-09-25 10:22:42,574 INFO L433 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-09-25 10:22:42,574 INFO L434 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-09-25 10:22:42,575 INFO L435 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-09-25 10:22:42,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-09-25 10:22:42,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 492. [2024-09-25 10:22:42,668 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-09-25 10:22:42,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 842 transitions. [2024-09-25 10:22:42,672 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 842 transitions. Word has length 31 [2024-09-25 10:22:42,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:42,672 INFO L474 AbstractCegarLoop]: Abstraction has 492 states and 842 transitions. [2024-09-25 10:22:42,673 INFO L475 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-09-25 10:22:42,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:42,673 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 842 transitions. [2024-09-25 10:22:42,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-25 10:22:42,674 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:42,674 INFO L216 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-09-25 10:22:42,674 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-25 10:22:42,674 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:42,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:42,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1109816421, now seen corresponding path program 1 times [2024-09-25 10:22:42,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:42,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124458158] [2024-09-25 10:22:42,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:42,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:42,732 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:42,734 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:22:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:42,737 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:22:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:42,739 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 10:22:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 10:22:42,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:42,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124458158] [2024-09-25 10:22:42,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124458158] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:42,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:42,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:22:42,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210041836] [2024-09-25 10:22:42,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:42,746 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:22:42,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:42,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:22:42,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:42,747 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-09-25 10:22:43,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:43,133 INFO L93 Difference]: Finished difference Result 562 states and 954 transitions. [2024-09-25 10:22:43,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:22:43,134 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-09-25 10:22:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:43,138 INFO L225 Difference]: With dead ends: 562 [2024-09-25 10:22:43,138 INFO L226 Difference]: Without dead ends: 560 [2024-09-25 10:22:43,139 INFO L433 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-09-25 10:22:43,139 INFO L434 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.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:43,139 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 208 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:22:43,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-09-25 10:22:43,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 499. [2024-09-25 10:22:43,226 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-09-25 10:22:43,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 851 transitions. [2024-09-25 10:22:43,229 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 851 transitions. Word has length 31 [2024-09-25 10:22:43,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:43,229 INFO L474 AbstractCegarLoop]: Abstraction has 499 states and 851 transitions. [2024-09-25 10:22:43,230 INFO L475 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-09-25 10:22:43,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:43,230 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 851 transitions. [2024-09-25 10:22:43,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-25 10:22:43,231 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:43,231 INFO L216 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-09-25 10:22:43,231 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-25 10:22:43,231 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:43,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:43,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1192529802, now seen corresponding path program 1 times [2024-09-25 10:22:43,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:43,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040929418] [2024-09-25 10:22:43,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:43,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:43,283 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:43,285 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:22:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:43,287 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:22:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:43,289 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-25 10:22:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:43,291 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-25 10:22:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:43,293 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-25 10:22:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:43,295 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-25 10:22:43,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:43,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040929418] [2024-09-25 10:22:43,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040929418] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:43,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:43,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:22:43,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990379361] [2024-09-25 10:22:43,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:43,296 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:22:43,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:43,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:22:43,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:43,297 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-09-25 10:22:43,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:43,517 INFO L93 Difference]: Finished difference Result 557 states and 928 transitions. [2024-09-25 10:22:43,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:22:43,517 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-09-25 10:22:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:43,521 INFO L225 Difference]: With dead ends: 557 [2024-09-25 10:22:43,521 INFO L226 Difference]: Without dead ends: 555 [2024-09-25 10:22:43,521 INFO L433 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-09-25 10:22:43,522 INFO L434 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-09-25 10:22:43,522 INFO L435 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-09-25 10:22:43,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-09-25 10:22:43,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 503. [2024-09-25 10:22:43,612 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-09-25 10:22:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 854 transitions. [2024-09-25 10:22:43,616 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 854 transitions. Word has length 41 [2024-09-25 10:22:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:43,616 INFO L474 AbstractCegarLoop]: Abstraction has 503 states and 854 transitions. [2024-09-25 10:22:43,617 INFO L475 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-09-25 10:22:43,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 854 transitions. [2024-09-25 10:22:43,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-25 10:22:43,618 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:43,618 INFO L216 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-09-25 10:22:43,618 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-25 10:22:43,618 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:43,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:43,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2122421222, now seen corresponding path program 1 times [2024-09-25 10:22:43,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:43,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186656543] [2024-09-25 10:22:43,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:43,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:43,674 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:43,676 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:22:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:43,678 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:22:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:43,679 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 10:22:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:43,681 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 10:22:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:22:43,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:43,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186656543] [2024-09-25 10:22:43,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186656543] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:43,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:43,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:22:43,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065015975] [2024-09-25 10:22:43,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:43,685 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:22:43,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:43,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:22:43,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:43,686 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-09-25 10:22:43,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:43,915 INFO L93 Difference]: Finished difference Result 534 states and 893 transitions. [2024-09-25 10:22:43,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:22:43,915 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-09-25 10:22:43,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:43,919 INFO L225 Difference]: With dead ends: 534 [2024-09-25 10:22:43,919 INFO L226 Difference]: Without dead ends: 532 [2024-09-25 10:22:43,919 INFO L433 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-09-25 10:22:43,920 INFO L434 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-09-25 10:22:43,920 INFO L435 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-09-25 10:22:43,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-09-25 10:22:44,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 511. [2024-09-25 10:22:44,007 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-09-25 10:22:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 860 transitions. [2024-09-25 10:22:44,010 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 860 transitions. Word has length 41 [2024-09-25 10:22:44,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:44,011 INFO L474 AbstractCegarLoop]: Abstraction has 511 states and 860 transitions. [2024-09-25 10:22:44,011 INFO L475 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-09-25 10:22:44,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 860 transitions. [2024-09-25 10:22:44,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-09-25 10:22:44,012 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:44,012 INFO L216 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-09-25 10:22:44,012 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-25 10:22:44,013 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:44,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:44,013 INFO L85 PathProgramCache]: Analyzing trace with hash 290316784, now seen corresponding path program 1 times [2024-09-25 10:22:44,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:44,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900032499] [2024-09-25 10:22:44,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:44,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:44,066 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:44,067 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:22:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:44,068 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:22:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:44,070 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 10:22:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:44,071 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 10:22:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:44,073 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 10:22:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:44,075 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-25 10:22:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-25 10:22:44,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:44,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900032499] [2024-09-25 10:22:44,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900032499] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:44,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:44,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:22:44,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619868415] [2024-09-25 10:22:44,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:44,078 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:22:44,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:44,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:22:44,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:44,078 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-09-25 10:22:44,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:44,262 INFO L93 Difference]: Finished difference Result 578 states and 966 transitions. [2024-09-25 10:22:44,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:22:44,263 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-09-25 10:22:44,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:44,266 INFO L225 Difference]: With dead ends: 578 [2024-09-25 10:22:44,266 INFO L226 Difference]: Without dead ends: 576 [2024-09-25 10:22:44,267 INFO L433 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-09-25 10:22:44,267 INFO L434 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-09-25 10:22:44,267 INFO L435 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-09-25 10:22:44,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-09-25 10:22:44,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 515. [2024-09-25 10:22:44,348 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-09-25 10:22:44,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 863 transitions. [2024-09-25 10:22:44,351 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 863 transitions. Word has length 53 [2024-09-25 10:22:44,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:44,351 INFO L474 AbstractCegarLoop]: Abstraction has 515 states and 863 transitions. [2024-09-25 10:22:44,351 INFO L475 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-09-25 10:22:44,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 863 transitions. [2024-09-25 10:22:44,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-25 10:22:44,353 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:44,353 INFO L216 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-09-25 10:22:44,353 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-25 10:22:44,353 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:44,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:44,353 INFO L85 PathProgramCache]: Analyzing trace with hash 822747500, now seen corresponding path program 1 times [2024-09-25 10:22:44,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:44,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388503546] [2024-09-25 10:22:44,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:44,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:44,387 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:44,389 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:22:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:44,390 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:22:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:44,392 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 10:22:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:44,394 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-25 10:22:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:44,396 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-25 10:22:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:44,398 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 10:22:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:44,400 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-25 10:22:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:44,401 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 10:22:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:44,403 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-09-25 10:22:44,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:44,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388503546] [2024-09-25 10:22:44,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388503546] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:22:44,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122047536] [2024-09-25 10:22:44,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:44,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:22:44,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:22:44,405 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:22:44,409 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 10:22:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:44,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 10:22:44,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:22:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-09-25 10:22:44,568 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:22:44,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122047536] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:44,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:22:44,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-09-25 10:22:44,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287468524] [2024-09-25 10:22:44,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:44,569 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:44,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:44,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:44,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:22:44,570 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-09-25 10:22:44,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:44,879 INFO L93 Difference]: Finished difference Result 932 states and 1539 transitions. [2024-09-25 10:22:44,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:22:44,884 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-09-25 10:22:44,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:44,891 INFO L225 Difference]: With dead ends: 932 [2024-09-25 10:22:44,891 INFO L226 Difference]: Without dead ends: 476 [2024-09-25 10:22:44,893 INFO L433 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-09-25 10:22:44,894 INFO L434 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-09-25 10:22:44,894 INFO L435 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-09-25 10:22:44,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-09-25 10:22:45,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 446. [2024-09-25 10:22:45,058 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-09-25 10:22:45,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 731 transitions. [2024-09-25 10:22:45,064 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 731 transitions. Word has length 61 [2024-09-25 10:22:45,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:45,065 INFO L474 AbstractCegarLoop]: Abstraction has 446 states and 731 transitions. [2024-09-25 10:22:45,065 INFO L475 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-09-25 10:22:45,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:45,066 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 731 transitions. [2024-09-25 10:22:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-09-25 10:22:45,071 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:45,071 INFO L216 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-09-25 10:22:45,093 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-25 10:22:45,271 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-25 10:22:45,272 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:45,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:45,273 INFO L85 PathProgramCache]: Analyzing trace with hash 968879790, now seen corresponding path program 1 times [2024-09-25 10:22:45,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:45,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397028018] [2024-09-25 10:22:45,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:45,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:45,421 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:45,424 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:22:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:45,426 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:22:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:45,429 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-25 10:22:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:45,431 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-25 10:22:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:45,433 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-25 10:22:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:45,436 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 10:22:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:45,438 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-09-25 10:22:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:45,440 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-25 10:22:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:45,443 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-25 10:22:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:45,446 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-25 10:22:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:45,449 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-25 10:22:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:45,452 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-09-25 10:22:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-09-25 10:22:45,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:45,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397028018] [2024-09-25 10:22:45,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397028018] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:22:45,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564601980] [2024-09-25 10:22:45,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:45,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:22:45,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:22:45,458 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:22:45,459 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 10:22:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:45,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 10:22:45,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:22:45,683 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-09-25 10:22:45,684 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:22:45,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564601980] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:45,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:22:45,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2024-09-25 10:22:45,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729564968] [2024-09-25 10:22:45,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:45,685 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:22:45,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:45,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:22:45,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:22:45,686 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-09-25 10:22:46,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:46,049 INFO L93 Difference]: Finished difference Result 813 states and 1310 transitions. [2024-09-25 10:22:46,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-25 10:22:46,050 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-09-25 10:22:46,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:46,053 INFO L225 Difference]: With dead ends: 813 [2024-09-25 10:22:46,054 INFO L226 Difference]: Without dead ends: 375 [2024-09-25 10:22:46,056 INFO L433 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-09-25 10:22:46,056 INFO L434 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-09-25 10:22:46,056 INFO L435 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-09-25 10:22:46,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-09-25 10:22:46,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 340. [2024-09-25 10:22:46,133 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-09-25 10:22:46,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 541 transitions. [2024-09-25 10:22:46,136 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 541 transitions. Word has length 83 [2024-09-25 10:22:46,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:46,136 INFO L474 AbstractCegarLoop]: Abstraction has 340 states and 541 transitions. [2024-09-25 10:22:46,137 INFO L475 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-09-25 10:22:46,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 541 transitions. [2024-09-25 10:22:46,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-09-25 10:22:46,138 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:46,138 INFO L216 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-09-25 10:22:46,151 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 10:22:46,338 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-25 10:22:46,339 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:46,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:46,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1787747476, now seen corresponding path program 1 times [2024-09-25 10:22:46,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:46,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745802744] [2024-09-25 10:22:46,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:46,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:46,472 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:46,474 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:22:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:46,476 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:22:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:46,478 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-25 10:22:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:46,480 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-25 10:22:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:46,482 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-25 10:22:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:46,485 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 10:22:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:46,486 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-09-25 10:22:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:46,489 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-25 10:22:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:46,495 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-25 10:22:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:46,497 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-25 10:22:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:46,499 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-25 10:22:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:46,503 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-09-25 10:22:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-09-25 10:22:46,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:46,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745802744] [2024-09-25 10:22:46,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745802744] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:22:46,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795564531] [2024-09-25 10:22:46,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:46,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:22:46,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:22:46,509 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:22:46,514 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 10:22:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:46,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 10:22:46,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:22:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-09-25 10:22:46,676 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:22:46,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795564531] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:46,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:22:46,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-09-25 10:22:46,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957246307] [2024-09-25 10:22:46,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:46,677 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:46,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:46,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:46,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:22:46,678 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-09-25 10:22:46,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:46,920 INFO L93 Difference]: Finished difference Result 639 states and 1012 transitions. [2024-09-25 10:22:46,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:22:46,921 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-09-25 10:22:46,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:46,923 INFO L225 Difference]: With dead ends: 639 [2024-09-25 10:22:46,923 INFO L226 Difference]: Without dead ends: 293 [2024-09-25 10:22:46,925 INFO L433 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-09-25 10:22:46,925 INFO L434 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.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:46,925 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 183 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:22:46,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-09-25 10:22:46,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 283. [2024-09-25 10:22:46,965 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-09-25 10:22:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 441 transitions. [2024-09-25 10:22:46,967 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 441 transitions. Word has length 83 [2024-09-25 10:22:46,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:46,967 INFO L474 AbstractCegarLoop]: Abstraction has 283 states and 441 transitions. [2024-09-25 10:22:46,967 INFO L475 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-09-25 10:22:46,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:46,968 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 441 transitions. [2024-09-25 10:22:46,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-09-25 10:22:46,969 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:46,969 INFO L216 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-09-25 10:22:46,985 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 10:22:47,169 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-25 10:22:47,170 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:47,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:47,170 INFO L85 PathProgramCache]: Analyzing trace with hash -680780915, now seen corresponding path program 1 times [2024-09-25 10:22:47,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:47,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088153174] [2024-09-25 10:22:47,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:47,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:47,211 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:47,213 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:22:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:47,214 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:22:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:47,215 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 10:22:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:47,217 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 10:22:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:47,218 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 10:22:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:47,220 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-25 10:22:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:47,221 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-25 10:22:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:47,223 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-25 10:22:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:47,224 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-25 10:22:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:47,226 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-25 10:22:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:47,227 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-09-25 10:22:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:47,228 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-09-25 10:22:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2024-09-25 10:22:47,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:47,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088153174] [2024-09-25 10:22:47,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088153174] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:22:47,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556726229] [2024-09-25 10:22:47,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:47,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:22:47,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:22:47,231 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:22:47,234 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 10:22:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:47,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-25 10:22:47,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:22:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-09-25 10:22:47,335 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:22:47,443 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-09-25 10:22:47,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556726229] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:22:47,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:22:47,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2024-09-25 10:22:47,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420412057] [2024-09-25 10:22:47,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:22:47,444 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 10:22:47,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:47,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 10:22:47,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:22:47,445 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-09-25 10:22:48,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:48,234 INFO L93 Difference]: Finished difference Result 571 states and 876 transitions. [2024-09-25 10:22:48,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-25 10:22:48,235 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-09-25 10:22:48,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:48,237 INFO L225 Difference]: With dead ends: 571 [2024-09-25 10:22:48,237 INFO L226 Difference]: Without dead ends: 343 [2024-09-25 10:22:48,239 INFO L433 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-09-25 10:22:48,239 INFO L434 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-09-25 10:22:48,239 INFO L435 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-09-25 10:22:48,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-09-25 10:22:48,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 237. [2024-09-25 10:22:48,280 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-09-25 10:22:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 349 transitions. [2024-09-25 10:22:48,283 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 349 transitions. Word has length 88 [2024-09-25 10:22:48,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:48,283 INFO L474 AbstractCegarLoop]: Abstraction has 237 states and 349 transitions. [2024-09-25 10:22:48,283 INFO L475 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-09-25 10:22:48,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:48,284 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 349 transitions. [2024-09-25 10:22:48,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-09-25 10:22:48,285 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:48,285 INFO L216 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-09-25 10:22:48,301 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-25 10:22:48,489 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:22:48,490 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:48,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:48,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1903110671, now seen corresponding path program 1 times [2024-09-25 10:22:48,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:48,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199424909] [2024-09-25 10:22:48,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:48,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:48,581 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:48,583 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:22:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:48,585 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:22:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:48,587 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 10:22:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:48,590 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 10:22:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:48,592 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 10:22:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:48,593 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-25 10:22:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:48,595 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-25 10:22:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:48,600 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-25 10:22:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:48,604 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-25 10:22:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:48,607 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-25 10:22:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:48,610 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-25 10:22:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:48,612 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-25 10:22:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:48,614 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-25 10:22:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:48,617 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-25 10:22:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:48,620 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-09-25 10:22:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:48,623 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-09-25 10:22:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:48,626 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-25 10:22:48,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:48,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199424909] [2024-09-25 10:22:48,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199424909] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:22:48,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384875046] [2024-09-25 10:22:48,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:48,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:22:48,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:22:48,631 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:22:48,634 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 10:22:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:48,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 10:22:48,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:22:48,862 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 153 proven. 7 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-09-25 10:22:48,862 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:22:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-25 10:22:49,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384875046] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:22:49,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:22:49,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-09-25 10:22:49,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185302946] [2024-09-25 10:22:49,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:22:49,024 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-25 10:22:49,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:49,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-25 10:22:49,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2024-09-25 10:22:49,025 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-09-25 10:22:50,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:50,893 INFO L93 Difference]: Finished difference Result 800 states and 1252 transitions. [2024-09-25 10:22:50,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-09-25 10:22:50,894 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-09-25 10:22:50,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:50,897 INFO L225 Difference]: With dead ends: 800 [2024-09-25 10:22:50,897 INFO L226 Difference]: Without dead ends: 469 [2024-09-25 10:22:50,899 INFO L433 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-09-25 10:22:50,900 INFO L434 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-09-25 10:22:50,900 INFO L435 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-09-25 10:22:50,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-09-25 10:22:51,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 372. [2024-09-25 10:22:51,049 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-09-25 10:22:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 582 transitions. [2024-09-25 10:22:51,055 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 582 transitions. Word has length 110 [2024-09-25 10:22:51,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:51,055 INFO L474 AbstractCegarLoop]: Abstraction has 372 states and 582 transitions. [2024-09-25 10:22:51,055 INFO L475 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-09-25 10:22:51,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 582 transitions. [2024-09-25 10:22:51,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-09-25 10:22:51,059 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:51,059 INFO L216 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-09-25 10:22:51,071 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-25 10:22:51,259 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-09-25 10:22:51,259 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:51,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:51,260 INFO L85 PathProgramCache]: Analyzing trace with hash -853516595, now seen corresponding path program 1 times [2024-09-25 10:22:51,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:51,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260055713] [2024-09-25 10:22:51,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:51,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:51,387 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:51,388 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:22:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:51,389 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:22:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:51,391 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 10:22:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:51,392 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 10:22:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:51,394 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 10:22:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:51,395 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-25 10:22:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:51,398 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-25 10:22:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:51,399 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-25 10:22:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:51,401 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-25 10:22:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:51,402 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-25 10:22:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:51,403 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-25 10:22:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:51,405 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-25 10:22:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:51,407 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-25 10:22:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:51,409 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-25 10:22:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:51,410 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-09-25 10:22:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:51,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-09-25 10:22:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-25 10:22:51,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:51,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260055713] [2024-09-25 10:22:51,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260055713] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:22:51,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933058562] [2024-09-25 10:22:51,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:51,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:22:51,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:22:51,419 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:22:51,423 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 10:22:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:51,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:22:51,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:22:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-25 10:22:51,524 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:22:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-25 10:22:51,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933058562] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:22:51,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:22:51,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-09-25 10:22:51,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200038700] [2024-09-25 10:22:51,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:22:51,652 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 10:22:51,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:51,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 10:22:51,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:22:51,653 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-09-25 10:22:52,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:52,052 INFO L93 Difference]: Finished difference Result 434 states and 675 transitions. [2024-09-25 10:22:52,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-25 10:22:52,052 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-09-25 10:22:52,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:52,055 INFO L225 Difference]: With dead ends: 434 [2024-09-25 10:22:52,055 INFO L226 Difference]: Without dead ends: 432 [2024-09-25 10:22:52,056 INFO L433 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-09-25 10:22:52,056 INFO L434 NwaCegarLoop]: 72 mSDtfsCounter, 58 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-09-25 10:22:52,056 INFO L435 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-09-25 10:22:52,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-09-25 10:22:52,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 376. [2024-09-25 10:22:52,148 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-09-25 10:22:52,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 585 transitions. [2024-09-25 10:22:52,150 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 585 transitions. Word has length 110 [2024-09-25 10:22:52,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:52,151 INFO L474 AbstractCegarLoop]: Abstraction has 376 states and 585 transitions. [2024-09-25 10:22:52,151 INFO L475 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-09-25 10:22:52,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:52,151 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 585 transitions. [2024-09-25 10:22:52,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-09-25 10:22:52,152 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:52,152 INFO L216 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-09-25 10:22:52,177 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 10:22:52,353 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:22:52,353 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:52,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:52,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1133746567, now seen corresponding path program 2 times [2024-09-25 10:22:52,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:52,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77503942] [2024-09-25 10:22:52,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:52,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:52,424 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:52,426 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:22:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:52,428 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:22:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:52,429 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 10:22:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:52,430 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 10:22:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:52,432 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 10:22:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:52,433 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-25 10:22:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:52,435 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-25 10:22:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:52,436 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-25 10:22:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:52,438 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-25 10:22:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:52,441 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-25 10:22:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:52,442 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-25 10:22:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:52,444 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-25 10:22:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:52,447 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-25 10:22:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:52,448 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-25 10:22:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:52,450 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-09-25 10:22:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:52,452 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-09-25 10:22:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:52,453 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-09-25 10:22:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:52,455 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 18 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-09-25 10:22:52,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:52,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77503942] [2024-09-25 10:22:52,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77503942] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:22:52,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855625940] [2024-09-25 10:22:52,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:22:52,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:22:52,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:22:52,459 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:22:52,461 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 10:22:52,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:22:52,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:22:52,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-25 10:22:52,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:22:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-09-25 10:22:52,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:22:52,867 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-09-25 10:22:52,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855625940] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:22:52,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:22:52,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 19 [2024-09-25 10:22:52,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595700008] [2024-09-25 10:22:52,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:22:52,868 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-25 10:22:52,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:52,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-25 10:22:52,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-09-25 10:22:52,869 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-09-25 10:22:53,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:53,973 INFO L93 Difference]: Finished difference Result 698 states and 1108 transitions. [2024-09-25 10:22:53,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-25 10:22:53,974 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-09-25 10:22:53,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:53,975 INFO L225 Difference]: With dead ends: 698 [2024-09-25 10:22:53,975 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 10:22:53,978 INFO L433 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-09-25 10:22:53,978 INFO L434 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-09-25 10:22:53,978 INFO L435 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-09-25 10:22:53,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 10:22:53,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 10:22:53,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-25 10:22:53,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 10:22:53,980 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2024-09-25 10:22:53,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:53,980 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 10:22:53,980 INFO L475 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-09-25 10:22:53,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:53,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 10:22:53,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 10:22:53,982 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 10:22:53,995 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-25 10:22:54,183 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:22:54,186 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:54,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.