./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-86.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 593a0fd2d509817879488fa887cd4b7fba333f845843eb4bb92d87213a868eae --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:53:18,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:53:18,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:53:18,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:53:18,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:53:18,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:53:18,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:53:18,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:53:18,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:53:18,364 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:53:18,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:53:18,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:53:18,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:53:18,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:53:18,366 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:53:18,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:53:18,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:53:18,367 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:53:18,367 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:53:18,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:53:18,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:53:18,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:53:18,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:53:18,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:53:18,372 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:53:18,372 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:53:18,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:53:18,372 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:53:18,373 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:53:18,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:53:18,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:53:18,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:53:18,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:53:18,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:53:18,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:53:18,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:53:18,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:53:18,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:53:18,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:53:18,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:53:18,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:53:18,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:53:18,377 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 -> 593a0fd2d509817879488fa887cd4b7fba333f845843eb4bb92d87213a868eae [2024-11-12 06:53:18,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:53:18,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:53:18,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:53:18,678 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:53:18,678 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:53:18,679 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-86.i [2024-11-12 06:53:20,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:53:20,400 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:53:20,401 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-86.i [2024-11-12 06:53:20,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d9bd1546/2c15e74c61fa460bbfb389e9cd4c34b5/FLAG66e478d85 [2024-11-12 06:53:20,427 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d9bd1546/2c15e74c61fa460bbfb389e9cd4c34b5 [2024-11-12 06:53:20,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:53:20,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:53:20,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:53:20,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:53:20,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:53:20,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:53:20" (1/1) ... [2024-11-12 06:53:20,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f4e01c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:20, skipping insertion in model container [2024-11-12 06:53:20,441 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:53:20" (1/1) ... [2024-11-12 06:53:20,473 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:53:20,687 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-86.i[915,928] [2024-11-12 06:53:20,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:53:20,754 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:53:20,765 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-86.i[915,928] [2024-11-12 06:53:20,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:53:20,816 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:53:20,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:20 WrapperNode [2024-11-12 06:53:20,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:53:20,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:53:20,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:53:20,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:53:20,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:20" (1/1) ... [2024-11-12 06:53:20,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:20" (1/1) ... [2024-11-12 06:53:20,883 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-11-12 06:53:20,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:53:20,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:53:20,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:53:20,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:53:20,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:20" (1/1) ... [2024-11-12 06:53:20,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:20" (1/1) ... [2024-11-12 06:53:20,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:20" (1/1) ... [2024-11-12 06:53:20,931 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-11-12 06:53:20,932 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:20" (1/1) ... [2024-11-12 06:53:20,932 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:20" (1/1) ... [2024-11-12 06:53:20,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:20" (1/1) ... [2024-11-12 06:53:20,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:20" (1/1) ... [2024-11-12 06:53:20,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:20" (1/1) ... [2024-11-12 06:53:20,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:20" (1/1) ... [2024-11-12 06:53:20,957 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:53:20,958 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:53:20,959 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:53:20,959 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:53:20,960 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:20" (1/1) ... [2024-11-12 06:53:20,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:53:20,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:53:21,007 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-11-12 06:53:21,011 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-11-12 06:53:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:53:21,066 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:53:21,067 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:53:21,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:53:21,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:53:21,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:53:21,155 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:53:21,160 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:53:21,485 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 06:53:21,486 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:53:21,499 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:53:21,499 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:53:21,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:53:21 BoogieIcfgContainer [2024-11-12 06:53:21,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:53:21,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:53:21,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:53:21,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:53:21,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:53:20" (1/3) ... [2024-11-12 06:53:21,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba4e596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:53:21, skipping insertion in model container [2024-11-12 06:53:21,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:20" (2/3) ... [2024-11-12 06:53:21,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba4e596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:53:21, skipping insertion in model container [2024-11-12 06:53:21,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:53:21" (3/3) ... [2024-11-12 06:53:21,509 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-86.i [2024-11-12 06:53:21,526 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:53:21,526 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:53:21,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:53:21,592 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;@5dd6bb84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:53:21,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:53:21,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 06:53:21,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-12 06:53:21,607 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:21,608 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:53:21,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:21,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:21,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1873808516, now seen corresponding path program 1 times [2024-11-12 06:53:21,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:53:21,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488518985] [2024-11-12 06:53:21,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:21,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:53:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:21,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:53:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:53:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:53:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:53:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:53:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:53:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:53:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:53:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:53:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:53:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:53:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:53:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:53:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:53:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:53:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:53:22,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:53:22,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488518985] [2024-11-12 06:53:22,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488518985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:53:22,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:53:22,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:53:22,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952151143] [2024-11-12 06:53:22,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:53:22,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:53:22,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:53:22,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:53:22,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:53:22,166 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 06:53:22,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:53:22,200 INFO L93 Difference]: Finished difference Result 103 states and 173 transitions. [2024-11-12 06:53:22,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:53:22,204 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2024-11-12 06:53:22,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:53:22,213 INFO L225 Difference]: With dead ends: 103 [2024-11-12 06:53:22,214 INFO L226 Difference]: Without dead ends: 51 [2024-11-12 06:53:22,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:53:22,224 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:53:22,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:53:22,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-12 06:53:22,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-12 06:53:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 06:53:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2024-11-12 06:53:22,281 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 101 [2024-11-12 06:53:22,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:53:22,283 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2024-11-12 06:53:22,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 06:53:22,284 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2024-11-12 06:53:22,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-12 06:53:22,289 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:22,290 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:53:22,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:53:22,290 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:22,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:22,291 INFO L85 PathProgramCache]: Analyzing trace with hash 715629638, now seen corresponding path program 1 times [2024-11-12 06:53:22,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:53:22,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340439312] [2024-11-12 06:53:22,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:22,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:53:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:53:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:53:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:53:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:53:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:53:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:53:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:53:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:53:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:53:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:53:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:53:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:53:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:53:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:53:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:53:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:22,885 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:53:22,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:53:22,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340439312] [2024-11-12 06:53:22,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340439312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:53:22,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:53:22,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:53:22,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539494089] [2024-11-12 06:53:22,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:53:22,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:53:22,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:53:22,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:53:22,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:53:22,891 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 06:53:23,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:53:23,122 INFO L93 Difference]: Finished difference Result 148 states and 220 transitions. [2024-11-12 06:53:23,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 06:53:23,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-12 06:53:23,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:53:23,127 INFO L225 Difference]: With dead ends: 148 [2024-11-12 06:53:23,127 INFO L226 Difference]: Without dead ends: 100 [2024-11-12 06:53:23,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 06:53:23,131 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 99 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:53:23,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 237 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 06:53:23,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-12 06:53:23,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 84. [2024-11-12 06:53:23,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 06:53:23,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 125 transitions. [2024-11-12 06:53:23,155 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 125 transitions. Word has length 101 [2024-11-12 06:53:23,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:53:23,156 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 125 transitions. [2024-11-12 06:53:23,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 06:53:23,156 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 125 transitions. [2024-11-12 06:53:23,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-12 06:53:23,158 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:23,158 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:53:23,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:53:23,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:23,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:23,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1416694216, now seen corresponding path program 1 times [2024-11-12 06:53:23,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:53:23,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873747676] [2024-11-12 06:53:23,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:23,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:53:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:53:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:53:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:53:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:53:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:53:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:53:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:53:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:53:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:53:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:53:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:53:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:53:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:53:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:53:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:53:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:53:28,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:53:29,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873747676] [2024-11-12 06:53:29,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873747676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:53:29,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:53:29,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 06:53:29,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987276879] [2024-11-12 06:53:29,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:53:29,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 06:53:29,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:53:29,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 06:53:29,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-12 06:53:29,003 INFO L87 Difference]: Start difference. First operand 84 states and 125 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 06:53:30,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:53:30,063 INFO L93 Difference]: Finished difference Result 213 states and 306 transitions. [2024-11-12 06:53:30,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 06:53:30,064 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-12 06:53:30,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:53:30,067 INFO L225 Difference]: With dead ends: 213 [2024-11-12 06:53:30,070 INFO L226 Difference]: Without dead ends: 162 [2024-11-12 06:53:30,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2024-11-12 06:53:30,074 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 282 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 06:53:30,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 446 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 06:53:30,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-12 06:53:30,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 100. [2024-11-12 06:53:30,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 67 states have internal predecessors, (85), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 06:53:30,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2024-11-12 06:53:30,103 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 101 [2024-11-12 06:53:30,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:53:30,105 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2024-11-12 06:53:30,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 06:53:30,106 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2024-11-12 06:53:30,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-12 06:53:30,110 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:30,110 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:53:30,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 06:53:30,111 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:30,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:30,112 INFO L85 PathProgramCache]: Analyzing trace with hash 829888202, now seen corresponding path program 1 times [2024-11-12 06:53:30,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:53:30,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72088000] [2024-11-12 06:53:30,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:30,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:53:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:53:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:53:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:53:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:53:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:53:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:53:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:53:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:53:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:53:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:53:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:53:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:53:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:53:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:53:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:53:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,243 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:53:30,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:53:30,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72088000] [2024-11-12 06:53:30,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72088000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:53:30,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:53:30,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:53:30,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798327808] [2024-11-12 06:53:30,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:53:30,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:53:30,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:53:30,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:53:30,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:53:30,246 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 06:53:30,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:53:30,284 INFO L93 Difference]: Finished difference Result 197 states and 289 transitions. [2024-11-12 06:53:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:53:30,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-12 06:53:30,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:53:30,287 INFO L225 Difference]: With dead ends: 197 [2024-11-12 06:53:30,287 INFO L226 Difference]: Without dead ends: 147 [2024-11-12 06:53:30,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-11-12 06:53:30,289 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 65 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:53:30,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 152 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:53:30,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-12 06:53:30,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2024-11-12 06:53:30,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 96 states have (on average 1.25) internal successors, (120), 96 states have internal predecessors, (120), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-12 06:53:30,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 210 transitions. [2024-11-12 06:53:30,305 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 210 transitions. Word has length 101 [2024-11-12 06:53:30,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:53:30,305 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 210 transitions. [2024-11-12 06:53:30,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 06:53:30,306 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 210 transitions. [2024-11-12 06:53:30,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 06:53:30,307 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:30,307 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:53:30,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 06:53:30,308 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:30,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:30,308 INFO L85 PathProgramCache]: Analyzing trace with hash 809192120, now seen corresponding path program 1 times [2024-11-12 06:53:30,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:53:30,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557040390] [2024-11-12 06:53:30,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:30,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:53:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:53:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:53:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:53:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:53:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:53:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:53:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:53:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:53:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:53:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:53:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:53:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:53:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:53:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:53:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:53:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:53:30,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:53:30,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557040390] [2024-11-12 06:53:30,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557040390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:53:30,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:53:30,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 06:53:30,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511405330] [2024-11-12 06:53:30,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:53:30,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:53:30,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:53:30,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:53:30,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:53:30,615 INFO L87 Difference]: Start difference. First operand 145 states and 210 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 06:53:30,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:53:30,656 INFO L93 Difference]: Finished difference Result 250 states and 364 transitions. [2024-11-12 06:53:30,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:53:30,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-12 06:53:30,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:53:30,659 INFO L225 Difference]: With dead ends: 250 [2024-11-12 06:53:30,659 INFO L226 Difference]: Without dead ends: 154 [2024-11-12 06:53:30,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:53:30,662 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:53:30,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 197 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:53:30,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-12 06:53:30,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 145. [2024-11-12 06:53:30,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 96 states have (on average 1.21875) internal successors, (117), 96 states have internal predecessors, (117), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-12 06:53:30,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 207 transitions. [2024-11-12 06:53:30,688 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 207 transitions. Word has length 102 [2024-11-12 06:53:30,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:53:30,691 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 207 transitions. [2024-11-12 06:53:30,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 06:53:30,691 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 207 transitions. [2024-11-12 06:53:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 06:53:30,692 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:30,693 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:53:30,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 06:53:30,693 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:30,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:30,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1710767814, now seen corresponding path program 1 times [2024-11-12 06:53:30,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:53:30,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840020443] [2024-11-12 06:53:30,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:30,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:53:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:35,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:53:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:35,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:53:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:35,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:53:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:35,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:53:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:35,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:53:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:35,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:53:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:35,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:53:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:35,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:53:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:35,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:53:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:35,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:53:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:35,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:53:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:35,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:53:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:35,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:53:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:35,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:53:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:35,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:53:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:35,293 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:53:35,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:53:35,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840020443] [2024-11-12 06:53:35,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840020443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:53:35,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:53:35,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 06:53:35,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225275298] [2024-11-12 06:53:35,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:53:35,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 06:53:35,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:53:35,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 06:53:35,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-12 06:53:35,297 INFO L87 Difference]: Start difference. First operand 145 states and 207 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 06:53:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:53:36,591 INFO L93 Difference]: Finished difference Result 203 states and 271 transitions. [2024-11-12 06:53:36,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 06:53:36,591 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-12 06:53:36,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:53:36,593 INFO L225 Difference]: With dead ends: 203 [2024-11-12 06:53:36,593 INFO L226 Difference]: Without dead ends: 201 [2024-11-12 06:53:36,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2024-11-12 06:53:36,595 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 188 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 06:53:36,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 505 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 06:53:36,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-12 06:53:36,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 143. [2024-11-12 06:53:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 94 states have (on average 1.2127659574468086) internal successors, (114), 94 states have internal predecessors, (114), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-12 06:53:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 204 transitions. [2024-11-12 06:53:36,617 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 204 transitions. Word has length 102 [2024-11-12 06:53:36,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:53:36,617 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 204 transitions. [2024-11-12 06:53:36,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 06:53:36,618 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 204 transitions. [2024-11-12 06:53:36,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 06:53:36,619 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:36,619 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:53:36,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 06:53:36,623 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:36,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:36,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1021349534, now seen corresponding path program 1 times [2024-11-12 06:53:36,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:53:36,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076721018] [2024-11-12 06:53:36,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:36,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:53:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:40,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:53:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:40,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:53:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:40,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:53:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:40,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:53:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:40,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:53:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:40,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:53:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:40,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:53:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:40,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:53:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:40,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:53:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:40,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:53:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:40,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:53:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:40,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:53:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:40,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:53:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:40,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:53:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:40,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:53:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:53:40,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:53:40,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076721018] [2024-11-12 06:53:40,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076721018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:53:40,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:53:40,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 06:53:40,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846515848] [2024-11-12 06:53:40,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:53:40,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 06:53:40,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:53:40,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 06:53:40,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-12 06:53:40,417 INFO L87 Difference]: Start difference. First operand 143 states and 204 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 06:53:41,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:53:41,358 INFO L93 Difference]: Finished difference Result 199 states and 267 transitions. [2024-11-12 06:53:41,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 06:53:41,359 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-12 06:53:41,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:53:41,360 INFO L225 Difference]: With dead ends: 199 [2024-11-12 06:53:41,360 INFO L226 Difference]: Without dead ends: 197 [2024-11-12 06:53:41,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2024-11-12 06:53:41,362 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 182 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 06:53:41,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 414 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 06:53:41,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-12 06:53:41,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 146. [2024-11-12 06:53:41,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 97 states have (on average 1.2164948453608246) internal successors, (118), 97 states have internal predecessors, (118), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-12 06:53:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 208 transitions. [2024-11-12 06:53:41,391 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 208 transitions. Word has length 102 [2024-11-12 06:53:41,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:53:41,392 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 208 transitions. [2024-11-12 06:53:41,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 06:53:41,392 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 208 transitions. [2024-11-12 06:53:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 06:53:41,394 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:41,394 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:53:41,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 06:53:41,394 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:41,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:41,396 INFO L85 PathProgramCache]: Analyzing trace with hash 870794071, now seen corresponding path program 1 times [2024-11-12 06:53:41,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:53:41,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847119059] [2024-11-12 06:53:41,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:41,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:53:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:46,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:53:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:46,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:53:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:46,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:53:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:46,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:53:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:46,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:53:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:46,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:53:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:46,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:53:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:46,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:53:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:46,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:53:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:46,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:53:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:46,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:53:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:46,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:53:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:46,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:53:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:46,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:53:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:46,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:53:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:53:46,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:53:46,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847119059] [2024-11-12 06:53:46,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847119059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:53:46,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:53:46,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 06:53:46,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602918162] [2024-11-12 06:53:46,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:53:46,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 06:53:46,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:53:46,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 06:53:46,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-11-12 06:53:46,809 INFO L87 Difference]: Start difference. First operand 146 states and 208 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 06:53:51,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:53:51,632 INFO L93 Difference]: Finished difference Result 217 states and 288 transitions. [2024-11-12 06:53:51,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 06:53:51,633 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-12 06:53:51,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:53:51,635 INFO L225 Difference]: With dead ends: 217 [2024-11-12 06:53:51,635 INFO L226 Difference]: Without dead ends: 215 [2024-11-12 06:53:51,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2024-11-12 06:53:51,636 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 199 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:53:51,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 494 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-12 06:53:51,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-12 06:53:51,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 158. [2024-11-12 06:53:51,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 109 states have internal predecessors, (133), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-12 06:53:51,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 223 transitions. [2024-11-12 06:53:51,653 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 223 transitions. Word has length 102 [2024-11-12 06:53:51,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:53:51,653 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 223 transitions. [2024-11-12 06:53:51,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 06:53:51,654 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 223 transitions. [2024-11-12 06:53:51,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 06:53:51,655 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:51,655 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:53:51,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 06:53:51,655 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:51,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:51,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1550852441, now seen corresponding path program 1 times [2024-11-12 06:53:51,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:53:51,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103760963] [2024-11-12 06:53:51,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:51,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:53:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:58,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:53:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:58,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:53:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:58,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:53:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:58,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:53:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:58,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:53:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:58,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:53:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:58,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:53:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:58,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:53:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:58,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:53:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:58,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:53:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:58,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:53:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:58,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:53:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:58,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:53:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:58,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:53:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:58,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:53:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:58,172 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:53:58,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:53:58,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103760963] [2024-11-12 06:53:58,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103760963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:53:58,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:53:58,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 06:53:58,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273807374] [2024-11-12 06:53:58,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:53:58,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 06:53:58,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:53:58,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 06:53:58,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-11-12 06:53:58,175 INFO L87 Difference]: Start difference. First operand 158 states and 223 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 06:54:05,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:54:05,144 INFO L93 Difference]: Finished difference Result 211 states and 282 transitions. [2024-11-12 06:54:05,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 06:54:05,147 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-12 06:54:05,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:54:05,149 INFO L225 Difference]: With dead ends: 211 [2024-11-12 06:54:05,149 INFO L226 Difference]: Without dead ends: 209 [2024-11-12 06:54:05,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=271, Invalid=659, Unknown=0, NotChecked=0, Total=930 [2024-11-12 06:54:05,151 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 165 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-12 06:54:05,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 457 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-12 06:54:05,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-12 06:54:05,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 158. [2024-11-12 06:54:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 109 states have internal predecessors, (133), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-12 06:54:05,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 223 transitions. [2024-11-12 06:54:05,175 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 223 transitions. Word has length 102 [2024-11-12 06:54:05,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:54:05,176 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 223 transitions. [2024-11-12 06:54:05,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 06:54:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 223 transitions. [2024-11-12 06:54:05,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 06:54:05,178 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:54:05,178 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:54:05,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 06:54:05,178 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:54:05,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:54:05,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1440692884, now seen corresponding path program 1 times [2024-11-12 06:54:05,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:54:05,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012779672] [2024-11-12 06:54:05,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:54:05,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:54:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:08,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:54:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:08,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:54:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:08,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:54:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:08,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:54:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:08,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:54:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:08,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:54:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:08,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:54:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:08,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:54:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:08,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:54:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:08,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:54:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:08,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:54:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:08,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:54:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:08,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:54:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:08,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:54:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:08,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:54:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:54:08,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:54:08,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012779672] [2024-11-12 06:54:08,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012779672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:54:08,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:54:08,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 06:54:08,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790916916] [2024-11-12 06:54:08,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:54:08,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 06:54:08,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:54:08,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 06:54:08,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-11-12 06:54:08,632 INFO L87 Difference]: Start difference. First operand 158 states and 223 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 06:54:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:54:09,366 INFO L93 Difference]: Finished difference Result 199 states and 268 transitions. [2024-11-12 06:54:09,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 06:54:09,367 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-11-12 06:54:09,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:54:09,369 INFO L225 Difference]: With dead ends: 199 [2024-11-12 06:54:09,369 INFO L226 Difference]: Without dead ends: 197 [2024-11-12 06:54:09,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2024-11-12 06:54:09,370 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 135 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 06:54:09,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 409 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 06:54:09,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-12 06:54:09,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 155. [2024-11-12 06:54:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 106 states have (on average 1.2169811320754718) internal successors, (129), 106 states have internal predecessors, (129), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-12 06:54:09,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 219 transitions. [2024-11-12 06:54:09,392 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 219 transitions. Word has length 103 [2024-11-12 06:54:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:54:09,392 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 219 transitions. [2024-11-12 06:54:09,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 06:54:09,393 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 219 transitions. [2024-11-12 06:54:09,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 06:54:09,394 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:54:09,395 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:54:09,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 06:54:09,395 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:54:09,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:54:09,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1453803125, now seen corresponding path program 1 times [2024-11-12 06:54:09,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:54:09,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986654576] [2024-11-12 06:54:09,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:54:09,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:54:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:14,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:54:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:14,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:54:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:14,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:54:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:14,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:54:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:14,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:54:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:14,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:54:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:14,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:54:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:14,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:54:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:14,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:54:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:14,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:54:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:15,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:54:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:15,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:54:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:15,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:54:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:15,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:54:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:15,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:54:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:15,020 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:54:15,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:54:15,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986654576] [2024-11-12 06:54:15,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986654576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:54:15,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:54:15,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 06:54:15,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482739388] [2024-11-12 06:54:15,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:54:15,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 06:54:15,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:54:15,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 06:54:15,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-12 06:54:15,022 INFO L87 Difference]: Start difference. First operand 155 states and 219 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 06:54:20,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:54:20,162 INFO L93 Difference]: Finished difference Result 217 states and 288 transitions. [2024-11-12 06:54:20,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 06:54:20,162 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 103 [2024-11-12 06:54:20,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:54:20,164 INFO L225 Difference]: With dead ends: 217 [2024-11-12 06:54:20,164 INFO L226 Difference]: Without dead ends: 215 [2024-11-12 06:54:20,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2024-11-12 06:54:20,165 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 205 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-12 06:54:20,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 378 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-12 06:54:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-12 06:54:20,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 158. [2024-11-12 06:54:20,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 109 states have internal predecessors, (133), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-12 06:54:20,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 223 transitions. [2024-11-12 06:54:20,181 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 223 transitions. Word has length 103 [2024-11-12 06:54:20,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:54:20,182 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 223 transitions. [2024-11-12 06:54:20,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 06:54:20,182 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 223 transitions. [2024-11-12 06:54:20,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 06:54:20,184 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:54:20,184 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:54:20,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 06:54:20,184 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:54:20,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:54:20,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1280161265, now seen corresponding path program 1 times [2024-11-12 06:54:20,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:54:20,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865610880] [2024-11-12 06:54:20,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:54:20,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:54:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:25,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:54:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:25,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:54:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:25,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:54:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:25,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:54:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:25,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:54:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:25,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:54:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:25,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:54:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:25,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:54:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:25,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:54:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:25,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:54:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:25,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:54:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:25,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:54:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:25,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:54:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:25,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:54:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:25,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:54:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:25,743 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:54:25,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:54:25,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865610880] [2024-11-12 06:54:25,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865610880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:54:25,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:54:25,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-12 06:54:25,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864380113] [2024-11-12 06:54:25,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:54:25,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 06:54:25,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:54:25,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 06:54:25,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-11-12 06:54:25,746 INFO L87 Difference]: Start difference. First operand 158 states and 223 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 06:54:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:54:29,701 INFO L93 Difference]: Finished difference Result 215 states and 286 transitions. [2024-11-12 06:54:29,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 06:54:29,701 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-11-12 06:54:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:54:29,703 INFO L225 Difference]: With dead ends: 215 [2024-11-12 06:54:29,703 INFO L226 Difference]: Without dead ends: 213 [2024-11-12 06:54:29,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=279, Invalid=843, Unknown=0, NotChecked=0, Total=1122 [2024-11-12 06:54:29,705 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 256 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:54:29,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 438 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 06:54:29,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-12 06:54:29,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 161. [2024-11-12 06:54:29,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 112 states have (on average 1.2232142857142858) internal successors, (137), 112 states have internal predecessors, (137), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-12 06:54:29,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 227 transitions. [2024-11-12 06:54:29,723 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 227 transitions. Word has length 103 [2024-11-12 06:54:29,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:54:29,723 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 227 transitions. [2024-11-12 06:54:29,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 06:54:29,724 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 227 transitions. [2024-11-12 06:54:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 06:54:29,726 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:54:29,726 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:54:29,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 06:54:29,726 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:54:29,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:54:29,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1846830135, now seen corresponding path program 1 times [2024-11-12 06:54:29,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:54:29,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960157209] [2024-11-12 06:54:29,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:54:29,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:54:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:34,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:54:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:34,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:54:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:34,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:54:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:34,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:54:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:34,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:54:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:34,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:54:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:34,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:54:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:34,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:54:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:34,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:54:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:34,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:54:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:34,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:54:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:34,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:54:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:34,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:54:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:34,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:54:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:34,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:54:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:54:34,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:54:34,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960157209] [2024-11-12 06:54:34,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960157209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:54:34,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:54:34,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 06:54:34,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299062001] [2024-11-12 06:54:34,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:54:34,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 06:54:34,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:54:34,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 06:54:34,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-12 06:54:34,304 INFO L87 Difference]: Start difference. First operand 161 states and 227 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)