./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:33:25,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:33:25,372 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:33:25,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:33:25,377 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:33:25,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:33:25,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:33:25,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:33:25,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:33:25,405 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:33:25,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:33:25,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:33:25,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:33:25,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:33:25,407 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:33:25,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:33:25,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:33:25,408 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:33:25,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:33:25,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:33:25,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:33:25,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:33:25,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:33:25,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:33:25,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:33:25,416 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:33:25,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:33:25,416 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:33:25,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:33:25,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:33:25,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:33:25,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:33:25,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:33:25,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:33:25,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:33:25,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:33:25,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:33:25,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:33:25,423 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:33:25,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:33:25,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:33:25,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:33:25,424 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/ultimate/releaseScripts/default/UAutomizer-linux/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/ultimate/releaseScripts/default/UAutomizer-linux 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 [2024-10-12 18:33:25,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:33:25,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:33:25,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:33:25,683 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:33:25,684 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:33:25,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2024-10-12 18:33:27,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:33:27,249 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:33:27,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2024-10-12 18:33:27,256 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a01d085e/9dc2bd128a0e4b9fa5e3a4ad7edac24d/FLAG931cf4fd4 [2024-10-12 18:33:27,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a01d085e/9dc2bd128a0e4b9fa5e3a4ad7edac24d [2024-10-12 18:33:27,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:33:27,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:33:27,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:33:27,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:33:27,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:33:27,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:33:27" (1/1) ... [2024-10-12 18:33:27,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58e7bf8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:27, skipping insertion in model container [2024-10-12 18:33:27,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:33:27" (1/1) ... [2024-10-12 18:33:27,296 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:33:27,452 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2024-10-12 18:33:27,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:33:27,474 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:33:27,486 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2024-10-12 18:33:27,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:33:27,511 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:33:27,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:27 WrapperNode [2024-10-12 18:33:27,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:33:27,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:33:27,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:33:27,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:33:27,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:27" (1/1) ... [2024-10-12 18:33:27,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:27" (1/1) ... [2024-10-12 18:33:27,546 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 78 [2024-10-12 18:33:27,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:33:27,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:33:27,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:33:27,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:33:27,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:27" (1/1) ... [2024-10-12 18:33:27,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:27" (1/1) ... [2024-10-12 18:33:27,559 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:27" (1/1) ... [2024-10-12 18:33:27,584 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 18:33:27,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:27" (1/1) ... [2024-10-12 18:33:27,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:27" (1/1) ... [2024-10-12 18:33:27,587 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:27" (1/1) ... [2024-10-12 18:33:27,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:27" (1/1) ... [2024-10-12 18:33:27,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:27" (1/1) ... [2024-10-12 18:33:27,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:27" (1/1) ... [2024-10-12 18:33:27,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:33:27,597 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:33:27,601 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:33:27,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:33:27,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:27" (1/1) ... [2024-10-12 18:33:27,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:33:27,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:33:27,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 18:33:27,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 18:33:27,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:33:27,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:33:27,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:33:27,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:33:27,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-12 18:33:27,674 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-12 18:33:27,729 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:33:27,730 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:33:27,875 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-12 18:33:27,875 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:33:27,897 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:33:27,897 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 18:33:27,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:33:27 BoogieIcfgContainer [2024-10-12 18:33:27,898 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:33:27,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:33:27,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:33:27,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:33:27,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:33:27" (1/3) ... [2024-10-12 18:33:27,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754b269d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:33:27, skipping insertion in model container [2024-10-12 18:33:27,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:33:27" (2/3) ... [2024-10-12 18:33:27,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754b269d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:33:27, skipping insertion in model container [2024-10-12 18:33:27,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:33:27" (3/3) ... [2024-10-12 18:33:27,911 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort.i [2024-10-12 18:33:27,929 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:33:27,929 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:33:27,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:33:28,003 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@7c54eb5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:33:28,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:33:28,007 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-12 18:33:28,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 18:33:28,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:28,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:28,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:28,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:28,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1492052254, now seen corresponding path program 1 times [2024-10-12 18:33:28,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:28,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565369627] [2024-10-12 18:33:28,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:28,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:28,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:28,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565369627] [2024-10-12 18:33:28,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565369627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:28,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:28,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:33:28,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960190910] [2024-10-12 18:33:28,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:28,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:33:28,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:28,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:33:28,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:33:28,416 INFO L87 Difference]: Start difference. First operand has 37 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:33:28,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:28,556 INFO L93 Difference]: Finished difference Result 99 states and 189 transitions. [2024-10-12 18:33:28,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:33:28,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-12 18:33:28,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:28,566 INFO L225 Difference]: With dead ends: 99 [2024-10-12 18:33:28,566 INFO L226 Difference]: Without dead ends: 60 [2024-10-12 18:33:28,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:33:28,574 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 20 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:28,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 168 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:28,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-12 18:33:28,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 38. [2024-10-12 18:33:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-12 18:33:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2024-10-12 18:33:28,610 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 10 [2024-10-12 18:33:28,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:28,611 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2024-10-12 18:33:28,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:33:28,611 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2024-10-12 18:33:28,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 18:33:28,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:28,612 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:28,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:33:28,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:28,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:28,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1487315485, now seen corresponding path program 1 times [2024-10-12 18:33:28,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:28,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113699130] [2024-10-12 18:33:28,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:28,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:28,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:28,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:28,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113699130] [2024-10-12 18:33:28,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113699130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:28,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:28,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:33:28,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36219361] [2024-10-12 18:33:28,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:28,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:33:28,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:28,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:33:28,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:33:28,780 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:33:28,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:28,873 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2024-10-12 18:33:28,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:33:28,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-12 18:33:28,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:28,876 INFO L225 Difference]: With dead ends: 45 [2024-10-12 18:33:28,876 INFO L226 Difference]: Without dead ends: 43 [2024-10-12 18:33:28,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:33:28,877 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 16 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:28,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 136 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:28,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-12 18:33:28,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-10-12 18:33:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-12 18:33:28,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2024-10-12 18:33:28,895 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 10 [2024-10-12 18:33:28,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:28,896 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2024-10-12 18:33:28,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:33:28,896 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2024-10-12 18:33:28,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 18:33:28,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:28,896 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:28,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:33:28,897 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:28,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:28,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1465865965, now seen corresponding path program 1 times [2024-10-12 18:33:28,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:28,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605669523] [2024-10-12 18:33:28,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:28,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:29,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:29,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:29,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605669523] [2024-10-12 18:33:29,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605669523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:29,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:29,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:33:29,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88817729] [2024-10-12 18:33:29,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:29,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:33:29,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:29,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:33:29,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:33:29,010 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:33:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:29,213 INFO L93 Difference]: Finished difference Result 79 states and 117 transitions. [2024-10-12 18:33:29,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:33:29,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-12 18:33:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:29,215 INFO L225 Difference]: With dead ends: 79 [2024-10-12 18:33:29,215 INFO L226 Difference]: Without dead ends: 77 [2024-10-12 18:33:29,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 18:33:29,219 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 29 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:29,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 194 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:33:29,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-12 18:33:29,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2024-10-12 18:33:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 18:33:29,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 101 transitions. [2024-10-12 18:33:29,235 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 101 transitions. Word has length 10 [2024-10-12 18:33:29,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:29,235 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 101 transitions. [2024-10-12 18:33:29,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:33:29,236 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 101 transitions. [2024-10-12 18:33:29,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 18:33:29,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:29,236 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:29,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 18:33:29,237 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:29,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:29,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1063638546, now seen corresponding path program 1 times [2024-10-12 18:33:29,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:29,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840569277] [2024-10-12 18:33:29,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:29,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:29,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:33:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:29,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:29,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:29,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840569277] [2024-10-12 18:33:29,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840569277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:29,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:29,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 18:33:29,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938401034] [2024-10-12 18:33:29,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:29,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:33:29,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:29,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:33:29,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:33:29,399 INFO L87 Difference]: Start difference. First operand 68 states and 101 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:33:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:29,618 INFO L93 Difference]: Finished difference Result 101 states and 152 transitions. [2024-10-12 18:33:29,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:33:29,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-12 18:33:29,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:29,622 INFO L225 Difference]: With dead ends: 101 [2024-10-12 18:33:29,622 INFO L226 Difference]: Without dead ends: 99 [2024-10-12 18:33:29,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-12 18:33:29,625 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 56 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:29,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 209 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:33:29,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-12 18:33:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2024-10-12 18:33:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 50 states have (on average 1.34) internal successors, (67), 51 states have internal predecessors, (67), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-12 18:33:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 147 transitions. [2024-10-12 18:33:29,657 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 147 transitions. Word has length 15 [2024-10-12 18:33:29,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:29,658 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 147 transitions. [2024-10-12 18:33:29,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:33:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 147 transitions. [2024-10-12 18:33:29,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 18:33:29,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:29,659 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:29,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 18:33:29,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:29,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:29,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1445001009, now seen corresponding path program 1 times [2024-10-12 18:33:29,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:29,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65181540] [2024-10-12 18:33:29,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:29,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:29,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:33:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:29,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:29,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65181540] [2024-10-12 18:33:29,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65181540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:29,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:29,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:33:29,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124965883] [2024-10-12 18:33:29,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:29,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:33:29,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:29,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:33:29,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:33:29,744 INFO L87 Difference]: Start difference. First operand 96 states and 147 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:33:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:29,822 INFO L93 Difference]: Finished difference Result 102 states and 152 transitions. [2024-10-12 18:33:29,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:33:29,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-12 18:33:29,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:29,826 INFO L225 Difference]: With dead ends: 102 [2024-10-12 18:33:29,829 INFO L226 Difference]: Without dead ends: 100 [2024-10-12 18:33:29,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:33:29,830 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:29,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 136 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:29,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-12 18:33:29,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-12 18:33:29,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 53 states have (on average 1.320754716981132) internal successors, (70), 54 states have internal predecessors, (70), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-12 18:33:29,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 150 transitions. [2024-10-12 18:33:29,870 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 150 transitions. Word has length 15 [2024-10-12 18:33:29,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:29,870 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 150 transitions. [2024-10-12 18:33:29,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:33:29,870 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 150 transitions. [2024-10-12 18:33:29,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 18:33:29,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:29,871 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:29,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 18:33:29,872 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:29,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:29,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1429998849, now seen corresponding path program 1 times [2024-10-12 18:33:29,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:29,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257102682] [2024-10-12 18:33:29,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:29,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:29,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:33:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:29,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:29,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:29,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257102682] [2024-10-12 18:33:29,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257102682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:29,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:29,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 18:33:29,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530200337] [2024-10-12 18:33:29,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:29,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:33:29,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:29,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:33:29,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:33:29,983 INFO L87 Difference]: Start difference. First operand 100 states and 150 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:33:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:30,223 INFO L93 Difference]: Finished difference Result 154 states and 239 transitions. [2024-10-12 18:33:30,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:33:30,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-12 18:33:30,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:30,226 INFO L225 Difference]: With dead ends: 154 [2024-10-12 18:33:30,226 INFO L226 Difference]: Without dead ends: 152 [2024-10-12 18:33:30,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-12 18:33:30,228 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 55 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:30,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 281 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:33:30,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-12 18:33:30,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 136. [2024-10-12 18:33:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 71 states have internal predecessors, (93), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-12 18:33:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 213 transitions. [2024-10-12 18:33:30,277 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 213 transitions. Word has length 15 [2024-10-12 18:33:30,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:30,277 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 213 transitions. [2024-10-12 18:33:30,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:33:30,277 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 213 transitions. [2024-10-12 18:33:30,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 18:33:30,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:30,279 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:30,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 18:33:30,280 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:30,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:30,280 INFO L85 PathProgramCache]: Analyzing trace with hash 476832532, now seen corresponding path program 1 times [2024-10-12 18:33:30,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:30,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461648585] [2024-10-12 18:33:30,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:30,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:30,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:33:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:30,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:30,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461648585] [2024-10-12 18:33:30,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461648585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:30,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:30,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 18:33:30,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562516397] [2024-10-12 18:33:30,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:30,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 18:33:30,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:30,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 18:33:30,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:33:30,310 INFO L87 Difference]: Start difference. First operand 136 states and 213 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:33:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:30,360 INFO L93 Difference]: Finished difference Result 273 states and 435 transitions. [2024-10-12 18:33:30,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 18:33:30,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-12 18:33:30,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:30,363 INFO L225 Difference]: With dead ends: 273 [2024-10-12 18:33:30,363 INFO L226 Difference]: Without dead ends: 204 [2024-10-12 18:33:30,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:33:30,367 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 11 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:30,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 120 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:33:30,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-12 18:33:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-10-12 18:33:30,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 102 states have internal predecessors, (138), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (98), 94 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-12 18:33:30,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 334 transitions. [2024-10-12 18:33:30,429 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 334 transitions. Word has length 15 [2024-10-12 18:33:30,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:30,430 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 334 transitions. [2024-10-12 18:33:30,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:33:30,430 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 334 transitions. [2024-10-12 18:33:30,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 18:33:30,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:30,432 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:30,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 18:33:30,432 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:30,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:30,433 INFO L85 PathProgramCache]: Analyzing trace with hash 843192835, now seen corresponding path program 1 times [2024-10-12 18:33:30,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:30,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664410200] [2024-10-12 18:33:30,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:30,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:30,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:33:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:33:30,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:30,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664410200] [2024-10-12 18:33:30,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664410200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:30,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:30,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:33:30,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233684461] [2024-10-12 18:33:30,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:30,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:33:30,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:30,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:33:30,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:33:30,486 INFO L87 Difference]: Start difference. First operand 204 states and 334 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:33:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:30,571 INFO L93 Difference]: Finished difference Result 228 states and 357 transitions. [2024-10-12 18:33:30,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:33:30,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-12 18:33:30,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:30,574 INFO L225 Difference]: With dead ends: 228 [2024-10-12 18:33:30,574 INFO L226 Difference]: Without dead ends: 182 [2024-10-12 18:33:30,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:33:30,575 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 3 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:30,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 178 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:33:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-12 18:33:30,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2024-10-12 18:33:30,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 92 states have internal predecessors, (123), 86 states have call successors, (86), 7 states have call predecessors, (86), 7 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-12 18:33:30,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 295 transitions. [2024-10-12 18:33:30,612 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 295 transitions. Word has length 15 [2024-10-12 18:33:30,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:30,612 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 295 transitions. [2024-10-12 18:33:30,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:33:30,612 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 295 transitions. [2024-10-12 18:33:30,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 18:33:30,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:30,613 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:30,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 18:33:30,613 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:30,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:30,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1745067101, now seen corresponding path program 1 times [2024-10-12 18:33:30,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:30,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34002604] [2024-10-12 18:33:30,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:30,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:30,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:33:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:30,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 18:33:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:30,674 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:33:30,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:30,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34002604] [2024-10-12 18:33:30,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34002604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:30,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:30,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:33:30,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334274994] [2024-10-12 18:33:30,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:30,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:33:30,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:30,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:33:30,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:33:30,677 INFO L87 Difference]: Start difference. First operand 182 states and 295 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:33:30,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:30,804 INFO L93 Difference]: Finished difference Result 216 states and 347 transitions. [2024-10-12 18:33:30,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:33:30,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-10-12 18:33:30,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:30,806 INFO L225 Difference]: With dead ends: 216 [2024-10-12 18:33:30,806 INFO L226 Difference]: Without dead ends: 214 [2024-10-12 18:33:30,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 18:33:30,807 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 41 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:30,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 223 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:30,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-12 18:33:30,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 196. [2024-10-12 18:33:30,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 101 states have internal predecessors, (132), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-12 18:33:30,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 316 transitions. [2024-10-12 18:33:30,846 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 316 transitions. Word has length 22 [2024-10-12 18:33:30,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:30,846 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 316 transitions. [2024-10-12 18:33:30,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:33:30,846 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 316 transitions. [2024-10-12 18:33:30,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 18:33:30,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:30,847 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:30,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 18:33:30,848 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:30,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:30,848 INFO L85 PathProgramCache]: Analyzing trace with hash -790320915, now seen corresponding path program 1 times [2024-10-12 18:33:30,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:30,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112186606] [2024-10-12 18:33:30,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:30,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:30,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:33:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:30,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 18:33:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:33:30,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:30,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112186606] [2024-10-12 18:33:30,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112186606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:30,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:30,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:33:30,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920770393] [2024-10-12 18:33:30,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:30,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:33:30,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:30,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:33:30,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:33:30,901 INFO L87 Difference]: Start difference. First operand 196 states and 316 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:33:31,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:31,179 INFO L93 Difference]: Finished difference Result 519 states and 853 transitions. [2024-10-12 18:33:31,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:33:31,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-10-12 18:33:31,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:31,184 INFO L225 Difference]: With dead ends: 519 [2024-10-12 18:33:31,184 INFO L226 Difference]: Without dead ends: 365 [2024-10-12 18:33:31,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:33:31,186 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 83 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:31,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 92 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:33:31,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-12 18:33:31,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 196. [2024-10-12 18:33:31,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 95 states have (on average 1.368421052631579) internal successors, (130), 101 states have internal predecessors, (130), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-12 18:33:31,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 314 transitions. [2024-10-12 18:33:31,233 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 314 transitions. Word has length 24 [2024-10-12 18:33:31,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:31,234 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 314 transitions. [2024-10-12 18:33:31,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:33:31,234 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 314 transitions. [2024-10-12 18:33:31,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 18:33:31,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:31,235 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:31,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 18:33:31,235 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:31,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:31,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1386762239, now seen corresponding path program 1 times [2024-10-12 18:33:31,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:31,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145481163] [2024-10-12 18:33:31,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:31,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:31,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:33:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:31,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 18:33:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:31,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 18:33:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:31,323 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 18:33:31,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:31,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145481163] [2024-10-12 18:33:31,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145481163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:31,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:31,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:33:31,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410116349] [2024-10-12 18:33:31,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:31,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:33:31,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:31,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:33:31,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:33:31,325 INFO L87 Difference]: Start difference. First operand 196 states and 314 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 18:33:31,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:31,507 INFO L93 Difference]: Finished difference Result 290 states and 470 transitions. [2024-10-12 18:33:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:33:31,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-10-12 18:33:31,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:31,510 INFO L225 Difference]: With dead ends: 290 [2024-10-12 18:33:31,510 INFO L226 Difference]: Without dead ends: 288 [2024-10-12 18:33:31,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 18:33:31,511 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 25 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:31,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 233 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-12 18:33:31,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 268. [2024-10-12 18:33:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 117 states have (on average 1.3675213675213675) internal successors, (160), 131 states have internal predecessors, (160), 140 states have call successors, (140), 10 states have call predecessors, (140), 10 states have return successors, (140), 126 states have call predecessors, (140), 140 states have call successors, (140) [2024-10-12 18:33:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 440 transitions. [2024-10-12 18:33:31,573 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 440 transitions. Word has length 25 [2024-10-12 18:33:31,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:31,574 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 440 transitions. [2024-10-12 18:33:31,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 18:33:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 440 transitions. [2024-10-12 18:33:31,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 18:33:31,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:31,575 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:31,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 18:33:31,577 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:31,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:31,577 INFO L85 PathProgramCache]: Analyzing trace with hash 195962487, now seen corresponding path program 1 times [2024-10-12 18:33:31,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:31,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574867092] [2024-10-12 18:33:31,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:31,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:31,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:33:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:31,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 18:33:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:31,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 18:33:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 18:33:31,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:31,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574867092] [2024-10-12 18:33:31,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574867092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:31,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:31,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 18:33:31,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86829120] [2024-10-12 18:33:31,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:31,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:33:31,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:31,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:33:31,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:33:31,692 INFO L87 Difference]: Start difference. First operand 268 states and 440 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 18:33:31,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:31,905 INFO L93 Difference]: Finished difference Result 316 states and 515 transitions. [2024-10-12 18:33:31,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:33:31,905 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-10-12 18:33:31,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:31,908 INFO L225 Difference]: With dead ends: 316 [2024-10-12 18:33:31,908 INFO L226 Difference]: Without dead ends: 314 [2024-10-12 18:33:31,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-12 18:33:31,909 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 71 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:31,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 187 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:31,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-10-12 18:33:31,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 286. [2024-10-12 18:33:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 140 states have internal predecessors, (169), 150 states have call successors, (150), 11 states have call predecessors, (150), 11 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2024-10-12 18:33:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 469 transitions. [2024-10-12 18:33:31,968 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 469 transitions. Word has length 27 [2024-10-12 18:33:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:31,969 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 469 transitions. [2024-10-12 18:33:31,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 18:33:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 469 transitions. [2024-10-12 18:33:31,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 18:33:31,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:31,970 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:31,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 18:33:31,971 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:31,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:31,971 INFO L85 PathProgramCache]: Analyzing trace with hash -298962274, now seen corresponding path program 1 times [2024-10-12 18:33:31,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:31,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102150345] [2024-10-12 18:33:31,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:31,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:32,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:33:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:32,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 18:33:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:32,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 18:33:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:32,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 18:33:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:32,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 18:33:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:32,069 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-12 18:33:32,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:32,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102150345] [2024-10-12 18:33:32,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102150345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:32,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:32,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 18:33:32,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218561384] [2024-10-12 18:33:32,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:32,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:33:32,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:32,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:33:32,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:33:32,073 INFO L87 Difference]: Start difference. First operand 286 states and 469 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 18:33:32,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:32,280 INFO L93 Difference]: Finished difference Result 328 states and 526 transitions. [2024-10-12 18:33:32,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:33:32,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2024-10-12 18:33:32,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:32,284 INFO L225 Difference]: With dead ends: 328 [2024-10-12 18:33:32,284 INFO L226 Difference]: Without dead ends: 326 [2024-10-12 18:33:32,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-12 18:33:32,285 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 35 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:32,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 258 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:32,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-12 18:33:32,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 290. [2024-10-12 18:33:32,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 127 states have (on average 1.3543307086614174) internal successors, (172), 143 states have internal predecessors, (172), 150 states have call successors, (150), 12 states have call predecessors, (150), 12 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2024-10-12 18:33:32,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 472 transitions. [2024-10-12 18:33:32,341 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 472 transitions. Word has length 37 [2024-10-12 18:33:32,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:32,342 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 472 transitions. [2024-10-12 18:33:32,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 18:33:32,342 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 472 transitions. [2024-10-12 18:33:32,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 18:33:32,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:32,344 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:32,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 18:33:32,345 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:32,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:32,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1033855744, now seen corresponding path program 1 times [2024-10-12 18:33:32,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:32,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323601768] [2024-10-12 18:33:32,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:32,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:32,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:33:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:32,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 18:33:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:32,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 18:33:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:32,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 18:33:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:32,420 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-12 18:33:32,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:32,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323601768] [2024-10-12 18:33:32,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323601768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:32,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:32,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 18:33:32,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568199198] [2024-10-12 18:33:32,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:32,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:33:32,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:32,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:33:32,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:33:32,424 INFO L87 Difference]: Start difference. First operand 290 states and 472 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 18:33:32,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:32,608 INFO L93 Difference]: Finished difference Result 312 states and 501 transitions. [2024-10-12 18:33:32,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 18:33:32,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2024-10-12 18:33:32,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:32,613 INFO L225 Difference]: With dead ends: 312 [2024-10-12 18:33:32,613 INFO L226 Difference]: Without dead ends: 310 [2024-10-12 18:33:32,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-12 18:33:32,614 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 29 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:32,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 147 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:32,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-10-12 18:33:32,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 294. [2024-10-12 18:33:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 130 states have (on average 1.3461538461538463) internal successors, (175), 146 states have internal predecessors, (175), 150 states have call successors, (150), 13 states have call predecessors, (150), 13 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2024-10-12 18:33:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 475 transitions. [2024-10-12 18:33:32,673 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 475 transitions. Word has length 37 [2024-10-12 18:33:32,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:32,673 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 475 transitions. [2024-10-12 18:33:32,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 18:33:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 475 transitions. [2024-10-12 18:33:32,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 18:33:32,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:32,674 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:32,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 18:33:32,675 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:32,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:32,675 INFO L85 PathProgramCache]: Analyzing trace with hash -285091126, now seen corresponding path program 1 times [2024-10-12 18:33:32,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:32,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048457533] [2024-10-12 18:33:32,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:32,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:32,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:33:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:32,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 18:33:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:32,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 18:33:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:32,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 18:33:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:32,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 18:33:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:32,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 18:33:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:32,783 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 18:33:32,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:32,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048457533] [2024-10-12 18:33:32,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048457533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:32,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:33:32,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 18:33:32,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010286746] [2024-10-12 18:33:32,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:32,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:33:32,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:32,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:33:32,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:33:32,785 INFO L87 Difference]: Start difference. First operand 294 states and 475 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 18:33:32,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:32,961 INFO L93 Difference]: Finished difference Result 328 states and 524 transitions. [2024-10-12 18:33:32,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 18:33:32,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2024-10-12 18:33:32,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:32,964 INFO L225 Difference]: With dead ends: 328 [2024-10-12 18:33:32,964 INFO L226 Difference]: Without dead ends: 326 [2024-10-12 18:33:32,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-12 18:33:32,965 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 40 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:32,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 193 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:32,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-12 18:33:33,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 173. [2024-10-12 18:33:33,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 92 states have internal predecessors, (107), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2024-10-12 18:33:33,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 259 transitions. [2024-10-12 18:33:33,002 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 259 transitions. Word has length 49 [2024-10-12 18:33:33,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:33,003 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 259 transitions. [2024-10-12 18:33:33,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 18:33:33,003 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 259 transitions. [2024-10-12 18:33:33,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 18:33:33,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:33,004 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:33,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 18:33:33,004 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:33,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:33,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1647948154, now seen corresponding path program 1 times [2024-10-12 18:33:33,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:33,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101349817] [2024-10-12 18:33:33,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:33,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:33,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:33:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:33,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 18:33:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:33,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 18:33:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:33,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 18:33:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:33,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 18:33:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:33,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 18:33:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:33,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 18:33:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:33,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 18:33:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:33,111 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-12 18:33:33,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:33,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101349817] [2024-10-12 18:33:33,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101349817] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:33:33,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776791722] [2024-10-12 18:33:33,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:33,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:33:33,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:33:33,114 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:33:33,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 18:33:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:33,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 18:33:33,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:33:33,289 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-12 18:33:33,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:33:33,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776791722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:33,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 18:33:33,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2024-10-12 18:33:33,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035224163] [2024-10-12 18:33:33,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:33,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:33:33,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:33,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:33:33,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-12 18:33:33,294 INFO L87 Difference]: Start difference. First operand 173 states and 259 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 18:33:33,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:33,548 INFO L93 Difference]: Finished difference Result 500 states and 794 transitions. [2024-10-12 18:33:33,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 18:33:33,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2024-10-12 18:33:33,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:33,551 INFO L225 Difference]: With dead ends: 500 [2024-10-12 18:33:33,551 INFO L226 Difference]: Without dead ends: 330 [2024-10-12 18:33:33,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:33:33,552 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 41 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:33,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 132 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:33,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-10-12 18:33:33,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 310. [2024-10-12 18:33:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 135 states have (on average 1.348148148148148) internal successors, (182), 151 states have internal predecessors, (182), 162 states have call successors, (162), 12 states have call predecessors, (162), 12 states have return successors, (162), 146 states have call predecessors, (162), 162 states have call successors, (162) [2024-10-12 18:33:33,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 506 transitions. [2024-10-12 18:33:33,644 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 506 transitions. Word has length 57 [2024-10-12 18:33:33,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:33,644 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 506 transitions. [2024-10-12 18:33:33,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 18:33:33,644 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 506 transitions. [2024-10-12 18:33:33,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 18:33:33,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:33,646 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:33,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 18:33:33,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-12 18:33:33,847 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:33,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:33,847 INFO L85 PathProgramCache]: Analyzing trace with hash 242531336, now seen corresponding path program 1 times [2024-10-12 18:33:33,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:33,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601499196] [2024-10-12 18:33:33,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:33,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:33,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:33:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:33,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 18:33:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:33,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 18:33:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:33,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 18:33:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:33,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 18:33:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:33,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 18:33:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:33,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 18:33:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:33,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 18:33:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:33,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 18:33:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:34,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 18:33:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:34,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 18:33:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:34,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 18:33:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-12 18:33:34,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:34,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601499196] [2024-10-12 18:33:34,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601499196] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:33:34,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787282194] [2024-10-12 18:33:34,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:34,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:33:34,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:33:34,011 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:33:34,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 18:33:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:34,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 18:33:34,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:33:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-10-12 18:33:34,312 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:33:34,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787282194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:34,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 18:33:34,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-10-12 18:33:34,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068671963] [2024-10-12 18:33:34,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:34,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:33:34,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:34,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:33:34,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-12 18:33:34,314 INFO L87 Difference]: Start difference. First operand 310 states and 506 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 18:33:34,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:34,605 INFO L93 Difference]: Finished difference Result 577 states and 924 transitions. [2024-10-12 18:33:34,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 18:33:34,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 79 [2024-10-12 18:33:34,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:34,608 INFO L225 Difference]: With dead ends: 577 [2024-10-12 18:33:34,608 INFO L226 Difference]: Without dead ends: 301 [2024-10-12 18:33:34,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-10-12 18:33:34,610 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 30 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:34,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 231 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:33:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-12 18:33:34,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 266. [2024-10-12 18:33:34,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 123 states have (on average 1.3170731707317074) internal successors, (162), 135 states have internal predecessors, (162), 130 states have call successors, (130), 12 states have call predecessors, (130), 12 states have return successors, (130), 118 states have call predecessors, (130), 130 states have call successors, (130) [2024-10-12 18:33:34,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 422 transitions. [2024-10-12 18:33:34,698 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 422 transitions. Word has length 79 [2024-10-12 18:33:34,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:34,698 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 422 transitions. [2024-10-12 18:33:34,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 18:33:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 422 transitions. [2024-10-12 18:33:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 18:33:34,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:34,699 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:34,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 18:33:34,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-12 18:33:34,903 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:34,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:34,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1780871366, now seen corresponding path program 1 times [2024-10-12 18:33:34,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:34,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514827664] [2024-10-12 18:33:34,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:34,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:33:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 18:33:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 18:33:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 18:33:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 18:33:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 18:33:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 18:33:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 18:33:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 18:33:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 18:33:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 18:33:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 18:33:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-12 18:33:35,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:35,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514827664] [2024-10-12 18:33:35,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514827664] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:33:35,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685699866] [2024-10-12 18:33:35,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:35,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:33:35,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:33:35,030 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:33:35,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 18:33:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 18:33:35,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:33:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-10-12 18:33:35,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:33:35,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685699866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:33:35,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 18:33:35,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-10-12 18:33:35,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94060973] [2024-10-12 18:33:35,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:33:35,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:33:35,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:35,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:33:35,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-12 18:33:35,243 INFO L87 Difference]: Start difference. First operand 266 states and 422 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 18:33:35,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:35,461 INFO L93 Difference]: Finished difference Result 495 states and 778 transitions. [2024-10-12 18:33:35,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:33:35,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2024-10-12 18:33:35,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:35,464 INFO L225 Difference]: With dead ends: 495 [2024-10-12 18:33:35,464 INFO L226 Difference]: Without dead ends: 219 [2024-10-12 18:33:35,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-12 18:33:35,466 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 21 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:35,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 143 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:33:35,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-12 18:33:35,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 209. [2024-10-12 18:33:35,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 98 states have (on average 1.2857142857142858) internal successors, (126), 108 states have internal predecessors, (126), 98 states have call successors, (98), 12 states have call predecessors, (98), 12 states have return successors, (98), 88 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-12 18:33:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 322 transitions. [2024-10-12 18:33:35,531 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 322 transitions. Word has length 79 [2024-10-12 18:33:35,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:35,531 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 322 transitions. [2024-10-12 18:33:35,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 18:33:35,531 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 322 transitions. [2024-10-12 18:33:35,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 18:33:35,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:35,532 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:35,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 18:33:35,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-12 18:33:35,737 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:35,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:35,737 INFO L85 PathProgramCache]: Analyzing trace with hash 345657593, now seen corresponding path program 1 times [2024-10-12 18:33:35,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:35,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303803396] [2024-10-12 18:33:35,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:35,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:33:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 18:33:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 18:33:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 18:33:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 18:33:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 18:33:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 18:33:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 18:33:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 18:33:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 18:33:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 18:33:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 18:33:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,856 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 37 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-12 18:33:35,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:35,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303803396] [2024-10-12 18:33:35,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303803396] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:33:35,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861181140] [2024-10-12 18:33:35,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:35,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:33:35,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:33:35,859 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:33:35,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 18:33:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:35,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 18:33:35,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:33:35,989 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-10-12 18:33:35,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:33:36,116 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-12 18:33:36,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861181140] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:33:36,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:33:36,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2024-10-12 18:33:36,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831356827] [2024-10-12 18:33:36,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:33:36,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 18:33:36,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:36,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 18:33:36,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-10-12 18:33:36,118 INFO L87 Difference]: Start difference. First operand 209 states and 322 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 7 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2024-10-12 18:33:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:37,418 INFO L93 Difference]: Finished difference Result 514 states and 774 transitions. [2024-10-12 18:33:37,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-12 18:33:37,418 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 7 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) Word has length 84 [2024-10-12 18:33:37,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:37,421 INFO L225 Difference]: With dead ends: 514 [2024-10-12 18:33:37,421 INFO L226 Difference]: Without dead ends: 344 [2024-10-12 18:33:37,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=549, Invalid=1613, Unknown=0, NotChecked=0, Total=2162 [2024-10-12 18:33:37,423 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 195 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:37,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1119 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 18:33:37,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-12 18:33:37,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 240. [2024-10-12 18:33:37,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 120 states have (on average 1.2583333333333333) internal successors, (151), 130 states have internal predecessors, (151), 105 states have call successors, (105), 14 states have call predecessors, (105), 14 states have return successors, (105), 95 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-12 18:33:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 361 transitions. [2024-10-12 18:33:37,496 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 361 transitions. Word has length 84 [2024-10-12 18:33:37,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:37,496 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 361 transitions. [2024-10-12 18:33:37,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 7 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2024-10-12 18:33:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 361 transitions. [2024-10-12 18:33:37,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 18:33:37,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:37,498 INFO L215 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:37,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 18:33:37,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:33:37,698 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:37,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:37,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2105137319, now seen corresponding path program 1 times [2024-10-12 18:33:37,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:37,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607244713] [2024-10-12 18:33:37,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:37,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:37,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:33:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:37,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 18:33:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:37,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 18:33:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:37,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 18:33:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:37,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 18:33:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:37,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 18:33:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:37,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 18:33:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:37,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 18:33:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:37,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 18:33:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:37,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 18:33:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:37,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 18:33:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:37,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 18:33:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:37,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 18:33:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:37,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 18:33:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:37,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 18:33:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:37,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 18:33:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:37,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 18:33:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:37,833 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 18:33:37,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:37,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607244713] [2024-10-12 18:33:37,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607244713] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:33:37,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590260262] [2024-10-12 18:33:37,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:37,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:33:37,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:33:37,836 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:33:37,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 18:33:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:37,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 18:33:37,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:33:38,074 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 210 proven. 7 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-10-12 18:33:38,074 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:33:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 18:33:38,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590260262] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:33:38,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:33:38,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-10-12 18:33:38,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555248008] [2024-10-12 18:33:38,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:33:38,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-12 18:33:38,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:38,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-12 18:33:38,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2024-10-12 18:33:38,273 INFO L87 Difference]: Start difference. First operand 240 states and 361 transitions. Second operand has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 12 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (46), 12 states have call predecessors, (46), 12 states have call successors, (46) [2024-10-12 18:33:40,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:40,341 INFO L93 Difference]: Finished difference Result 849 states and 1341 transitions. [2024-10-12 18:33:40,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-10-12 18:33:40,342 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 12 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (46), 12 states have call predecessors, (46), 12 states have call successors, (46) Word has length 111 [2024-10-12 18:33:40,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:40,346 INFO L225 Difference]: With dead ends: 849 [2024-10-12 18:33:40,346 INFO L226 Difference]: Without dead ends: 482 [2024-10-12 18:33:40,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=943, Invalid=2839, Unknown=0, NotChecked=0, Total=3782 [2024-10-12 18:33:40,350 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 310 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:40,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1280 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 18:33:40,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-10-12 18:33:40,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 369. [2024-10-12 18:33:40,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 169 states have (on average 1.2662721893491125) internal successors, (214), 183 states have internal predecessors, (214), 186 states have call successors, (186), 13 states have call predecessors, (186), 13 states have return successors, (186), 172 states have call predecessors, (186), 186 states have call successors, (186) [2024-10-12 18:33:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 586 transitions. [2024-10-12 18:33:40,477 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 586 transitions. Word has length 111 [2024-10-12 18:33:40,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:40,478 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 586 transitions. [2024-10-12 18:33:40,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 12 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (46), 12 states have call predecessors, (46), 12 states have call successors, (46) [2024-10-12 18:33:40,478 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 586 transitions. [2024-10-12 18:33:40,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 18:33:40,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:40,480 INFO L215 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:40,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 18:33:40,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:33:40,681 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:40,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:40,681 INFO L85 PathProgramCache]: Analyzing trace with hash -844220069, now seen corresponding path program 1 times [2024-10-12 18:33:40,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:40,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254463924] [2024-10-12 18:33:40,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:40,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:40,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:33:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:40,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 18:33:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:40,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 18:33:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:40,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 18:33:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 18:33:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:40,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 18:33:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:40,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 18:33:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:40,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 18:33:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:40,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 18:33:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:40,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 18:33:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:40,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 18:33:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:40,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 18:33:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:40,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 18:33:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:40,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 18:33:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:40,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 18:33:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:40,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 18:33:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:40,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 18:33:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 18:33:40,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:40,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254463924] [2024-10-12 18:33:40,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254463924] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:33:40,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656294967] [2024-10-12 18:33:40,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:40,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:33:40,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:33:40,866 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:33:40,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 18:33:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:40,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 18:33:40,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:33:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 18:33:41,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:33:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-12 18:33:41,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656294967] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:33:41,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:33:41,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-10-12 18:33:41,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575083083] [2024-10-12 18:33:41,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:33:41,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-12 18:33:41,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:41,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-12 18:33:41,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-10-12 18:33:41,341 INFO L87 Difference]: Start difference. First operand 369 states and 586 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 18 states have internal predecessors, (65), 8 states have call successors, (50), 3 states have call predecessors, (50), 1 states have return successors, (47), 8 states have call predecessors, (47), 8 states have call successors, (47) [2024-10-12 18:33:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:42,559 INFO L93 Difference]: Finished difference Result 856 states and 1367 transitions. [2024-10-12 18:33:42,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-12 18:33:42,559 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 18 states have internal predecessors, (65), 8 states have call successors, (50), 3 states have call predecessors, (50), 1 states have return successors, (47), 8 states have call predecessors, (47), 8 states have call successors, (47) Word has length 111 [2024-10-12 18:33:42,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:42,564 INFO L225 Difference]: With dead ends: 856 [2024-10-12 18:33:42,564 INFO L226 Difference]: Without dead ends: 738 [2024-10-12 18:33:42,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 243 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=363, Invalid=1119, Unknown=0, NotChecked=0, Total=1482 [2024-10-12 18:33:42,566 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 313 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 435 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 435 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:42,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 658 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [435 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 18:33:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-10-12 18:33:42,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 413. [2024-10-12 18:33:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 184 states have (on average 1.2771739130434783) internal successors, (235), 206 states have internal predecessors, (235), 212 states have call successors, (212), 16 states have call predecessors, (212), 16 states have return successors, (212), 190 states have call predecessors, (212), 212 states have call successors, (212) [2024-10-12 18:33:42,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 659 transitions. [2024-10-12 18:33:42,688 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 659 transitions. Word has length 111 [2024-10-12 18:33:42,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:42,688 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 659 transitions. [2024-10-12 18:33:42,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 18 states have internal predecessors, (65), 8 states have call successors, (50), 3 states have call predecessors, (50), 1 states have return successors, (47), 8 states have call predecessors, (47), 8 states have call successors, (47) [2024-10-12 18:33:42,688 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 659 transitions. [2024-10-12 18:33:42,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-12 18:33:42,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:33:42,691 INFO L215 NwaCegarLoop]: trace histogram [32, 31, 31, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:42,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-12 18:33:42,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:33:42,895 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:33:42,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:33:42,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1492040008, now seen corresponding path program 2 times [2024-10-12 18:33:42,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:33:42,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909454213] [2024-10-12 18:33:42,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:33:42,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:33:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:33:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 18:33:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 18:33:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 18:33:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 18:33:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 18:33:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 18:33:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 18:33:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 18:33:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 18:33:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 18:33:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 18:33:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 18:33:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 18:33:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 18:33:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-12 18:33:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 18:33:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 18:33:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-12 18:33:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 18:33:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 18:33:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 18:33:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-12 18:33:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-12 18:33:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-12 18:33:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-12 18:33:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-12 18:33:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-12 18:33:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-12 18:33:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-12 18:33:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-12 18:33:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:33:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1986 backedges. 62 proven. 47 refuted. 0 times theorem prover too weak. 1877 trivial. 0 not checked. [2024-10-12 18:33:43,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:33:43,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909454213] [2024-10-12 18:33:43,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909454213] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:33:43,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036477330] [2024-10-12 18:33:43,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:33:43,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:33:43,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:33:43,174 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:33:43,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 18:33:43,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 18:33:43,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:33:43,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 18:33:43,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:33:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1986 backedges. 89 proven. 19 refuted. 0 times theorem prover too weak. 1878 trivial. 0 not checked. [2024-10-12 18:33:43,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:33:43,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1986 backedges. 86 proven. 22 refuted. 0 times theorem prover too weak. 1878 trivial. 0 not checked. [2024-10-12 18:33:43,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036477330] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:33:43,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:33:43,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2024-10-12 18:33:43,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124298118] [2024-10-12 18:33:43,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:33:43,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-12 18:33:43,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:33:43,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-12 18:33:43,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-10-12 18:33:43,730 INFO L87 Difference]: Start difference. First operand 413 states and 659 transitions. Second operand has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 17 states have internal predecessors, (79), 9 states have call successors, (66), 3 states have call predecessors, (66), 1 states have return successors, (63), 9 states have call predecessors, (63), 9 states have call successors, (63) [2024-10-12 18:33:44,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:33:44,489 INFO L93 Difference]: Finished difference Result 466 states and 733 transitions. [2024-10-12 18:33:44,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-12 18:33:44,490 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 17 states have internal predecessors, (79), 9 states have call successors, (66), 3 states have call predecessors, (66), 1 states have return successors, (63), 9 states have call predecessors, (63), 9 states have call successors, (63) Word has length 190 [2024-10-12 18:33:44,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:33:44,492 INFO L225 Difference]: With dead ends: 466 [2024-10-12 18:33:44,492 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 18:33:44,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2024-10-12 18:33:44,494 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 133 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 18:33:44,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 671 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 18:33:44,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 18:33:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 18:33:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:33:44,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 18:33:44,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 190 [2024-10-12 18:33:44,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:33:44,496 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 18:33:44,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 17 states have internal predecessors, (79), 9 states have call successors, (66), 3 states have call predecessors, (66), 1 states have return successors, (63), 9 states have call predecessors, (63), 9 states have call successors, (63) [2024-10-12 18:33:44,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 18:33:44,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 18:33:44,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 18:33:44,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 18:33:44,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:33:44,703 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:33:44,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.