./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/heapsort.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-12 21:29:49,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 21:29:49,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 21:29:49,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 21:29:49,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 21:29:49,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 21:29:49,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 21:29:49,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 21:29:49,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 21:29:49,248 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 21:29:49,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 21:29:49,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 21:29:49,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 21:29:49,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 21:29:49,252 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 21:29:49,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 21:29:49,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 21:29:49,253 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 21:29:49,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 21:29:49,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 21:29:49,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 21:29:49,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 21:29:49,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 21:29:49,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 21:29:49,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 21:29:49,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 21:29:49,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 21:29:49,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 21:29:49,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 21:29:49,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 21:29:49,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 21:29:49,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 21:29:49,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 21:29:49,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 21:29:49,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 21:29:49,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 21:29:49,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 21:29:49,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 21:29:49,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 21:29:49,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 21:29:49,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 21:29:49,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 21:29:49,260 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-12 21:29:49,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 21:29:49,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 21:29:49,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 21:29:49,534 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 21:29:49,535 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 21:29:49,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/heapsort.i [2024-09-12 21:29:50,951 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 21:29:51,163 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 21:29:51,163 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/heapsort.i [2024-09-12 21:29:51,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/4207b306c/4add3974e70d49bf8bd9e2b9166784eb/FLAG9b9744236 [2024-09-12 21:29:51,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/4207b306c/4add3974e70d49bf8bd9e2b9166784eb [2024-09-12 21:29:51,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 21:29:51,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 21:29:51,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 21:29:51,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 21:29:51,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 21:29:51,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 09:29:51" (1/1) ... [2024-09-12 21:29:51,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35256550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:29:51, skipping insertion in model container [2024-09-12 21:29:51,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 09:29:51" (1/1) ... [2024-09-12 21:29:51,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 21:29:51,390 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-12 21:29:51,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 21:29:51,423 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 21:29:51,439 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-12 21:29:51,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 21:29:51,479 INFO L204 MainTranslator]: Completed translation [2024-09-12 21:29:51,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:29:51 WrapperNode [2024-09-12 21:29:51,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 21:29:51,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 21:29:51,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 21:29:51,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 21:29:51,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:29:51" (1/1) ... [2024-09-12 21:29:51,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:29:51" (1/1) ... [2024-09-12 21:29:51,507 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 21:29:51,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 21:29:51,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 21:29:51,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 21:29:51,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 21:29:51,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:29:51" (1/1) ... [2024-09-12 21:29:51,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:29:51" (1/1) ... [2024-09-12 21:29:51,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:29:51" (1/1) ... [2024-09-12 21:29:51,529 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-12 21:29:51,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:29:51" (1/1) ... [2024-09-12 21:29:51,529 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:29:51" (1/1) ... [2024-09-12 21:29:51,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:29:51" (1/1) ... [2024-09-12 21:29:51,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:29:51" (1/1) ... [2024-09-12 21:29:51,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:29:51" (1/1) ... [2024-09-12 21:29:51,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:29:51" (1/1) ... [2024-09-12 21:29:51,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 21:29:51,540 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 21:29:51,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 21:29:51,540 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 21:29:51,541 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:29:51" (1/1) ... [2024-09-12 21:29:51,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 21:29:51,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:29:51,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 21:29:51,576 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 21:29:51,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 21:29:51,623 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 21:29:51,623 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 21:29:51,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 21:29:51,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 21:29:51,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 21:29:51,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 21:29:51,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 21:29:51,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 21:29:51,625 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 21:29:51,694 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 21:29:51,698 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 21:29:51,871 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-09-12 21:29:51,872 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 21:29:51,900 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 21:29:51,900 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-12 21:29:51,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:29:51 BoogieIcfgContainer [2024-09-12 21:29:51,901 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 21:29:51,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 21:29:51,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 21:29:51,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 21:29:51,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 09:29:51" (1/3) ... [2024-09-12 21:29:51,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e81199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 09:29:51, skipping insertion in model container [2024-09-12 21:29:51,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:29:51" (2/3) ... [2024-09-12 21:29:51,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e81199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 09:29:51, skipping insertion in model container [2024-09-12 21:29:51,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:29:51" (3/3) ... [2024-09-12 21:29:51,908 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort.i [2024-09-12 21:29:51,925 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 21:29:51,925 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 21:29:51,994 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 21:29:52,002 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;@39564c38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 21:29:52,003 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 21:29:52,007 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-12 21:29:52,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 21:29:52,017 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:29:52,018 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:52,019 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:29:52,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:52,025 INFO L85 PathProgramCache]: Analyzing trace with hash 855475308, now seen corresponding path program 1 times [2024-09-12 21:29:52,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:29:52,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352246599] [2024-09-12 21:29:52,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:52,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:29:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:52,371 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:29:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:29:52,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:29:52,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352246599] [2024-09-12 21:29:52,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352246599] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:29:52,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:29:52,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 21:29:52,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41435575] [2024-09-12 21:29:52,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:29:52,397 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:29:52,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:29:52,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:29:52,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 21:29:52,421 INFO L87 Difference]: Start difference. First operand has 43 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:52,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:29:52,742 INFO L93 Difference]: Finished difference Result 113 states and 211 transitions. [2024-09-12 21:29:52,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 21:29:52,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-12 21:29:52,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:29:52,753 INFO L225 Difference]: With dead ends: 113 [2024-09-12 21:29:52,753 INFO L226 Difference]: Without dead ends: 69 [2024-09-12 21:29:52,757 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 21:29:52,760 INFO L434 NwaCegarLoop]: 73 mSDtfsCounter, 34 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 21:29:52,761 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 293 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 21:29:52,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-12 21:29:52,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2024-09-12 21:29:52,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 26 states have call successors, (26), 4 states have call predecessors, (26), 3 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-09-12 21:29:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2024-09-12 21:29:52,810 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 14 [2024-09-12 21:29:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:29:52,810 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2024-09-12 21:29:52,810 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:52,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2024-09-12 21:29:52,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 21:29:52,813 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:29:52,813 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:52,813 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 21:29:52,814 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:29:52,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:52,814 INFO L85 PathProgramCache]: Analyzing trace with hash 843231207, now seen corresponding path program 1 times [2024-09-12 21:29:52,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:29:52,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462259038] [2024-09-12 21:29:52,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:52,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:29:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:52,983 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:29:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:52,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:29:52,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:29:52,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462259038] [2024-09-12 21:29:52,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462259038] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:29:52,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:29:52,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 21:29:52,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175717798] [2024-09-12 21:29:52,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:29:52,993 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:29:52,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:29:52,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:29:52,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 21:29:52,995 INFO L87 Difference]: Start difference. First operand 59 states and 91 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:53,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:29:53,218 INFO L93 Difference]: Finished difference Result 117 states and 183 transitions. [2024-09-12 21:29:53,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 21:29:53,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-12 21:29:53,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:29:53,222 INFO L225 Difference]: With dead ends: 117 [2024-09-12 21:29:53,224 INFO L226 Difference]: Without dead ends: 115 [2024-09-12 21:29:53,225 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 21:29:53,227 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 29 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 21:29:53,228 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 209 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 21:29:53,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-09-12 21:29:53,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2024-09-12 21:29:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 52 states have internal predecessors, (72), 48 states have call successors, (48), 6 states have call predecessors, (48), 5 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-09-12 21:29:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 167 transitions. [2024-09-12 21:29:53,274 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 167 transitions. Word has length 14 [2024-09-12 21:29:53,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:29:53,276 INFO L474 AbstractCegarLoop]: Abstraction has 106 states and 167 transitions. [2024-09-12 21:29:53,276 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:29:53,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:53,277 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 167 transitions. [2024-09-12 21:29:53,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 21:29:53,279 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:29:53,280 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:53,280 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 21:29:53,280 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:29:53,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:53,281 INFO L85 PathProgramCache]: Analyzing trace with hash 842919880, now seen corresponding path program 1 times [2024-09-12 21:29:53,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:29:53,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083876522] [2024-09-12 21:29:53,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:53,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:29:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:53,395 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:29:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:53,401 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 21:29:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:53,413 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-12 21:29:53,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:29:53,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083876522] [2024-09-12 21:29:53,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083876522] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:29:53,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:29:53,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 21:29:53,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917783587] [2024-09-12 21:29:53,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:29:53,416 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:29:53,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:29:53,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:29:53,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 21:29:53,417 INFO L87 Difference]: Start difference. First operand 106 states and 167 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 21:29:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:29:53,601 INFO L93 Difference]: Finished difference Result 161 states and 257 transitions. [2024-09-12 21:29:53,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 21:29:53,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-09-12 21:29:53,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:29:53,604 INFO L225 Difference]: With dead ends: 161 [2024-09-12 21:29:53,604 INFO L226 Difference]: Without dead ends: 159 [2024-09-12 21:29:53,605 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 21:29:53,606 INFO L434 NwaCegarLoop]: 54 mSDtfsCounter, 31 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:29:53,607 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 200 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:29:53,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-09-12 21:29:53,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 142. [2024-09-12 21:29:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 63 states have (on average 1.380952380952381) internal successors, (87), 67 states have internal predecessors, (87), 72 states have call successors, (72), 7 states have call predecessors, (72), 6 states have return successors, (71), 67 states have call predecessors, (71), 71 states have call successors, (71) [2024-09-12 21:29:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 230 transitions. [2024-09-12 21:29:53,644 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 230 transitions. Word has length 19 [2024-09-12 21:29:53,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:29:53,644 INFO L474 AbstractCegarLoop]: Abstraction has 142 states and 230 transitions. [2024-09-12 21:29:53,644 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 21:29:53,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 230 transitions. [2024-09-12 21:29:53,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 21:29:53,646 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:29:53,646 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:53,646 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 21:29:53,646 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:29:53,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:53,647 INFO L85 PathProgramCache]: Analyzing trace with hash 303375166, now seen corresponding path program 1 times [2024-09-12 21:29:53,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:29:53,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213215084] [2024-09-12 21:29:53,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:53,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:29:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:53,772 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:29:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:53,776 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 21:29:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:53,779 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-12 21:29:53,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:29:53,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213215084] [2024-09-12 21:29:53,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213215084] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:29:53,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:29:53,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 21:29:53,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562793821] [2024-09-12 21:29:53,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:29:53,781 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:29:53,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:29:53,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:29:53,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:29:53,782 INFO L87 Difference]: Start difference. First operand 142 states and 230 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 21:29:54,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:29:54,013 INFO L93 Difference]: Finished difference Result 208 states and 342 transitions. [2024-09-12 21:29:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 21:29:54,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-09-12 21:29:54,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:29:54,018 INFO L225 Difference]: With dead ends: 208 [2024-09-12 21:29:54,018 INFO L226 Difference]: Without dead ends: 206 [2024-09-12 21:29:54,018 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-12 21:29:54,020 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 43 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:29:54,020 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 221 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:29:54,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-09-12 21:29:54,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2024-09-12 21:29:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 94 states have internal predecessors, (122), 108 states have call successors, (108), 8 states have call predecessors, (108), 7 states have return successors, (107), 100 states have call predecessors, (107), 107 states have call successors, (107) [2024-09-12 21:29:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 337 transitions. [2024-09-12 21:29:54,107 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 337 transitions. Word has length 19 [2024-09-12 21:29:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:29:54,107 INFO L474 AbstractCegarLoop]: Abstraction has 203 states and 337 transitions. [2024-09-12 21:29:54,107 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 21:29:54,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:54,108 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 337 transitions. [2024-09-12 21:29:54,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 21:29:54,110 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:29:54,110 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:54,110 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 21:29:54,110 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:29:54,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:54,112 INFO L85 PathProgramCache]: Analyzing trace with hash -283430848, now seen corresponding path program 1 times [2024-09-12 21:29:54,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:29:54,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42554427] [2024-09-12 21:29:54,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:54,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:29:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:54,134 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:29:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:54,137 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 21:29:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:54,141 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-12 21:29:54,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:29:54,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42554427] [2024-09-12 21:29:54,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42554427] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:29:54,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:29:54,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 21:29:54,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120026216] [2024-09-12 21:29:54,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:29:54,145 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 21:29:54,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:29:54,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 21:29:54,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 21:29:54,146 INFO L87 Difference]: Start difference. First operand 203 states and 337 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 21:29:54,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:29:54,242 INFO L93 Difference]: Finished difference Result 387 states and 649 transitions. [2024-09-12 21:29:54,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 21:29:54,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-09-12 21:29:54,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:29:54,247 INFO L225 Difference]: With dead ends: 387 [2024-09-12 21:29:54,248 INFO L226 Difference]: Without dead ends: 305 [2024-09-12 21:29:54,249 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 21:29:54,252 INFO L434 NwaCegarLoop]: 81 mSDtfsCounter, 11 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:29:54,252 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 134 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:29:54,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-09-12 21:29:54,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 250. [2024-09-12 21:29:54,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 106 states have (on average 1.4150943396226414) internal successors, (150), 114 states have internal predecessors, (150), 136 states have call successors, (136), 8 states have call predecessors, (136), 7 states have return successors, (135), 127 states have call predecessors, (135), 135 states have call successors, (135) [2024-09-12 21:29:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 421 transitions. [2024-09-12 21:29:54,347 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 421 transitions. Word has length 19 [2024-09-12 21:29:54,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:29:54,347 INFO L474 AbstractCegarLoop]: Abstraction has 250 states and 421 transitions. [2024-09-12 21:29:54,347 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 21:29:54,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:54,348 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 421 transitions. [2024-09-12 21:29:54,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-12 21:29:54,351 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:29:54,351 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:54,352 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 21:29:54,352 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:29:54,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:54,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1858602097, now seen corresponding path program 1 times [2024-09-12 21:29:54,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:29:54,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234926800] [2024-09-12 21:29:54,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:54,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:29:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:54,443 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:29:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:54,446 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 21:29:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:54,450 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 21:29:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:54,456 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-12 21:29:54,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:29:54,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234926800] [2024-09-12 21:29:54,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234926800] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:29:54,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:29:54,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 21:29:54,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381300772] [2024-09-12 21:29:54,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:29:54,457 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:29:54,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:29:54,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:29:54,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 21:29:54,458 INFO L87 Difference]: Start difference. First operand 250 states and 421 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 21:29:54,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:29:54,644 INFO L93 Difference]: Finished difference Result 338 states and 568 transitions. [2024-09-12 21:29:54,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 21:29:54,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-09-12 21:29:54,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:29:54,648 INFO L225 Difference]: With dead ends: 338 [2024-09-12 21:29:54,649 INFO L226 Difference]: Without dead ends: 336 [2024-09-12 21:29:54,649 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 21:29:54,651 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 42 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:29:54,651 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 248 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:29:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-09-12 21:29:54,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 304. [2024-09-12 21:29:54,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 132 states have (on average 1.4242424242424243) internal successors, (188), 146 states have internal predecessors, (188), 162 states have call successors, (162), 10 states have call predecessors, (162), 9 states have return successors, (161), 147 states have call predecessors, (161), 161 states have call successors, (161) [2024-09-12 21:29:54,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 511 transitions. [2024-09-12 21:29:54,735 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 511 transitions. Word has length 26 [2024-09-12 21:29:54,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:29:54,735 INFO L474 AbstractCegarLoop]: Abstraction has 304 states and 511 transitions. [2024-09-12 21:29:54,735 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 21:29:54,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 511 transitions. [2024-09-12 21:29:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-12 21:29:54,737 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:29:54,737 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:54,737 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 21:29:54,737 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:29:54,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:54,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1261754835, now seen corresponding path program 1 times [2024-09-12 21:29:54,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:29:54,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63101599] [2024-09-12 21:29:54,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:54,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:29:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:54,820 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:29:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:54,822 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 21:29:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:54,829 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 21:29:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:54,834 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 21:29:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:54,841 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-12 21:29:54,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:29:54,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63101599] [2024-09-12 21:29:54,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63101599] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:29:54,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:29:54,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 21:29:54,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979524823] [2024-09-12 21:29:54,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:29:54,844 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:29:54,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:29:54,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:29:54,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 21:29:54,845 INFO L87 Difference]: Start difference. First operand 304 states and 511 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 21:29:55,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:29:55,074 INFO L93 Difference]: Finished difference Result 370 states and 611 transitions. [2024-09-12 21:29:55,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 21:29:55,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-09-12 21:29:55,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:29:55,079 INFO L225 Difference]: With dead ends: 370 [2024-09-12 21:29:55,080 INFO L226 Difference]: Without dead ends: 368 [2024-09-12 21:29:55,081 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 21:29:55,082 INFO L434 NwaCegarLoop]: 69 mSDtfsCounter, 25 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:29:55,084 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 251 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:29:55,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-09-12 21:29:55,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 344. [2024-09-12 21:29:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 146 states have (on average 1.4109589041095891) internal successors, (206), 164 states have internal predecessors, (206), 186 states have call successors, (186), 12 states have call predecessors, (186), 11 states have return successors, (185), 167 states have call predecessors, (185), 185 states have call successors, (185) [2024-09-12 21:29:55,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 577 transitions. [2024-09-12 21:29:55,189 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 577 transitions. Word has length 29 [2024-09-12 21:29:55,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:29:55,189 INFO L474 AbstractCegarLoop]: Abstraction has 344 states and 577 transitions. [2024-09-12 21:29:55,190 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 21:29:55,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:55,190 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 577 transitions. [2024-09-12 21:29:55,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-12 21:29:55,191 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:29:55,191 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:55,191 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 21:29:55,192 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:29:55,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:55,192 INFO L85 PathProgramCache]: Analyzing trace with hash 887335745, now seen corresponding path program 1 times [2024-09-12 21:29:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:29:55,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801114580] [2024-09-12 21:29:55,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:55,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:29:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:55,241 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:29:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:55,243 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 21:29:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:55,245 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 21:29:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:55,247 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-12 21:29:55,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:29:55,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801114580] [2024-09-12 21:29:55,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801114580] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:29:55,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:29:55,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 21:29:55,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281044876] [2024-09-12 21:29:55,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:29:55,249 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 21:29:55,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:29:55,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 21:29:55,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 21:29:55,249 INFO L87 Difference]: Start difference. First operand 344 states and 577 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 21:29:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:29:55,578 INFO L93 Difference]: Finished difference Result 795 states and 1334 transitions. [2024-09-12 21:29:55,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 21:29:55,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-09-12 21:29:55,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:29:55,588 INFO L225 Difference]: With dead ends: 795 [2024-09-12 21:29:55,588 INFO L226 Difference]: Without dead ends: 540 [2024-09-12 21:29:55,590 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:29:55,591 INFO L434 NwaCegarLoop]: 65 mSDtfsCounter, 53 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 21:29:55,591 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 183 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 21:29:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-09-12 21:29:55,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 345. [2024-09-12 21:29:55,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 147 states have (on average 1.401360544217687) internal successors, (206), 165 states have internal predecessors, (206), 186 states have call successors, (186), 12 states have call predecessors, (186), 11 states have return successors, (185), 167 states have call predecessors, (185), 185 states have call successors, (185) [2024-09-12 21:29:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 577 transitions. [2024-09-12 21:29:55,690 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 577 transitions. Word has length 28 [2024-09-12 21:29:55,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:29:55,690 INFO L474 AbstractCegarLoop]: Abstraction has 345 states and 577 transitions. [2024-09-12 21:29:55,691 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 21:29:55,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:55,691 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 577 transitions. [2024-09-12 21:29:55,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-12 21:29:55,692 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:29:55,693 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:55,693 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 21:29:55,693 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:29:55,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:55,694 INFO L85 PathProgramCache]: Analyzing trace with hash 969267811, now seen corresponding path program 1 times [2024-09-12 21:29:55,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:29:55,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636928229] [2024-09-12 21:29:55,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:55,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:29:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:55,777 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:29:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:55,780 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 21:29:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:55,783 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 21:29:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:55,786 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 21:29:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:55,789 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-12 21:29:55,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:29:55,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636928229] [2024-09-12 21:29:55,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636928229] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:29:55,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:29:55,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 21:29:55,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976664675] [2024-09-12 21:29:55,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:29:55,791 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:29:55,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:29:55,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:29:55,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:29:55,792 INFO L87 Difference]: Start difference. First operand 345 states and 577 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 21:29:56,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:29:56,148 INFO L93 Difference]: Finished difference Result 542 states and 924 transitions. [2024-09-12 21:29:56,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 21:29:56,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2024-09-12 21:29:56,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:29:56,153 INFO L225 Difference]: With dead ends: 542 [2024-09-12 21:29:56,154 INFO L226 Difference]: Without dead ends: 540 [2024-09-12 21:29:56,154 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-12 21:29:56,154 INFO L434 NwaCegarLoop]: 64 mSDtfsCounter, 52 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 21:29:56,155 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 271 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 21:29:56,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-09-12 21:29:56,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 492. [2024-09-12 21:29:56,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 202 states have (on average 1.4306930693069306) internal successors, (289), 232 states have internal predecessors, (289), 277 states have call successors, (277), 13 states have call predecessors, (277), 12 states have return successors, (276), 246 states have call predecessors, (276), 276 states have call successors, (276) [2024-09-12 21:29:56,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 842 transitions. [2024-09-12 21:29:56,267 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 842 transitions. Word has length 31 [2024-09-12 21:29:56,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:29:56,268 INFO L474 AbstractCegarLoop]: Abstraction has 492 states and 842 transitions. [2024-09-12 21:29:56,268 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 21:29:56,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:56,268 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 842 transitions. [2024-09-12 21:29:56,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-12 21:29:56,269 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:29:56,269 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:56,270 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-12 21:29:56,270 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:29:56,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:56,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1109816421, now seen corresponding path program 1 times [2024-09-12 21:29:56,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:29:56,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861596965] [2024-09-12 21:29:56,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:56,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:29:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:56,371 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:29:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:56,374 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 21:29:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:56,377 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 21:29:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:56,382 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 21:29:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:56,387 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-12 21:29:56,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:29:56,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861596965] [2024-09-12 21:29:56,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861596965] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:29:56,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:29:56,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 21:29:56,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482759391] [2024-09-12 21:29:56,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:29:56,391 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:29:56,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:29:56,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:29:56,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:29:56,392 INFO L87 Difference]: Start difference. First operand 492 states and 842 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 21:29:56,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:29:56,660 INFO L93 Difference]: Finished difference Result 562 states and 954 transitions. [2024-09-12 21:29:56,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 21:29:56,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2024-09-12 21:29:56,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:29:56,668 INFO L225 Difference]: With dead ends: 562 [2024-09-12 21:29:56,668 INFO L226 Difference]: Without dead ends: 560 [2024-09-12 21:29:56,669 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-09-12 21:29:56,669 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 75 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:29:56,670 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 208 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:29:56,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-09-12 21:29:56,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 499. [2024-09-12 21:29:56,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 205 states have (on average 1.424390243902439) internal successors, (292), 235 states have internal predecessors, (292), 280 states have call successors, (280), 14 states have call predecessors, (280), 13 states have return successors, (279), 249 states have call predecessors, (279), 279 states have call successors, (279) [2024-09-12 21:29:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 851 transitions. [2024-09-12 21:29:56,796 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 851 transitions. Word has length 31 [2024-09-12 21:29:56,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:29:56,797 INFO L474 AbstractCegarLoop]: Abstraction has 499 states and 851 transitions. [2024-09-12 21:29:56,797 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 21:29:56,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:56,798 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 851 transitions. [2024-09-12 21:29:56,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-12 21:29:56,799 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:29:56,799 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:56,799 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-12 21:29:56,799 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:29:56,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:56,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1192529802, now seen corresponding path program 1 times [2024-09-12 21:29:56,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:29:56,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134628149] [2024-09-12 21:29:56,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:56,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:29:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:56,894 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:29:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:56,896 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 21:29:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:56,899 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 21:29:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:56,902 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 21:29:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:56,904 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-12 21:29:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:56,907 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-12 21:29:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:56,910 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-12 21:29:56,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:29:56,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134628149] [2024-09-12 21:29:56,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134628149] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:29:56,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:29:56,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 21:29:56,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215966837] [2024-09-12 21:29:56,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:29:56,911 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:29:56,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:29:56,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:29:56,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:29:56,912 INFO L87 Difference]: Start difference. First operand 499 states and 851 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-12 21:29:57,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:29:57,215 INFO L93 Difference]: Finished difference Result 557 states and 928 transitions. [2024-09-12 21:29:57,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 21:29:57,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2024-09-12 21:29:57,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:29:57,220 INFO L225 Difference]: With dead ends: 557 [2024-09-12 21:29:57,220 INFO L226 Difference]: Without dead ends: 555 [2024-09-12 21:29:57,221 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-09-12 21:29:57,221 INFO L434 NwaCegarLoop]: 70 mSDtfsCounter, 35 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:29:57,221 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 259 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:29:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-09-12 21:29:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 503. [2024-09-12 21:29:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 208 states have (on average 1.4182692307692308) internal successors, (295), 238 states have internal predecessors, (295), 280 states have call successors, (280), 15 states have call predecessors, (280), 14 states have return successors, (279), 249 states have call predecessors, (279), 279 states have call successors, (279) [2024-09-12 21:29:57,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 854 transitions. [2024-09-12 21:29:57,341 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 854 transitions. Word has length 41 [2024-09-12 21:29:57,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:29:57,342 INFO L474 AbstractCegarLoop]: Abstraction has 503 states and 854 transitions. [2024-09-12 21:29:57,342 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-12 21:29:57,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:57,343 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 854 transitions. [2024-09-12 21:29:57,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-12 21:29:57,344 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:29:57,344 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:57,344 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-12 21:29:57,344 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:29:57,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:57,345 INFO L85 PathProgramCache]: Analyzing trace with hash 2122421222, now seen corresponding path program 1 times [2024-09-12 21:29:57,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:29:57,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320511418] [2024-09-12 21:29:57,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:57,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:29:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:57,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:29:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:57,415 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 21:29:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:57,421 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 21:29:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:57,422 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-12 21:29:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:57,428 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-12 21:29:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:57,431 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-12 21:29:57,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:29:57,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320511418] [2024-09-12 21:29:57,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320511418] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:29:57,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:29:57,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 21:29:57,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329880683] [2024-09-12 21:29:57,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:29:57,435 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:29:57,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:29:57,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:29:57,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:29:57,435 INFO L87 Difference]: Start difference. First operand 503 states and 854 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 21:29:57,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:29:57,743 INFO L93 Difference]: Finished difference Result 534 states and 893 transitions. [2024-09-12 21:29:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 21:29:57,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2024-09-12 21:29:57,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:29:57,749 INFO L225 Difference]: With dead ends: 534 [2024-09-12 21:29:57,750 INFO L226 Difference]: Without dead ends: 532 [2024-09-12 21:29:57,750 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-09-12 21:29:57,751 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 28 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:29:57,751 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 188 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:29:57,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-09-12 21:29:57,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 511. [2024-09-12 21:29:57,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 214 states have (on average 1.4065420560747663) internal successors, (301), 244 states have internal predecessors, (301), 280 states have call successors, (280), 17 states have call predecessors, (280), 16 states have return successors, (279), 249 states have call predecessors, (279), 279 states have call successors, (279) [2024-09-12 21:29:57,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 860 transitions. [2024-09-12 21:29:57,879 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 860 transitions. Word has length 41 [2024-09-12 21:29:57,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:29:57,880 INFO L474 AbstractCegarLoop]: Abstraction has 511 states and 860 transitions. [2024-09-12 21:29:57,880 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 21:29:57,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:57,881 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 860 transitions. [2024-09-12 21:29:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-09-12 21:29:57,883 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:29:57,883 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:57,883 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-12 21:29:57,884 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:29:57,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:57,884 INFO L85 PathProgramCache]: Analyzing trace with hash 290316784, now seen corresponding path program 1 times [2024-09-12 21:29:57,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:29:57,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983562564] [2024-09-12 21:29:57,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:57,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:29:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:57,959 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:29:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:57,961 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 21:29:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:57,963 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 21:29:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:57,965 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-12 21:29:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:57,967 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-12 21:29:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:57,970 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-12 21:29:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:57,973 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-12 21:29:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:57,975 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-12 21:29:57,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:29:57,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983562564] [2024-09-12 21:29:57,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983562564] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:29:57,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:29:57,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 21:29:57,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692131412] [2024-09-12 21:29:57,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:29:57,977 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:29:57,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:29:57,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:29:57,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:29:57,978 INFO L87 Difference]: Start difference. First operand 511 states and 860 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-12 21:29:58,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:29:58,206 INFO L93 Difference]: Finished difference Result 578 states and 966 transitions. [2024-09-12 21:29:58,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 21:29:58,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2024-09-12 21:29:58,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:29:58,211 INFO L225 Difference]: With dead ends: 578 [2024-09-12 21:29:58,212 INFO L226 Difference]: Without dead ends: 576 [2024-09-12 21:29:58,212 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-09-12 21:29:58,213 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 41 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:29:58,213 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 234 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:29:58,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-09-12 21:29:58,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 515. [2024-09-12 21:29:58,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 217 states have (on average 1.400921658986175) internal successors, (304), 247 states have internal predecessors, (304), 280 states have call successors, (280), 18 states have call predecessors, (280), 17 states have return successors, (279), 249 states have call predecessors, (279), 279 states have call successors, (279) [2024-09-12 21:29:58,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 863 transitions. [2024-09-12 21:29:58,346 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 863 transitions. Word has length 53 [2024-09-12 21:29:58,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:29:58,346 INFO L474 AbstractCegarLoop]: Abstraction has 515 states and 863 transitions. [2024-09-12 21:29:58,346 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-12 21:29:58,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:58,347 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 863 transitions. [2024-09-12 21:29:58,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-12 21:29:58,349 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:29:58,349 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:58,349 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-12 21:29:58,349 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:29:58,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:58,350 INFO L85 PathProgramCache]: Analyzing trace with hash 822747500, now seen corresponding path program 1 times [2024-09-12 21:29:58,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:29:58,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118499317] [2024-09-12 21:29:58,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:58,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:29:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:58,393 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:29:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:58,396 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 21:29:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:58,400 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 21:29:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:58,404 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 21:29:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:58,408 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-12 21:29:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:58,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-12 21:29:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:58,415 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-12 21:29:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:58,418 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-12 21:29:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:58,420 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-12 21:29:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-09-12 21:29:58,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:29:58,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118499317] [2024-09-12 21:29:58,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118499317] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:29:58,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465189295] [2024-09-12 21:29:58,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:58,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:29:58,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:29:58,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:29:58,426 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 21:29:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:58,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 21:29:58,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:29:58,641 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-12 21:29:58,641 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 21:29:58,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465189295] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:29:58,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 21:29:58,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-09-12 21:29:58,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308597860] [2024-09-12 21:29:58,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:29:58,642 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:29:58,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:29:58,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:29:58,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-12 21:29:58,643 INFO L87 Difference]: Start difference. First operand 515 states and 863 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-12 21:29:58,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:29:58,984 INFO L93 Difference]: Finished difference Result 932 states and 1539 transitions. [2024-09-12 21:29:58,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 21:29:58,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 61 [2024-09-12 21:29:58,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:29:58,989 INFO L225 Difference]: With dead ends: 932 [2024-09-12 21:29:58,990 INFO L226 Difference]: Without dead ends: 476 [2024-09-12 21:29:58,993 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-09-12 21:29:58,994 INFO L434 NwaCegarLoop]: 48 mSDtfsCounter, 34 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:29:58,994 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 216 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:29:58,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-09-12 21:29:59,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 446. [2024-09-12 21:29:59,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 196 states have (on average 1.3673469387755102) internal successors, (268), 220 states have internal predecessors, (268), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 207 states have call predecessors, (231), 231 states have call successors, (231) [2024-09-12 21:29:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 731 transitions. [2024-09-12 21:29:59,116 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 731 transitions. Word has length 61 [2024-09-12 21:29:59,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:29:59,116 INFO L474 AbstractCegarLoop]: Abstraction has 446 states and 731 transitions. [2024-09-12 21:29:59,116 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-12 21:29:59,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:59,117 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 731 transitions. [2024-09-12 21:29:59,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-09-12 21:29:59,118 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:29:59,119 INFO L216 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:29:59,137 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 21:29:59,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,SelfDestructingSolverStorable13 [2024-09-12 21:29:59,323 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:29:59,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:29:59,323 INFO L85 PathProgramCache]: Analyzing trace with hash 968879790, now seen corresponding path program 1 times [2024-09-12 21:29:59,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:29:59,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150255389] [2024-09-12 21:29:59,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:59,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:29:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:59,439 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:29:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:59,442 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 21:29:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:59,447 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 21:29:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:59,450 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 21:29:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:59,453 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-12 21:29:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:59,455 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-12 21:29:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:59,460 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-12 21:29:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:59,464 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-09-12 21:29:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:59,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-12 21:29:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:59,470 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-12 21:29:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:59,475 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-12 21:29:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:59,477 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-12 21:29:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:59,479 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-09-12 21:29:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:59,482 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-12 21:29:59,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:29:59,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150255389] [2024-09-12 21:29:59,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150255389] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:29:59,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846369384] [2024-09-12 21:29:59,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:29:59,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:29:59,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:29:59,484 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:29:59,486 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 21:29:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:29:59,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 21:29:59,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:29:59,759 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-12 21:29:59,759 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 21:29:59,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846369384] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:29:59,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 21:29:59,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2024-09-12 21:29:59,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778330759] [2024-09-12 21:29:59,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:29:59,761 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:29:59,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:29:59,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:29:59,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-09-12 21:29:59,762 INFO L87 Difference]: Start difference. First operand 446 states and 731 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-09-12 21:30:00,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:30:00,215 INFO L93 Difference]: Finished difference Result 813 states and 1310 transitions. [2024-09-12 21:30:00,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 21:30:00,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 83 [2024-09-12 21:30:00,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:30:00,220 INFO L225 Difference]: With dead ends: 813 [2024-09-12 21:30:00,220 INFO L226 Difference]: Without dead ends: 375 [2024-09-12 21:30:00,223 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-09-12 21:30:00,224 INFO L434 NwaCegarLoop]: 63 mSDtfsCounter, 44 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 21:30:00,224 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 212 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 21:30:00,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-09-12 21:30:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 340. [2024-09-12 21:30:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 155 states have (on average 1.3290322580645162) internal successors, (206), 171 states have internal predecessors, (206), 168 states have call successors, (168), 17 states have call predecessors, (168), 16 states have return successors, (167), 151 states have call predecessors, (167), 167 states have call successors, (167) [2024-09-12 21:30:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 541 transitions. [2024-09-12 21:30:00,321 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 541 transitions. Word has length 83 [2024-09-12 21:30:00,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:30:00,322 INFO L474 AbstractCegarLoop]: Abstraction has 340 states and 541 transitions. [2024-09-12 21:30:00,322 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-09-12 21:30:00,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:30:00,323 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 541 transitions. [2024-09-12 21:30:00,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-09-12 21:30:00,324 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:30:00,324 INFO L216 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:30:00,341 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 21:30:00,524 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-12 21:30:00,525 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:30:00,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:30:00,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1787747476, now seen corresponding path program 1 times [2024-09-12 21:30:00,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:30:00,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229913554] [2024-09-12 21:30:00,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:30:00,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:30:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:00,644 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:30:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:00,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 21:30:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:00,648 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 21:30:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:00,650 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 21:30:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:00,651 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-12 21:30:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:00,653 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-12 21:30:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:00,655 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-12 21:30:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:00,657 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-09-12 21:30:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:00,659 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-12 21:30:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:00,661 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-12 21:30:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:00,663 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-12 21:30:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:00,665 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-12 21:30:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:00,667 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-09-12 21:30:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:00,668 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-12 21:30:00,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:30:00,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229913554] [2024-09-12 21:30:00,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229913554] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:30:00,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865404685] [2024-09-12 21:30:00,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:30:00,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:30:00,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:30:00,671 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:30:00,672 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 21:30:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:00,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-12 21:30:00,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:30:00,918 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-12 21:30:00,918 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 21:30:00,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865404685] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:30:00,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 21:30:00,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-09-12 21:30:00,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013494905] [2024-09-12 21:30:00,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:30:00,919 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 21:30:00,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:30:00,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 21:30:00,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-09-12 21:30:00,920 INFO L87 Difference]: Start difference. First operand 340 states and 541 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-12 21:30:01,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:30:01,149 INFO L93 Difference]: Finished difference Result 639 states and 1012 transitions. [2024-09-12 21:30:01,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 21:30:01,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 83 [2024-09-12 21:30:01,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:30:01,153 INFO L225 Difference]: With dead ends: 639 [2024-09-12 21:30:01,153 INFO L226 Difference]: Without dead ends: 293 [2024-09-12 21:30:01,155 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-09-12 21:30:01,156 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 21 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:30:01,156 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 183 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:30:01,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-09-12 21:30:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 283. [2024-09-12 21:30:01,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 144 states have internal predecessors, (170), 136 states have call successors, (136), 17 states have call predecessors, (136), 16 states have return successors, (135), 121 states have call predecessors, (135), 135 states have call successors, (135) [2024-09-12 21:30:01,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 441 transitions. [2024-09-12 21:30:01,219 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 441 transitions. Word has length 83 [2024-09-12 21:30:01,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:30:01,219 INFO L474 AbstractCegarLoop]: Abstraction has 283 states and 441 transitions. [2024-09-12 21:30:01,220 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-12 21:30:01,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:30:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 441 transitions. [2024-09-12 21:30:01,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-09-12 21:30:01,224 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:30:01,224 INFO L216 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:30:01,241 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 21:30:01,424 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-12 21:30:01,424 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:30:01,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:30:01,425 INFO L85 PathProgramCache]: Analyzing trace with hash -680780915, now seen corresponding path program 1 times [2024-09-12 21:30:01,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:30:01,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746051507] [2024-09-12 21:30:01,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:30:01,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:30:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:01,494 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:30:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:01,496 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 21:30:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:01,498 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 21:30:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:01,501 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-12 21:30:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:01,503 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-12 21:30:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:01,505 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-12 21:30:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:01,508 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-12 21:30:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:01,514 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-12 21:30:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:01,516 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-12 21:30:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:01,520 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-12 21:30:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:01,523 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-12 21:30:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:01,525 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-09-12 21:30:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:01,526 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-09-12 21:30:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2024-09-12 21:30:01,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:30:01,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746051507] [2024-09-12 21:30:01,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746051507] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:30:01,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042802290] [2024-09-12 21:30:01,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:30:01,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:30:01,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:30:01,532 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:30:01,535 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 21:30:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:01,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 21:30:01,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:30:01,654 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-12 21:30:01,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:30:01,775 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-12 21:30:01,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042802290] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:30:01,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:30:01,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2024-09-12 21:30:01,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437729546] [2024-09-12 21:30:01,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:30:01,777 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-12 21:30:01,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:30:01,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-12 21:30:01,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-09-12 21:30:01,778 INFO L87 Difference]: Start difference. First operand 283 states and 441 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (31), 6 states have call predecessors, (31), 6 states have call successors, (31) [2024-09-12 21:30:02,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:30:02,773 INFO L93 Difference]: Finished difference Result 571 states and 876 transitions. [2024-09-12 21:30:02,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-12 21:30:02,773 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (31), 6 states have call predecessors, (31), 6 states have call successors, (31) Word has length 88 [2024-09-12 21:30:02,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:30:02,776 INFO L225 Difference]: With dead ends: 571 [2024-09-12 21:30:02,777 INFO L226 Difference]: Without dead ends: 343 [2024-09-12 21:30:02,778 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=402, Invalid=1080, Unknown=0, NotChecked=0, Total=1482 [2024-09-12 21:30:02,778 INFO L434 NwaCegarLoop]: 158 mSDtfsCounter, 205 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-12 21:30:02,779 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 731 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-12 21:30:02,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-09-12 21:30:02,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 237. [2024-09-12 21:30:02,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 118 states have (on average 1.2372881355932204) internal successors, (146), 127 states have internal predecessors, (146), 102 states have call successors, (102), 17 states have call predecessors, (102), 16 states have return successors, (101), 92 states have call predecessors, (101), 101 states have call successors, (101) [2024-09-12 21:30:02,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 349 transitions. [2024-09-12 21:30:02,839 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 349 transitions. Word has length 88 [2024-09-12 21:30:02,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:30:02,839 INFO L474 AbstractCegarLoop]: Abstraction has 237 states and 349 transitions. [2024-09-12 21:30:02,839 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (31), 6 states have call predecessors, (31), 6 states have call successors, (31) [2024-09-12 21:30:02,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:30:02,840 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 349 transitions. [2024-09-12 21:30:02,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-09-12 21:30:02,841 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:30:02,841 INFO L216 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:30:02,856 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 21:30:03,045 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:30:03,046 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:30:03,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:30:03,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1903110671, now seen corresponding path program 1 times [2024-09-12 21:30:03,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:30:03,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433817854] [2024-09-12 21:30:03,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:30:03,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:30:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:03,166 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:30:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:03,168 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 21:30:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:03,172 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 21:30:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:03,174 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-12 21:30:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:03,176 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-12 21:30:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:03,179 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-12 21:30:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:03,181 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-12 21:30:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:03,187 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-12 21:30:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:03,190 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 21:30:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:03,193 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-12 21:30:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:03,196 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-12 21:30:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:03,200 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-12 21:30:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:03,204 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-12 21:30:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:03,207 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-12 21:30:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:03,210 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-12 21:30:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:03,214 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-09-12 21:30:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:03,216 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-09-12 21:30:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:03,219 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-12 21:30:03,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:30:03,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433817854] [2024-09-12 21:30:03,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433817854] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:30:03,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115367990] [2024-09-12 21:30:03,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:30:03,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:30:03,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:30:03,222 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:30:03,224 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 21:30:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:03,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-12 21:30:03,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:30:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 153 proven. 7 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-09-12 21:30:03,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:30:03,706 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-12 21:30:03,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115367990] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:30:03,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:30:03,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-09-12 21:30:03,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752542641] [2024-09-12 21:30:03,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:30:03,708 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-12 21:30:03,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:30:03,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-12 21:30:03,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2024-09-12 21:30:03,709 INFO L87 Difference]: Start difference. First operand 237 states and 349 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 13 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (45), 13 states have call predecessors, (45), 13 states have call successors, (45) [2024-09-12 21:30:05,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:30:05,815 INFO L93 Difference]: Finished difference Result 800 states and 1252 transitions. [2024-09-12 21:30:05,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-09-12 21:30:05,815 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 13 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (45), 13 states have call predecessors, (45), 13 states have call successors, (45) Word has length 110 [2024-09-12 21:30:05,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:30:05,819 INFO L225 Difference]: With dead ends: 800 [2024-09-12 21:30:05,819 INFO L226 Difference]: Without dead ends: 469 [2024-09-12 21:30:05,822 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=943, Invalid=2839, Unknown=0, NotChecked=0, Total=3782 [2024-09-12 21:30:05,824 INFO L434 NwaCegarLoop]: 156 mSDtfsCounter, 371 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 484 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:30:05,824 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1097 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [484 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-09-12 21:30:05,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-09-12 21:30:05,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 372. [2024-09-12 21:30:05,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 173 states have (on average 1.2658959537572254) internal successors, (219), 187 states have internal predecessors, (219), 182 states have call successors, (182), 17 states have call predecessors, (182), 16 states have return successors, (181), 167 states have call predecessors, (181), 181 states have call successors, (181) [2024-09-12 21:30:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 582 transitions. [2024-09-12 21:30:05,952 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 582 transitions. Word has length 110 [2024-09-12 21:30:05,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:30:05,953 INFO L474 AbstractCegarLoop]: Abstraction has 372 states and 582 transitions. [2024-09-12 21:30:05,953 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 13 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (45), 13 states have call predecessors, (45), 13 states have call successors, (45) [2024-09-12 21:30:05,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:30:05,954 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 582 transitions. [2024-09-12 21:30:05,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-09-12 21:30:05,955 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:30:05,955 INFO L216 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:30:05,972 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-12 21:30:06,155 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-09-12 21:30:06,156 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:30:06,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:30:06,156 INFO L85 PathProgramCache]: Analyzing trace with hash -853516595, now seen corresponding path program 1 times [2024-09-12 21:30:06,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:30:06,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968449520] [2024-09-12 21:30:06,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:30:06,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:30:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:06,277 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:30:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:06,279 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 21:30:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:06,281 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 21:30:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:06,283 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-12 21:30:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:06,285 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-12 21:30:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:06,287 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-12 21:30:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:06,288 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-12 21:30:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:06,291 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-12 21:30:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:06,293 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 21:30:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:06,295 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-12 21:30:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:06,297 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-12 21:30:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:06,298 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-12 21:30:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:06,300 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-12 21:30:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:06,302 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-12 21:30:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:06,304 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-12 21:30:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:06,306 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-09-12 21:30:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:06,308 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-09-12 21:30:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-12 21:30:06,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:30:06,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968449520] [2024-09-12 21:30:06,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968449520] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:30:06,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436674198] [2024-09-12 21:30:06,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:30:06,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:30:06,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:30:06,314 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:30:06,315 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-12 21:30:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:06,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 21:30:06,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:30:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-12 21:30:06,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:30:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-12 21:30:06,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436674198] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:30:06,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:30:06,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-09-12 21:30:06,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466793387] [2024-09-12 21:30:06,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:30:06,567 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 21:30:06,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:30:06,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 21:30:06,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-09-12 21:30:06,568 INFO L87 Difference]: Start difference. First operand 372 states and 582 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (33), 3 states have call predecessors, (33), 1 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) [2024-09-12 21:30:07,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:30:07,050 INFO L93 Difference]: Finished difference Result 434 states and 675 transitions. [2024-09-12 21:30:07,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 21:30:07,050 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (33), 3 states have call predecessors, (33), 1 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) Word has length 110 [2024-09-12 21:30:07,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:30:07,059 INFO L225 Difference]: With dead ends: 434 [2024-09-12 21:30:07,059 INFO L226 Difference]: Without dead ends: 432 [2024-09-12 21:30:07,059 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 248 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-09-12 21:30:07,060 INFO L434 NwaCegarLoop]: 72 mSDtfsCounter, 58 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 21:30:07,060 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 394 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 21:30:07,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-09-12 21:30:07,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 376. [2024-09-12 21:30:07,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 176 states have (on average 1.2613636363636365) internal successors, (222), 190 states have internal predecessors, (222), 182 states have call successors, (182), 18 states have call predecessors, (182), 17 states have return successors, (181), 167 states have call predecessors, (181), 181 states have call successors, (181) [2024-09-12 21:30:07,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 585 transitions. [2024-09-12 21:30:07,205 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 585 transitions. Word has length 110 [2024-09-12 21:30:07,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:30:07,206 INFO L474 AbstractCegarLoop]: Abstraction has 376 states and 585 transitions. [2024-09-12 21:30:07,206 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (33), 3 states have call predecessors, (33), 1 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) [2024-09-12 21:30:07,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:30:07,206 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 585 transitions. [2024-09-12 21:30:07,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-09-12 21:30:07,208 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:30:07,208 INFO L216 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:30:07,224 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-12 21:30:07,408 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:30:07,408 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:30:07,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:30:07,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1133746567, now seen corresponding path program 2 times [2024-09-12 21:30:07,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:30:07,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650980856] [2024-09-12 21:30:07,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:30:07,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:30:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:07,508 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:30:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:07,510 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 21:30:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:07,512 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 21:30:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:07,513 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-12 21:30:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:07,515 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-12 21:30:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:07,517 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-12 21:30:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:07,518 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-12 21:30:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:07,520 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-12 21:30:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:07,521 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-12 21:30:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:07,523 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-12 21:30:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:07,525 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-12 21:30:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:07,526 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-12 21:30:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:07,528 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-12 21:30:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:07,530 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-12 21:30:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:07,532 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-12 21:30:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:07,534 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-09-12 21:30:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:07,535 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-09-12 21:30:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:07,537 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-09-12 21:30:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:30:07,539 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 18 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-09-12 21:30:07,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:30:07,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650980856] [2024-09-12 21:30:07,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650980856] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:30:07,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78498725] [2024-09-12 21:30:07,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 21:30:07,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:30:07,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:30:07,541 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:30:07,543 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-12 21:30:07,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 21:30:07,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:30:07,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-12 21:30:07,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:30:07,811 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-12 21:30:07,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:30:08,016 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-12 21:30:08,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78498725] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:30:08,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:30:08,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 19 [2024-09-12 21:30:08,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754768729] [2024-09-12 21:30:08,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:30:08,018 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-12 21:30:08,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:30:08,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-12 21:30:08,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-09-12 21:30:08,019 INFO L87 Difference]: Start difference. First operand 376 states and 585 transitions. Second operand has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 17 states have internal predecessors, (69), 10 states have call successors, (56), 3 states have call predecessors, (56), 1 states have return successors, (52), 10 states have call predecessors, (52), 10 states have call successors, (52) [2024-09-12 21:30:09,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:30:09,308 INFO L93 Difference]: Finished difference Result 698 states and 1108 transitions. [2024-09-12 21:30:09,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-12 21:30:09,309 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 17 states have internal predecessors, (69), 10 states have call successors, (56), 3 states have call predecessors, (56), 1 states have return successors, (52), 10 states have call predecessors, (52), 10 states have call successors, (52) Word has length 115 [2024-09-12 21:30:09,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:30:09,311 INFO L225 Difference]: With dead ends: 698 [2024-09-12 21:30:09,312 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 21:30:09,314 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2024-09-12 21:30:09,315 INFO L434 NwaCegarLoop]: 78 mSDtfsCounter, 281 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-12 21:30:09,315 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 586 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-12 21:30:09,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 21:30:09,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 21:30:09,316 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-12 21:30:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 21:30:09,317 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2024-09-12 21:30:09,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:30:09,317 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 21:30:09,317 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 17 states have internal predecessors, (69), 10 states have call successors, (56), 3 states have call predecessors, (56), 1 states have return successors, (52), 10 states have call predecessors, (52), 10 states have call successors, (52) [2024-09-12 21:30:09,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:30:09,317 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 21:30:09,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 21:30:09,320 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 21:30:09,337 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-12 21:30:09,520 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:30:09,524 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:30:09,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. Killed by 15