./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/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 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 19:22:22,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:22:22,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:22:22,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:22:22,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:22:22,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:22:22,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:22:22,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:22:22,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:22:22,815 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:22:22,818 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:22:22,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:22:22,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:22:22,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:22:22,820 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:22:22,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:22:22,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:22:22,821 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:22:22,821 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:22:22,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:22:22,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:22:22,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:22:22,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:22:22,824 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:22:22,824 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:22:22,824 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:22:22,825 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:22:22,825 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:22:22,825 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:22:22,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:22:22,826 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:22:22,826 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:22:22,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:22:22,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:22:22,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:22:22,827 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:22:22,827 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:22:22,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:22:22,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:22:22,828 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:22:22,828 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:22:22,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:22:22,829 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.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 19:22:23,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:22:23,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:22:23,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:22:23,083 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:22:23,084 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:22:23,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/heapsort.i [2024-09-11 19:22:24,519 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:22:24,686 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:22:24,687 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/heapsort.i [2024-09-11 19:22:24,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/399ed6ed1/96a29bb6bea9477fa28ffff722a5ed0f/FLAG0b1357cb3 [2024-09-11 19:22:25,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/399ed6ed1/96a29bb6bea9477fa28ffff722a5ed0f [2024-09-11 19:22:25,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:22:25,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:22:25,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:22:25,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:22:25,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:22:25,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:22:25" (1/1) ... [2024-09-11 19:22:25,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db14aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:25, skipping insertion in model container [2024-09-11 19:22:25,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:22:25" (1/1) ... [2024-09-11 19:22:25,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:22:25,289 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2024-09-11 19:22:25,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:22:25,338 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:22:25,364 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2024-09-11 19:22:25,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:22:25,386 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:22:25,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:25 WrapperNode [2024-09-11 19:22:25,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:22:25,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:22:25,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:22:25,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:22:25,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:25" (1/1) ... [2024-09-11 19:22:25,402 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:25" (1/1) ... [2024-09-11 19:22:25,423 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 78 [2024-09-11 19:22:25,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:22:25,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:22:25,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:22:25,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:22:25,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:25" (1/1) ... [2024-09-11 19:22:25,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:25" (1/1) ... [2024-09-11 19:22:25,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:25" (1/1) ... [2024-09-11 19:22:25,447 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-11 19:22:25,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:25" (1/1) ... [2024-09-11 19:22:25,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:25" (1/1) ... [2024-09-11 19:22:25,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:25" (1/1) ... [2024-09-11 19:22:25,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:25" (1/1) ... [2024-09-11 19:22:25,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:25" (1/1) ... [2024-09-11 19:22:25,458 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:25" (1/1) ... [2024-09-11 19:22:25,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:22:25,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:22:25,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:22:25,461 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:22:25,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:25" (1/1) ... [2024-09-11 19:22:25,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:22:25,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:25,504 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-11 19:22:25,508 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-11 19:22:25,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:22:25,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:22:25,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:22:25,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:22:25,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 19:22:25,555 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 19:22:25,623 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:22:25,625 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:22:25,795 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-09-11 19:22:25,795 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:22:25,820 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:22:25,820 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 19:22:25,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:22:25 BoogieIcfgContainer [2024-09-11 19:22:25,820 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:22:25,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:22:25,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:22:25,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:22:25,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:22:25" (1/3) ... [2024-09-11 19:22:25,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d742f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:22:25, skipping insertion in model container [2024-09-11 19:22:25,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:25" (2/3) ... [2024-09-11 19:22:25,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d742f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:22:25, skipping insertion in model container [2024-09-11 19:22:25,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:22:25" (3/3) ... [2024-09-11 19:22:25,830 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort.i [2024-09-11 19:22:25,845 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:22:25,845 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:22:25,898 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:22:25,904 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;@682672b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:22:25,904 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:22:25,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-11 19:22:25,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 19:22:25,914 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:25,915 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:25,915 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:25,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:25,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1492052254, now seen corresponding path program 1 times [2024-09-11 19:22:25,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:25,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109372054] [2024-09-11 19:22:25,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:25,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:26,235 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-11 19:22:26,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:26,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109372054] [2024-09-11 19:22:26,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109372054] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:26,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:26,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:26,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681118648] [2024-09-11 19:22:26,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:26,240 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:26,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:26,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:26,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:26,261 INFO L87 Difference]: Start difference. First operand has 37 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:22:26,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:26,397 INFO L93 Difference]: Finished difference Result 99 states and 189 transitions. [2024-09-11 19:22:26,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:26,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-09-11 19:22:26,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:26,411 INFO L225 Difference]: With dead ends: 99 [2024-09-11 19:22:26,411 INFO L226 Difference]: Without dead ends: 60 [2024-09-11 19:22:26,415 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:26,417 INFO L434 NwaCegarLoop]: 46 mSDtfsCounter, 20 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:26,418 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 168 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:26,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-11 19:22:26,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 38. [2024-09-11 19:22:26,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-11 19:22:26,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2024-09-11 19:22:26,462 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 10 [2024-09-11 19:22:26,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:26,462 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2024-09-11 19:22:26,463 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:22:26,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:26,464 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2024-09-11 19:22:26,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 19:22:26,465 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:26,465 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:26,465 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:22:26,465 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:26,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:26,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1487315485, now seen corresponding path program 1 times [2024-09-11 19:22:26,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:26,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74108640] [2024-09-11 19:22:26,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:26,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:26,623 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-11 19:22:26,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:26,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74108640] [2024-09-11 19:22:26,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74108640] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:26,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:26,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:26,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323600890] [2024-09-11 19:22:26,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:26,627 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:26,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:26,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:26,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:26,629 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:22:26,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:26,731 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2024-09-11 19:22:26,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:26,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-09-11 19:22:26,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:26,733 INFO L225 Difference]: With dead ends: 45 [2024-09-11 19:22:26,733 INFO L226 Difference]: Without dead ends: 43 [2024-09-11 19:22:26,733 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:26,735 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 16 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:26,736 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 136 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:26,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-11 19:22:26,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-09-11 19:22:26,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-11 19:22:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2024-09-11 19:22:26,752 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 10 [2024-09-11 19:22:26,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:26,752 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2024-09-11 19:22:26,752 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:22:26,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:26,754 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2024-09-11 19:22:26,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 19:22:26,755 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:26,755 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:26,755 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:22:26,756 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:26,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:26,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1465865965, now seen corresponding path program 1 times [2024-09-11 19:22:26,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:26,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461783430] [2024-09-11 19:22:26,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:26,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:26,903 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-11 19:22:26,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:26,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461783430] [2024-09-11 19:22:26,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461783430] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:26,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:26,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:22:26,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21990948] [2024-09-11 19:22:26,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:26,906 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:22:26,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:26,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:22:26,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:26,907 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:22:27,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:27,095 INFO L93 Difference]: Finished difference Result 79 states and 117 transitions. [2024-09-11 19:22:27,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:22:27,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-09-11 19:22:27,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:27,098 INFO L225 Difference]: With dead ends: 79 [2024-09-11 19:22:27,098 INFO L226 Difference]: Without dead ends: 77 [2024-09-11 19:22:27,098 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-11 19:22:27,099 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 29 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:27,100 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 194 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-09-11 19:22:27,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2024-09-11 19:22:27,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-09-11 19:22:27,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 101 transitions. [2024-09-11 19:22:27,132 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 101 transitions. Word has length 10 [2024-09-11 19:22:27,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:27,132 INFO L474 AbstractCegarLoop]: Abstraction has 68 states and 101 transitions. [2024-09-11 19:22:27,133 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:22:27,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:27,133 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 101 transitions. [2024-09-11 19:22:27,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-11 19:22:27,135 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:27,135 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:27,135 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 19:22:27,136 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:27,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:27,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1063638546, now seen corresponding path program 1 times [2024-09-11 19:22:27,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:27,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469734116] [2024-09-11 19:22:27,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:27,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:27,287 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:27,294 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-11 19:22:27,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:27,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469734116] [2024-09-11 19:22:27,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469734116] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:27,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:27,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-11 19:22:27,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705009984] [2024-09-11 19:22:27,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:27,296 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:22:27,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:27,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:22:27,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:27,298 INFO L87 Difference]: Start difference. First operand 68 states and 101 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:22:27,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:27,516 INFO L93 Difference]: Finished difference Result 101 states and 152 transitions. [2024-09-11 19:22:27,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:22:27,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-11 19:22:27,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:27,519 INFO L225 Difference]: With dead ends: 101 [2024-09-11 19:22:27,519 INFO L226 Difference]: Without dead ends: 99 [2024-09-11 19:22:27,519 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-11 19:22:27,520 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 43 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:27,521 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 187 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:22:27,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-09-11 19:22:27,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2024-09-11 19:22:27,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 50 states have (on average 1.34) internal successors, (67), 51 states have internal predecessors, (67), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-09-11 19:22:27,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 147 transitions. [2024-09-11 19:22:27,567 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 147 transitions. Word has length 15 [2024-09-11 19:22:27,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:27,567 INFO L474 AbstractCegarLoop]: Abstraction has 96 states and 147 transitions. [2024-09-11 19:22:27,567 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:22:27,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 147 transitions. [2024-09-11 19:22:27,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-11 19:22:27,569 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:27,569 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:27,569 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-11 19:22:27,570 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:27,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:27,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1445001009, now seen corresponding path program 1 times [2024-09-11 19:22:27,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:27,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629555179] [2024-09-11 19:22:27,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:27,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:27,647 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:27,655 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-11 19:22:27,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:27,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629555179] [2024-09-11 19:22:27,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629555179] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:27,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:27,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:27,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899649241] [2024-09-11 19:22:27,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:27,658 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:27,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:27,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:27,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:27,659 INFO L87 Difference]: Start difference. First operand 96 states and 147 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:22:27,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:27,751 INFO L93 Difference]: Finished difference Result 102 states and 152 transitions. [2024-09-11 19:22:27,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:27,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-11 19:22:27,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:27,756 INFO L225 Difference]: With dead ends: 102 [2024-09-11 19:22:27,756 INFO L226 Difference]: Without dead ends: 100 [2024-09-11 19:22:27,757 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:27,760 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:27,760 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 136 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:27,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-09-11 19:22:27,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-09-11 19:22:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 53 states have (on average 1.320754716981132) internal successors, (70), 54 states have internal predecessors, (70), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-09-11 19:22:27,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 150 transitions. [2024-09-11 19:22:27,803 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 150 transitions. Word has length 15 [2024-09-11 19:22:27,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:27,804 INFO L474 AbstractCegarLoop]: Abstraction has 100 states and 150 transitions. [2024-09-11 19:22:27,804 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:22:27,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:27,804 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 150 transitions. [2024-09-11 19:22:27,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-11 19:22:27,806 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:27,806 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:27,806 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-11 19:22:27,806 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:27,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:27,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1429998849, now seen corresponding path program 1 times [2024-09-11 19:22:27,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:27,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610027782] [2024-09-11 19:22:27,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:27,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:27,909 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:27,915 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-11 19:22:27,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:27,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610027782] [2024-09-11 19:22:27,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610027782] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:27,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:27,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-11 19:22:27,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463967795] [2024-09-11 19:22:27,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:27,919 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:22:27,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:27,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:22:27,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:27,920 INFO L87 Difference]: Start difference. First operand 100 states and 150 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:22:28,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:28,204 INFO L93 Difference]: Finished difference Result 154 states and 239 transitions. [2024-09-11 19:22:28,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:22:28,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-11 19:22:28,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:28,207 INFO L225 Difference]: With dead ends: 154 [2024-09-11 19:22:28,209 INFO L226 Difference]: Without dead ends: 152 [2024-09-11 19:22:28,209 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-11 19:22:28,211 INFO L434 NwaCegarLoop]: 62 mSDtfsCounter, 55 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:28,215 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 270 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:22:28,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-09-11 19:22:28,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 136. [2024-09-11 19:22:28,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 71 states have internal predecessors, (93), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-09-11 19:22:28,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 213 transitions. [2024-09-11 19:22:28,266 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 213 transitions. Word has length 15 [2024-09-11 19:22:28,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:28,267 INFO L474 AbstractCegarLoop]: Abstraction has 136 states and 213 transitions. [2024-09-11 19:22:28,267 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:22:28,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:28,267 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 213 transitions. [2024-09-11 19:22:28,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-11 19:22:28,268 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:28,268 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:28,268 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-11 19:22:28,268 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:28,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:28,269 INFO L85 PathProgramCache]: Analyzing trace with hash 476832532, now seen corresponding path program 1 times [2024-09-11 19:22:28,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:28,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479068188] [2024-09-11 19:22:28,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:28,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:28,284 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:28,288 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-11 19:22:28,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:28,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479068188] [2024-09-11 19:22:28,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479068188] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:28,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:28,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:22:28,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665043609] [2024-09-11 19:22:28,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:28,289 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:22:28,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:28,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:22:28,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:22:28,290 INFO L87 Difference]: Start difference. First operand 136 states and 213 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:22:28,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:28,349 INFO L93 Difference]: Finished difference Result 273 states and 435 transitions. [2024-09-11 19:22:28,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:22:28,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-11 19:22:28,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:28,352 INFO L225 Difference]: With dead ends: 273 [2024-09-11 19:22:28,353 INFO L226 Difference]: Without dead ends: 204 [2024-09-11 19:22:28,354 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 19:22:28,355 INFO L434 NwaCegarLoop]: 68 mSDtfsCounter, 11 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:28,355 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 114 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:22:28,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-09-11 19:22:28,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-09-11 19:22:28,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 102 states have internal predecessors, (138), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (98), 94 states have call predecessors, (98), 98 states have call successors, (98) [2024-09-11 19:22:28,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 334 transitions. [2024-09-11 19:22:28,428 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 334 transitions. Word has length 15 [2024-09-11 19:22:28,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:28,429 INFO L474 AbstractCegarLoop]: Abstraction has 204 states and 334 transitions. [2024-09-11 19:22:28,429 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:22:28,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 334 transitions. [2024-09-11 19:22:28,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-11 19:22:28,431 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:28,431 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:28,431 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-11 19:22:28,431 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:28,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:28,432 INFO L85 PathProgramCache]: Analyzing trace with hash 843192835, now seen corresponding path program 1 times [2024-09-11 19:22:28,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:28,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284918380] [2024-09-11 19:22:28,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:28,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:28,491 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:28,495 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-11 19:22:28,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:28,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284918380] [2024-09-11 19:22:28,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284918380] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:28,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:28,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:28,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556027051] [2024-09-11 19:22:28,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:28,496 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:28,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:28,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:28,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:28,497 INFO L87 Difference]: Start difference. First operand 204 states and 334 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:22:28,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:28,596 INFO L93 Difference]: Finished difference Result 228 states and 357 transitions. [2024-09-11 19:22:28,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:28,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-11 19:22:28,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:28,599 INFO L225 Difference]: With dead ends: 228 [2024-09-11 19:22:28,599 INFO L226 Difference]: Without dead ends: 182 [2024-09-11 19:22:28,599 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:28,600 INFO L434 NwaCegarLoop]: 54 mSDtfsCounter, 6 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:28,602 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:22:28,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-09-11 19:22:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2024-09-11 19:22:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 92 states have internal predecessors, (123), 86 states have call successors, (86), 7 states have call predecessors, (86), 7 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2024-09-11 19:22:28,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 295 transitions. [2024-09-11 19:22:28,653 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 295 transitions. Word has length 15 [2024-09-11 19:22:28,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:28,653 INFO L474 AbstractCegarLoop]: Abstraction has 182 states and 295 transitions. [2024-09-11 19:22:28,654 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:22:28,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:28,654 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 295 transitions. [2024-09-11 19:22:28,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-11 19:22:28,656 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:28,657 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:28,657 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-11 19:22:28,657 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:28,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:28,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1745067101, now seen corresponding path program 1 times [2024-09-11 19:22:28,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:28,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189705969] [2024-09-11 19:22:28,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:28,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:28,736 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:28,740 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 19:22:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:28,746 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-11 19:22:28,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:28,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189705969] [2024-09-11 19:22:28,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189705969] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:28,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:28,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:22:28,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196617954] [2024-09-11 19:22:28,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:28,749 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:22:28,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:28,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:22:28,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:28,750 INFO L87 Difference]: Start difference. First operand 182 states and 295 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:22:28,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:28,907 INFO L93 Difference]: Finished difference Result 216 states and 347 transitions. [2024-09-11 19:22:28,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:22:28,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-09-11 19:22:28,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:28,910 INFO L225 Difference]: With dead ends: 216 [2024-09-11 19:22:28,910 INFO L226 Difference]: Without dead ends: 214 [2024-09-11 19:22:28,911 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-11 19:22:28,911 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 41 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:28,912 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 223 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:28,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-09-11 19:22:28,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 196. [2024-09-11 19:22:28,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 101 states have internal predecessors, (132), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2024-09-11 19:22:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 316 transitions. [2024-09-11 19:22:28,988 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 316 transitions. Word has length 22 [2024-09-11 19:22:28,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:28,990 INFO L474 AbstractCegarLoop]: Abstraction has 196 states and 316 transitions. [2024-09-11 19:22:28,990 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:22:28,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:28,990 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 316 transitions. [2024-09-11 19:22:28,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-11 19:22:28,992 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:28,992 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:28,992 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-11 19:22:28,992 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:28,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash -790320915, now seen corresponding path program 1 times [2024-09-11 19:22:28,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:28,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908875064] [2024-09-11 19:22:28,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:28,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:29,051 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:29,054 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 19:22:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:29,057 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-11 19:22:29,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:29,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908875064] [2024-09-11 19:22:29,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908875064] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:29,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:29,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:29,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740236141] [2024-09-11 19:22:29,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:29,059 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:29,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:29,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:29,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:29,060 INFO L87 Difference]: Start difference. First operand 196 states and 316 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:22:29,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:29,343 INFO L93 Difference]: Finished difference Result 519 states and 853 transitions. [2024-09-11 19:22:29,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:22:29,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-09-11 19:22:29,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:29,347 INFO L225 Difference]: With dead ends: 519 [2024-09-11 19:22:29,348 INFO L226 Difference]: Without dead ends: 365 [2024-09-11 19:22:29,349 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-11 19:22:29,349 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 83 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:29,350 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 92 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:22:29,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-09-11 19:22:29,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 196. [2024-09-11 19:22:29,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 95 states have (on average 1.368421052631579) internal successors, (130), 101 states have internal predecessors, (130), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2024-09-11 19:22:29,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 314 transitions. [2024-09-11 19:22:29,424 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 314 transitions. Word has length 24 [2024-09-11 19:22:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:29,426 INFO L474 AbstractCegarLoop]: Abstraction has 196 states and 314 transitions. [2024-09-11 19:22:29,426 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:22:29,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:29,426 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 314 transitions. [2024-09-11 19:22:29,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-11 19:22:29,426 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:29,427 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:29,427 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-11 19:22:29,427 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:29,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:29,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1386762239, now seen corresponding path program 1 times [2024-09-11 19:22:29,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:29,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138325125] [2024-09-11 19:22:29,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:29,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:29,509 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:29,513 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 19:22:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:29,516 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 19:22:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:29,519 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-11 19:22:29,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:29,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138325125] [2024-09-11 19:22:29,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138325125] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:29,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:29,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:22:29,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361328863] [2024-09-11 19:22:29,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:29,520 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:22:29,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:29,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:22:29,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:29,521 INFO L87 Difference]: Start difference. First operand 196 states and 314 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 19:22:29,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:29,722 INFO L93 Difference]: Finished difference Result 290 states and 470 transitions. [2024-09-11 19:22:29,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:22:29,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-09-11 19:22:29,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:29,726 INFO L225 Difference]: With dead ends: 290 [2024-09-11 19:22:29,727 INFO L226 Difference]: Without dead ends: 288 [2024-09-11 19:22:29,727 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 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-11 19:22:29,728 INFO L434 NwaCegarLoop]: 65 mSDtfsCounter, 25 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:29,729 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 233 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-09-11 19:22:29,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 268. [2024-09-11 19:22:29,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 117 states have (on average 1.3675213675213675) internal successors, (160), 131 states have internal predecessors, (160), 140 states have call successors, (140), 10 states have call predecessors, (140), 10 states have return successors, (140), 126 states have call predecessors, (140), 140 states have call successors, (140) [2024-09-11 19:22:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 440 transitions. [2024-09-11 19:22:29,799 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 440 transitions. Word has length 25 [2024-09-11 19:22:29,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:29,799 INFO L474 AbstractCegarLoop]: Abstraction has 268 states and 440 transitions. [2024-09-11 19:22:29,800 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 19:22:29,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:29,800 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 440 transitions. [2024-09-11 19:22:29,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-11 19:22:29,801 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:29,801 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] [2024-09-11 19:22:29,801 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-11 19:22:29,802 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:29,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:29,802 INFO L85 PathProgramCache]: Analyzing trace with hash 195962487, now seen corresponding path program 1 times [2024-09-11 19:22:29,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:29,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985394918] [2024-09-11 19:22:29,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:29,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:29,909 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:29,914 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 19:22:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:29,918 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-11 19:22:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:29,921 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-11 19:22:29,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:29,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985394918] [2024-09-11 19:22:29,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985394918] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:29,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:29,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-11 19:22:29,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625303498] [2024-09-11 19:22:29,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:29,926 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:22:29,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:29,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:22:29,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:29,927 INFO L87 Difference]: Start difference. First operand 268 states and 440 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 19:22:30,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:30,157 INFO L93 Difference]: Finished difference Result 316 states and 515 transitions. [2024-09-11 19:22:30,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:22:30,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-09-11 19:22:30,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:30,160 INFO L225 Difference]: With dead ends: 316 [2024-09-11 19:22:30,161 INFO L226 Difference]: Without dead ends: 314 [2024-09-11 19:22:30,161 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 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-11 19:22:30,162 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 71 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:30,162 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 187 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:30,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-09-11 19:22:30,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 286. [2024-09-11 19:22:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 140 states have internal predecessors, (169), 150 states have call successors, (150), 11 states have call predecessors, (150), 11 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2024-09-11 19:22:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 469 transitions. [2024-09-11 19:22:30,251 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 469 transitions. Word has length 27 [2024-09-11 19:22:30,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:30,251 INFO L474 AbstractCegarLoop]: Abstraction has 286 states and 469 transitions. [2024-09-11 19:22:30,251 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 19:22:30,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:30,252 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 469 transitions. [2024-09-11 19:22:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-11 19:22:30,253 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:30,254 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] [2024-09-11 19:22:30,254 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-11 19:22:30,255 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:30,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:30,255 INFO L85 PathProgramCache]: Analyzing trace with hash -298962274, now seen corresponding path program 1 times [2024-09-11 19:22:30,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:30,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899117955] [2024-09-11 19:22:30,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:30,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:30,338 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:30,342 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 19:22:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:30,346 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 19:22:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:30,349 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 19:22:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:30,352 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-11 19:22:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:30,355 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-11 19:22:30,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:30,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899117955] [2024-09-11 19:22:30,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899117955] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:30,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:30,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-11 19:22:30,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206094604] [2024-09-11 19:22:30,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:30,357 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:22:30,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:30,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:22:30,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:30,357 INFO L87 Difference]: Start difference. First operand 286 states and 469 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 19:22:30,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:30,593 INFO L93 Difference]: Finished difference Result 328 states and 526 transitions. [2024-09-11 19:22:30,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:22:30,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2024-09-11 19:22:30,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:30,597 INFO L225 Difference]: With dead ends: 328 [2024-09-11 19:22:30,597 INFO L226 Difference]: Without dead ends: 326 [2024-09-11 19:22:30,598 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 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-11 19:22:30,599 INFO L434 NwaCegarLoop]: 62 mSDtfsCounter, 35 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:30,599 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 258 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:30,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-09-11 19:22:30,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 290. [2024-09-11 19:22:30,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 127 states have (on average 1.3543307086614174) internal successors, (172), 143 states have internal predecessors, (172), 150 states have call successors, (150), 12 states have call predecessors, (150), 12 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2024-09-11 19:22:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 472 transitions. [2024-09-11 19:22:30,694 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 472 transitions. Word has length 37 [2024-09-11 19:22:30,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:30,694 INFO L474 AbstractCegarLoop]: Abstraction has 290 states and 472 transitions. [2024-09-11 19:22:30,694 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 19:22:30,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:30,695 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 472 transitions. [2024-09-11 19:22:30,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-11 19:22:30,697 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:30,697 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] [2024-09-11 19:22:30,697 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-11 19:22:30,697 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:30,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:30,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1033855744, now seen corresponding path program 1 times [2024-09-11 19:22:30,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:30,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218827250] [2024-09-11 19:22:30,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:30,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:30,779 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:30,781 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 19:22:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:30,783 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:22:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:30,786 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 19:22:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:30,789 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-11 19:22:30,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:30,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218827250] [2024-09-11 19:22:30,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218827250] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:30,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:30,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-11 19:22:30,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232216579] [2024-09-11 19:22:30,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:30,791 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:22:30,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:30,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:22:30,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:30,791 INFO L87 Difference]: Start difference. First operand 290 states and 472 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:22:30,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:30,990 INFO L93 Difference]: Finished difference Result 312 states and 501 transitions. [2024-09-11 19:22:30,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 19:22:30,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2024-09-11 19:22:30,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:30,993 INFO L225 Difference]: With dead ends: 312 [2024-09-11 19:22:30,993 INFO L226 Difference]: Without dead ends: 310 [2024-09-11 19:22:30,993 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 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-11 19:22:30,994 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 29 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:30,994 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 147 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:30,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-09-11 19:22:31,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 294. [2024-09-11 19:22:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 130 states have (on average 1.3461538461538463) internal successors, (175), 146 states have internal predecessors, (175), 150 states have call successors, (150), 13 states have call predecessors, (150), 13 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2024-09-11 19:22:31,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 475 transitions. [2024-09-11 19:22:31,080 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 475 transitions. Word has length 37 [2024-09-11 19:22:31,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:31,080 INFO L474 AbstractCegarLoop]: Abstraction has 294 states and 475 transitions. [2024-09-11 19:22:31,081 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:22:31,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 475 transitions. [2024-09-11 19:22:31,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-11 19:22:31,082 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:31,082 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] [2024-09-11 19:22:31,082 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-11 19:22:31,082 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:31,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:31,082 INFO L85 PathProgramCache]: Analyzing trace with hash -285091126, now seen corresponding path program 1 times [2024-09-11 19:22:31,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:31,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536903996] [2024-09-11 19:22:31,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:31,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:31,162 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:31,164 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 19:22:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:31,167 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:22:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:31,169 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 19:22:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:31,172 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-11 19:22:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:31,174 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 19:22:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:31,180 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-11 19:22:31,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:31,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536903996] [2024-09-11 19:22:31,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536903996] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:31,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:31,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-11 19:22:31,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75350747] [2024-09-11 19:22:31,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:31,181 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:22:31,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:31,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:22:31,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:31,182 INFO L87 Difference]: Start difference. First operand 294 states and 475 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-11 19:22:31,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:31,366 INFO L93 Difference]: Finished difference Result 328 states and 524 transitions. [2024-09-11 19:22:31,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 19:22:31,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2024-09-11 19:22:31,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:31,370 INFO L225 Difference]: With dead ends: 328 [2024-09-11 19:22:31,370 INFO L226 Difference]: Without dead ends: 326 [2024-09-11 19:22:31,371 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 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-11 19:22:31,371 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 40 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:31,372 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 213 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:31,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-09-11 19:22:31,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 173. [2024-09-11 19:22:31,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 92 states have internal predecessors, (107), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2024-09-11 19:22:31,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 259 transitions. [2024-09-11 19:22:31,422 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 259 transitions. Word has length 49 [2024-09-11 19:22:31,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:31,422 INFO L474 AbstractCegarLoop]: Abstraction has 173 states and 259 transitions. [2024-09-11 19:22:31,422 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-11 19:22:31,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:31,423 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 259 transitions. [2024-09-11 19:22:31,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-09-11 19:22:31,424 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:31,424 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] [2024-09-11 19:22:31,424 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-11 19:22:31,424 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:31,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:31,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1647948154, now seen corresponding path program 1 times [2024-09-11 19:22:31,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:31,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732999011] [2024-09-11 19:22:31,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:31,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:31,501 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:31,503 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 19:22:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:31,506 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-11 19:22:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:31,508 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 19:22:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:31,510 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-11 19:22:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:31,512 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-11 19:22:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:31,524 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 19:22:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:31,530 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-11 19:22:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:31,532 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-09-11 19:22:31,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:31,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732999011] [2024-09-11 19:22:31,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732999011] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:31,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132707629] [2024-09-11 19:22:31,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:31,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:31,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:31,536 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-11 19:22:31,538 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-11 19:22:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:31,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-11 19:22:31,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:31,726 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-11 19:22:31,730 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:22:31,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132707629] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:31,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 19:22:31,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2024-09-11 19:22:31,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124857795] [2024-09-11 19:22:31,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:31,731 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:22:31,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:31,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:22:31,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-09-11 19:22:31,732 INFO L87 Difference]: Start difference. First operand 173 states and 259 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-11 19:22:32,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:32,002 INFO L93 Difference]: Finished difference Result 500 states and 794 transitions. [2024-09-11 19:22:32,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 19:22:32,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2024-09-11 19:22:32,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:32,006 INFO L225 Difference]: With dead ends: 500 [2024-09-11 19:22:32,006 INFO L226 Difference]: Without dead ends: 330 [2024-09-11 19:22:32,007 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-09-11 19:22:32,008 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 35 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:32,008 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 182 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:32,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-09-11 19:22:32,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 310. [2024-09-11 19:22:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 135 states have (on average 1.348148148148148) internal successors, (182), 151 states have internal predecessors, (182), 162 states have call successors, (162), 12 states have call predecessors, (162), 12 states have return successors, (162), 146 states have call predecessors, (162), 162 states have call successors, (162) [2024-09-11 19:22:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 506 transitions. [2024-09-11 19:22:32,119 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 506 transitions. Word has length 57 [2024-09-11 19:22:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:32,119 INFO L474 AbstractCegarLoop]: Abstraction has 310 states and 506 transitions. [2024-09-11 19:22:32,119 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-11 19:22:32,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:32,120 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 506 transitions. [2024-09-11 19:22:32,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-09-11 19:22:32,121 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:32,121 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] [2024-09-11 19:22:32,139 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-11 19:22:32,322 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-11 19:22:32,322 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:32,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:32,323 INFO L85 PathProgramCache]: Analyzing trace with hash 242531336, now seen corresponding path program 1 times [2024-09-11 19:22:32,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:32,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510615879] [2024-09-11 19:22:32,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:32,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:32,433 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:32,437 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 19:22:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:32,439 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 19:22:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:32,441 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 19:22:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:32,444 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-11 19:22:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:32,446 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-11 19:22:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:32,448 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-11 19:22:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:32,453 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-11 19:22:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:32,456 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-11 19:22:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:32,458 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 19:22:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:32,460 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-11 19:22:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:32,462 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-11 19:22:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:32,465 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-11 19:22:32,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:32,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510615879] [2024-09-11 19:22:32,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510615879] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:32,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973452560] [2024-09-11 19:22:32,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:32,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:32,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:32,468 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-11 19:22:32,469 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-11 19:22:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:32,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-11 19:22:32,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:32,740 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-11 19:22:32,740 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:22:32,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973452560] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:32,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 19:22:32,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-09-11 19:22:32,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134530433] [2024-09-11 19:22:32,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:32,741 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:22:32,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:32,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:22:32,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-09-11 19:22:32,742 INFO L87 Difference]: Start difference. First operand 310 states and 506 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-09-11 19:22:33,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:33,121 INFO L93 Difference]: Finished difference Result 577 states and 924 transitions. [2024-09-11 19:22:33,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 19:22:33,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 79 [2024-09-11 19:22:33,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:33,125 INFO L225 Difference]: With dead ends: 577 [2024-09-11 19:22:33,126 INFO L226 Difference]: Without dead ends: 301 [2024-09-11 19:22:33,127 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-09-11 19:22:33,128 INFO L434 NwaCegarLoop]: 62 mSDtfsCounter, 30 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:33,128 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 266 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:22:33,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-09-11 19:22:33,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 266. [2024-09-11 19:22:33,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 123 states have (on average 1.3170731707317074) internal successors, (162), 135 states have internal predecessors, (162), 130 states have call successors, (130), 12 states have call predecessors, (130), 12 states have return successors, (130), 118 states have call predecessors, (130), 130 states have call successors, (130) [2024-09-11 19:22:33,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 422 transitions. [2024-09-11 19:22:33,237 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 422 transitions. Word has length 79 [2024-09-11 19:22:33,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:33,237 INFO L474 AbstractCegarLoop]: Abstraction has 266 states and 422 transitions. [2024-09-11 19:22:33,237 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-09-11 19:22:33,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:33,237 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 422 transitions. [2024-09-11 19:22:33,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-09-11 19:22:33,239 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:33,239 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] [2024-09-11 19:22:33,255 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 19:22:33,442 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-09-11 19:22:33,443 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:33,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:33,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1780871366, now seen corresponding path program 1 times [2024-09-11 19:22:33,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:33,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983372212] [2024-09-11 19:22:33,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:33,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:33,541 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:33,545 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 19:22:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:33,548 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 19:22:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:33,550 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 19:22:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:33,552 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-11 19:22:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:33,554 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-11 19:22:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:33,556 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-11 19:22:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:33,559 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-11 19:22:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:33,561 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-11 19:22:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:33,563 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 19:22:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:33,566 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-11 19:22:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:33,568 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-11 19:22:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:33,571 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-11 19:22:33,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:33,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983372212] [2024-09-11 19:22:33,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983372212] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:33,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101478736] [2024-09-11 19:22:33,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:33,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:33,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:33,574 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-11 19:22:33,576 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-11 19:22:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:33,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 19:22:33,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:33,793 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-11 19:22:33,794 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:22:33,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101478736] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:33,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 19:22:33,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-09-11 19:22:33,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118082849] [2024-09-11 19:22:33,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:33,796 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:22:33,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:33,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:22:33,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-09-11 19:22:33,796 INFO L87 Difference]: Start difference. First operand 266 states and 422 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-09-11 19:22:34,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:34,040 INFO L93 Difference]: Finished difference Result 495 states and 778 transitions. [2024-09-11 19:22:34,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:22:34,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2024-09-11 19:22:34,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:34,043 INFO L225 Difference]: With dead ends: 495 [2024-09-11 19:22:34,043 INFO L226 Difference]: Without dead ends: 219 [2024-09-11 19:22:34,045 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-09-11 19:22:34,045 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 21 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:34,045 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 145 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:34,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-09-11 19:22:34,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 209. [2024-09-11 19:22:34,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 98 states have (on average 1.2857142857142858) internal successors, (126), 108 states have internal predecessors, (126), 98 states have call successors, (98), 12 states have call predecessors, (98), 12 states have return successors, (98), 88 states have call predecessors, (98), 98 states have call successors, (98) [2024-09-11 19:22:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 322 transitions. [2024-09-11 19:22:34,108 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 322 transitions. Word has length 79 [2024-09-11 19:22:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:34,109 INFO L474 AbstractCegarLoop]: Abstraction has 209 states and 322 transitions. [2024-09-11 19:22:34,109 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-09-11 19:22:34,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 322 transitions. [2024-09-11 19:22:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-09-11 19:22:34,110 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:34,110 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] [2024-09-11 19:22:34,127 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-11 19:22:34,314 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-09-11 19:22:34,315 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:34,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:34,315 INFO L85 PathProgramCache]: Analyzing trace with hash 345657593, now seen corresponding path program 1 times [2024-09-11 19:22:34,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:34,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223742218] [2024-09-11 19:22:34,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:34,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:34,433 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:34,435 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 19:22:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:34,437 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:22:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:34,439 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 19:22:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:34,442 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-11 19:22:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:34,444 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 19:22:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:34,446 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-11 19:22:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:34,448 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-11 19:22:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:34,451 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 19:22:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:34,454 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-11 19:22:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:34,456 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-11 19:22:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:34,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-09-11 19:22:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:34,462 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 37 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-09-11 19:22:34,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:34,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223742218] [2024-09-11 19:22:34,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223742218] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:34,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636534821] [2024-09-11 19:22:34,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:34,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:34,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:34,465 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-11 19:22:34,467 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-11 19:22:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:34,520 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-11 19:22:34,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:34,603 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-11 19:22:34,603 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:22:34,738 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-11 19:22:34,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636534821] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:22:34,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:22:34,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2024-09-11 19:22:34,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069373876] [2024-09-11 19:22:34,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:22:34,739 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-11 19:22:34,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:34,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-11 19:22:34,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-09-11 19:22:34,740 INFO L87 Difference]: Start difference. First operand 209 states and 322 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 7 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2024-09-11 19:22:36,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:36,171 INFO L93 Difference]: Finished difference Result 514 states and 774 transitions. [2024-09-11 19:22:36,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-11 19:22:36,172 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 7 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) Word has length 84 [2024-09-11 19:22:36,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:36,175 INFO L225 Difference]: With dead ends: 514 [2024-09-11 19:22:36,175 INFO L226 Difference]: Without dead ends: 344 [2024-09-11 19:22:36,177 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=549, Invalid=1613, Unknown=0, NotChecked=0, Total=2162 [2024-09-11 19:22:36,177 INFO L434 NwaCegarLoop]: 145 mSDtfsCounter, 180 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:36,178 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1265 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-11 19:22:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-09-11 19:22:36,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 240. [2024-09-11 19:22:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 120 states have (on average 1.2583333333333333) internal successors, (151), 130 states have internal predecessors, (151), 105 states have call successors, (105), 14 states have call predecessors, (105), 14 states have return successors, (105), 95 states have call predecessors, (105), 105 states have call successors, (105) [2024-09-11 19:22:36,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 361 transitions. [2024-09-11 19:22:36,279 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 361 transitions. Word has length 84 [2024-09-11 19:22:36,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:36,279 INFO L474 AbstractCegarLoop]: Abstraction has 240 states and 361 transitions. [2024-09-11 19:22:36,279 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 7 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2024-09-11 19:22:36,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:36,280 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 361 transitions. [2024-09-11 19:22:36,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-09-11 19:22:36,283 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:36,283 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] [2024-09-11 19:22:36,300 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-11 19:22:36,487 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:36,488 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:36,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:36,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2105137319, now seen corresponding path program 1 times [2024-09-11 19:22:36,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:36,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701325235] [2024-09-11 19:22:36,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:36,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:36,606 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:36,608 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 19:22:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:36,610 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:22:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:36,612 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 19:22:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:36,614 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-11 19:22:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:36,616 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 19:22:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:36,618 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-11 19:22:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:36,620 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-11 19:22:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:36,624 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 19:22:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:36,626 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-11 19:22:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:36,627 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-11 19:22:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:36,629 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-09-11 19:22:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:36,632 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-09-11 19:22:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:36,635 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-09-11 19:22:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:36,638 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-09-11 19:22:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:36,639 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-09-11 19:22:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:36,640 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-09-11 19:22:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:36,641 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-09-11 19:22:36,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:36,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701325235] [2024-09-11 19:22:36,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701325235] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:36,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419566646] [2024-09-11 19:22:36,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:36,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:36,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:36,644 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-11 19:22:36,645 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-11 19:22:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:36,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 19:22:36,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:36,882 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 210 proven. 7 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-09-11 19:22:36,882 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:22:37,089 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-09-11 19:22:37,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419566646] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:22:37,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:22:37,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-09-11 19:22:37,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483648091] [2024-09-11 19:22:37,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:22:37,093 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-11 19:22:37,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:37,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-11 19:22:37,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2024-09-11 19:22:37,098 INFO L87 Difference]: Start difference. First operand 240 states and 361 transitions. Second operand has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 12 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (46), 12 states have call predecessors, (46), 12 states have call successors, (46) [2024-09-11 19:22:39,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:39,262 INFO L93 Difference]: Finished difference Result 849 states and 1341 transitions. [2024-09-11 19:22:39,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-09-11 19:22:39,262 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 12 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (46), 12 states have call predecessors, (46), 12 states have call successors, (46) Word has length 111 [2024-09-11 19:22:39,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:39,267 INFO L225 Difference]: With dead ends: 849 [2024-09-11 19:22:39,267 INFO L226 Difference]: Without dead ends: 482 [2024-09-11 19:22:39,269 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=943, Invalid=2839, Unknown=0, NotChecked=0, Total=3782 [2024-09-11 19:22:39,270 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 377 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:39,270 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 919 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-09-11 19:22:39,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-09-11 19:22:39,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 369. [2024-09-11 19:22:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 169 states have (on average 1.2662721893491125) internal successors, (214), 183 states have internal predecessors, (214), 186 states have call successors, (186), 13 states have call predecessors, (186), 13 states have return successors, (186), 172 states have call predecessors, (186), 186 states have call successors, (186) [2024-09-11 19:22:39,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 586 transitions. [2024-09-11 19:22:39,429 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 586 transitions. Word has length 111 [2024-09-11 19:22:39,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:39,430 INFO L474 AbstractCegarLoop]: Abstraction has 369 states and 586 transitions. [2024-09-11 19:22:39,430 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 12 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (46), 12 states have call predecessors, (46), 12 states have call successors, (46) [2024-09-11 19:22:39,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:39,430 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 586 transitions. [2024-09-11 19:22:39,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-09-11 19:22:39,432 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:39,432 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] [2024-09-11 19:22:39,448 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-11 19:22:39,635 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:39,636 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:39,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:39,636 INFO L85 PathProgramCache]: Analyzing trace with hash -844220069, now seen corresponding path program 1 times [2024-09-11 19:22:39,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:39,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37677728] [2024-09-11 19:22:39,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:39,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,776 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,779 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 19:22:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,781 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:22:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,783 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 19:22:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,785 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-11 19:22:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,787 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 19:22:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,788 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-11 19:22:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,790 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-11 19:22:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,792 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 19:22:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,795 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-11 19:22:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,799 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-11 19:22:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,801 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-09-11 19:22:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,804 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-09-11 19:22:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,806 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-09-11 19:22:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,808 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-09-11 19:22:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,810 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-09-11 19:22:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,813 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-09-11 19:22:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,816 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-11 19:22:39,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:39,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37677728] [2024-09-11 19:22:39,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37677728] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:39,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368833605] [2024-09-11 19:22:39,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:39,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:39,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:39,832 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-11 19:22:39,834 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-11 19:22:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-11 19:22:39,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:40,103 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-11 19:22:40,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:22:40,310 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-11 19:22:40,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368833605] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:22:40,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:22:40,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-09-11 19:22:40,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246537183] [2024-09-11 19:22:40,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:22:40,311 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-11 19:22:40,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:40,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-11 19:22:40,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-09-11 19:22:40,312 INFO L87 Difference]: Start difference. First operand 369 states and 586 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 18 states have internal predecessors, (65), 8 states have call successors, (50), 3 states have call predecessors, (50), 1 states have return successors, (47), 8 states have call predecessors, (47), 8 states have call successors, (47) [2024-09-11 19:22:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:41,753 INFO L93 Difference]: Finished difference Result 856 states and 1367 transitions. [2024-09-11 19:22:41,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-11 19:22:41,755 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 18 states have internal predecessors, (65), 8 states have call successors, (50), 3 states have call predecessors, (50), 1 states have return successors, (47), 8 states have call predecessors, (47), 8 states have call successors, (47) Word has length 111 [2024-09-11 19:22:41,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:41,761 INFO L225 Difference]: With dead ends: 856 [2024-09-11 19:22:41,761 INFO L226 Difference]: Without dead ends: 738 [2024-09-11 19:22:41,763 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 244 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=363, Invalid=1119, Unknown=0, NotChecked=0, Total=1482 [2024-09-11 19:22:41,763 INFO L434 NwaCegarLoop]: 78 mSDtfsCounter, 318 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:41,764 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 657 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-11 19:22:41,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-09-11 19:22:41,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 413. [2024-09-11 19:22:41,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 184 states have (on average 1.2771739130434783) internal successors, (235), 206 states have internal predecessors, (235), 212 states have call successors, (212), 16 states have call predecessors, (212), 16 states have return successors, (212), 190 states have call predecessors, (212), 212 states have call successors, (212) [2024-09-11 19:22:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 659 transitions. [2024-09-11 19:22:41,932 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 659 transitions. Word has length 111 [2024-09-11 19:22:41,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:41,933 INFO L474 AbstractCegarLoop]: Abstraction has 413 states and 659 transitions. [2024-09-11 19:22:41,933 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 18 states have internal predecessors, (65), 8 states have call successors, (50), 3 states have call predecessors, (50), 1 states have return successors, (47), 8 states have call predecessors, (47), 8 states have call successors, (47) [2024-09-11 19:22:41,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:41,933 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 659 transitions. [2024-09-11 19:22:41,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-09-11 19:22:41,936 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:41,936 INFO L216 NwaCegarLoop]: trace histogram [32, 31, 31, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:41,954 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-11 19:22:42,136 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:42,137 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:42,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:42,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1492040008, now seen corresponding path program 2 times [2024-09-11 19:22:42,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:42,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638698152] [2024-09-11 19:22:42,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:42,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,345 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,349 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 19:22:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,351 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 19:22:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,354 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 19:22:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,356 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-11 19:22:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,358 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-11 19:22:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,360 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 19:22:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,362 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-11 19:22:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,364 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 19:22:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,366 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-11 19:22:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,368 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-09-11 19:22:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,370 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-11 19:22:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,373 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-09-11 19:22:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,375 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-09-11 19:22:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,377 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-09-11 19:22:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,380 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-09-11 19:22:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,382 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-09-11 19:22:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,386 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-09-11 19:22:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,388 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-09-11 19:22:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,390 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-09-11 19:22:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,393 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-09-11 19:22:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,396 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-09-11 19:22:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,399 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-09-11 19:22:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,401 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-09-11 19:22:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,403 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-09-11 19:22:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,405 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-09-11 19:22:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,408 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-09-11 19:22:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,410 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-09-11 19:22:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,413 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-09-11 19:22:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,416 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-09-11 19:22:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,418 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-09-11 19:22:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:42,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1986 backedges. 62 proven. 47 refuted. 0 times theorem prover too weak. 1877 trivial. 0 not checked. [2024-09-11 19:22:42,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:42,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638698152] [2024-09-11 19:22:42,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638698152] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:42,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269026804] [2024-09-11 19:22:42,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:22:42,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:42,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:42,424 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-11 19:22:42,426 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-11 19:22:42,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:22:42,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:22:42,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-11 19:22:42,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:42,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1986 backedges. 89 proven. 19 refuted. 0 times theorem prover too weak. 1878 trivial. 0 not checked. [2024-09-11 19:22:42,757 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:22:43,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1986 backedges. 86 proven. 22 refuted. 0 times theorem prover too weak. 1878 trivial. 0 not checked. [2024-09-11 19:22:43,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269026804] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:22:43,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:22:43,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2024-09-11 19:22:43,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789410200] [2024-09-11 19:22:43,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:22:43,016 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-11 19:22:43,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:43,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-11 19:22:43,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-09-11 19:22:43,017 INFO L87 Difference]: Start difference. First operand 413 states and 659 transitions. Second operand has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 17 states have internal predecessors, (79), 9 states have call successors, (66), 3 states have call predecessors, (66), 1 states have return successors, (63), 9 states have call predecessors, (63), 9 states have call successors, (63) [2024-09-11 19:22:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:43,939 INFO L93 Difference]: Finished difference Result 466 states and 733 transitions. [2024-09-11 19:22:43,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-11 19:22:43,940 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 17 states have internal predecessors, (79), 9 states have call successors, (66), 3 states have call predecessors, (66), 1 states have return successors, (63), 9 states have call predecessors, (63), 9 states have call successors, (63) Word has length 190 [2024-09-11 19:22:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:43,942 INFO L225 Difference]: With dead ends: 466 [2024-09-11 19:22:43,942 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 19:22:43,944 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2024-09-11 19:22:43,945 INFO L434 NwaCegarLoop]: 80 mSDtfsCounter, 133 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:43,945 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 443 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-11 19:22:43,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 19:22:43,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 19:22:43,946 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-11 19:22:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 19:22:43,949 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 190 [2024-09-11 19:22:43,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:43,950 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 19:22:43,950 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 17 states have internal predecessors, (79), 9 states have call successors, (66), 3 states have call predecessors, (66), 1 states have return successors, (63), 9 states have call predecessors, (63), 9 states have call successors, (63) [2024-09-11 19:22:43,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:43,950 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 19:22:43,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 19:22:43,953 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 19:22:43,969 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-11 19:22:44,154 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:44,157 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, 1, 1] [2024-09-11 19:22:44,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.