./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-58.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 730b0997679b06e2176dc62362c6855c3d3cc0770153581e48e0f33bef8d293d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:00:38,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:00:38,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 12:00:38,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:00:38,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:00:38,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:00:38,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:00:38,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:00:38,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:00:38,676 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:00:38,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:00:38,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:00:38,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:00:38,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:00:38,678 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:00:38,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:00:38,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:00:38,679 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:00:38,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:00:38,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:00:38,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:00:38,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:00:38,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:00:38,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:00:38,685 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:00:38,685 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:00:38,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:00:38,686 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:00:38,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:00:38,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:00:38,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:00:38,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:00:38,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:00:38,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:00:38,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:00:38,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:00:38,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:00:38,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:00:38,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:00:38,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:00:38,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:00:38,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:00:38,692 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 -> 730b0997679b06e2176dc62362c6855c3d3cc0770153581e48e0f33bef8d293d [2024-10-24 12:00:38,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:00:39,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:00:39,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:00:39,006 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:00:39,007 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:00:39,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-58.i [2024-10-24 12:00:40,514 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:00:40,727 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:00:40,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-58.i [2024-10-24 12:00:40,744 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20dad78e6/438131a0b6a1432ba2378dc3a7a243dc/FLAGf39ce5aa4 [2024-10-24 12:00:40,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20dad78e6/438131a0b6a1432ba2378dc3a7a243dc [2024-10-24 12:00:40,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:00:40,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:00:40,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:00:40,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:00:40,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:00:40,773 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:00:40" (1/1) ... [2024-10-24 12:00:40,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7832ebfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:40, skipping insertion in model container [2024-10-24 12:00:40,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:00:40" (1/1) ... [2024-10-24 12:00:40,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:00:40,983 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-58.i[917,930] [2024-10-24 12:00:41,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:00:41,111 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:00:41,126 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-58.i[917,930] [2024-10-24 12:00:41,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:00:41,218 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:00:41,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:41 WrapperNode [2024-10-24 12:00:41,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:00:41,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:00:41,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:00:41,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:00:41,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:41" (1/1) ... [2024-10-24 12:00:41,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:41" (1/1) ... [2024-10-24 12:00:41,294 INFO L138 Inliner]: procedures = 26, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 447 [2024-10-24 12:00:41,295 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:00:41,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:00:41,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:00:41,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:00:41,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:41" (1/1) ... [2024-10-24 12:00:41,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:41" (1/1) ... [2024-10-24 12:00:41,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:41" (1/1) ... [2024-10-24 12:00:41,367 INFO L175 MemorySlicer]: Split 125 memory accesses to 2 slices as follows [2, 123]. 98 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 11]. The 15 writes are split as follows [0, 15]. [2024-10-24 12:00:41,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:41" (1/1) ... [2024-10-24 12:00:41,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:41" (1/1) ... [2024-10-24 12:00:41,383 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:41" (1/1) ... [2024-10-24 12:00:41,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:41" (1/1) ... [2024-10-24 12:00:41,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:41" (1/1) ... [2024-10-24 12:00:41,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:41" (1/1) ... [2024-10-24 12:00:41,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:00:41,415 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:00:41,415 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:00:41,415 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:00:41,416 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:41" (1/1) ... [2024-10-24 12:00:41,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:00:41,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:00:41,473 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 12:00:41,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 12:00:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:00:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 12:00:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 12:00:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 12:00:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 12:00:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 12:00:41,541 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 12:00:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:00:41,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 12:00:41,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:00:41,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:00:41,684 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:00:41,688 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:00:42,225 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-10-24 12:00:42,226 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:00:42,265 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:00:42,265 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 12:00:42,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:00:42 BoogieIcfgContainer [2024-10-24 12:00:42,266 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:00:42,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:00:42,268 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:00:42,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:00:42,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:00:40" (1/3) ... [2024-10-24 12:00:42,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a9a18c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:00:42, skipping insertion in model container [2024-10-24 12:00:42,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:00:41" (2/3) ... [2024-10-24 12:00:42,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a9a18c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:00:42, skipping insertion in model container [2024-10-24 12:00:42,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:00:42" (3/3) ... [2024-10-24 12:00:42,276 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-58.i [2024-10-24 12:00:42,293 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:00:42,293 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:00:42,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:00:42,368 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;@6badb5f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:00:42,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 12:00:42,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 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-10-24 12:00:42,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 12:00:42,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:42,387 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:00:42,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:42,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:42,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1527237723, now seen corresponding path program 1 times [2024-10-24 12:00:42,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:42,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956071746] [2024-10-24 12:00:42,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:42,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:00:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:00:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:00:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:00:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:00:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:42,953 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:00:42,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:42,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956071746] [2024-10-24 12:00:42,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956071746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:42,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:42,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:00:42,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948069032] [2024-10-24 12:00:42,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:42,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 12:00:42,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:42,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 12:00:42,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 12:00:43,001 INFO L87 Difference]: Start difference. First operand has 85 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 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 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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-10-24 12:00:43,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:43,045 INFO L93 Difference]: Finished difference Result 163 states and 259 transitions. [2024-10-24 12:00:43,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 12:00:43,050 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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 111 [2024-10-24 12:00:43,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:43,063 INFO L225 Difference]: With dead ends: 163 [2024-10-24 12:00:43,064 INFO L226 Difference]: Without dead ends: 79 [2024-10-24 12:00:43,069 INFO L431 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-10-24 12:00:43,072 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:43,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:00:43,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-24 12:00:43,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-24 12:00:43,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 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-10-24 12:00:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2024-10-24 12:00:43,130 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 111 [2024-10-24 12:00:43,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:43,132 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2024-10-24 12:00:43,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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-10-24 12:00:43,133 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2024-10-24 12:00:43,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 12:00:43,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:43,137 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:00:43,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:00:43,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:43,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:43,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1590311997, now seen corresponding path program 1 times [2024-10-24 12:00:43,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:43,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118297187] [2024-10-24 12:00:43,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:43,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:43,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:43,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:43,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:43,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:43,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:00:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:43,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:00:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:43,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:43,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:00:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:43,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:00:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:43,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:43,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:43,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:43,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:43,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:43,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:00:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:43,574 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:00:43,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:43,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118297187] [2024-10-24 12:00:43,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118297187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:43,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:43,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:00:43,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294084461] [2024-10-24 12:00:43,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:43,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:00:43,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:43,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:00:43,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:00:43,580 INFO L87 Difference]: Start difference. First operand 79 states and 113 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-10-24 12:00:43,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:43,635 INFO L93 Difference]: Finished difference Result 160 states and 229 transitions. [2024-10-24 12:00:43,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:00:43,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 111 [2024-10-24 12:00:43,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:43,638 INFO L225 Difference]: With dead ends: 160 [2024-10-24 12:00:43,639 INFO L226 Difference]: Without dead ends: 82 [2024-10-24 12:00:43,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:00:43,641 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 1 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:43,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 314 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:00:43,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-24 12:00:43,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2024-10-24 12:00:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 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-10-24 12:00:43,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-10-24 12:00:43,655 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 111 [2024-10-24 12:00:43,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:43,658 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-10-24 12:00:43,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-10-24 12:00:43,659 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-10-24 12:00:43,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 12:00:43,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:43,661 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:00:43,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:00:43,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:43,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:43,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1590252415, now seen corresponding path program 1 times [2024-10-24 12:00:43,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:43,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239580607] [2024-10-24 12:00:43,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:43,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:45,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:45,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:45,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:45,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:45,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:00:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:45,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:00:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:45,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:45,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:00:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:45,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:00:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:45,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:45,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:45,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:45,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:45,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:45,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:00:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:45,625 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:00:45,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:45,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239580607] [2024-10-24 12:00:45,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239580607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:45,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:45,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:00:45,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138527725] [2024-10-24 12:00:45,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:45,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:00:45,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:45,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:00:45,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:00:45,628 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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-10-24 12:00:46,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:46,268 INFO L93 Difference]: Finished difference Result 199 states and 282 transitions. [2024-10-24 12:00:46,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:00:46,269 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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 111 [2024-10-24 12:00:46,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:46,271 INFO L225 Difference]: With dead ends: 199 [2024-10-24 12:00:46,271 INFO L226 Difference]: Without dead ends: 119 [2024-10-24 12:00:46,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-24 12:00:46,273 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 220 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:46,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 235 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 12:00:46,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-24 12:00:46,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2024-10-24 12:00:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 74 states have (on average 1.337837837837838) internal successors, (99), 74 states have internal predecessors, (99), 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-10-24 12:00:46,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2024-10-24 12:00:46,297 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 111 [2024-10-24 12:00:46,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:46,298 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2024-10-24 12:00:46,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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-10-24 12:00:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2024-10-24 12:00:46,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 12:00:46,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:46,304 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:00:46,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 12:00:46,304 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:46,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:46,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1189822536, now seen corresponding path program 1 times [2024-10-24 12:00:46,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:46,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086400532] [2024-10-24 12:00:46,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:46,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:49,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:49,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:49,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:49,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:49,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:00:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:49,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:00:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:49,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:49,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:00:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:49,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:00:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:49,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:49,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:49,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:49,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:49,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:49,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:00:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:49,345 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:00:49,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:49,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086400532] [2024-10-24 12:00:49,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086400532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:49,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:49,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 12:00:49,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124273708] [2024-10-24 12:00:49,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:49,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 12:00:49,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:49,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 12:00:49,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:00:49,352 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 12:00:50,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:50,088 INFO L93 Difference]: Finished difference Result 222 states and 313 transitions. [2024-10-24 12:00:50,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:00:50,089 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 111 [2024-10-24 12:00:50,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:50,093 INFO L225 Difference]: With dead ends: 222 [2024-10-24 12:00:50,094 INFO L226 Difference]: Without dead ends: 132 [2024-10-24 12:00:50,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-24 12:00:50,096 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 417 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:50,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 282 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 12:00:50,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-24 12:00:50,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 105. [2024-10-24 12:00:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 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-10-24 12:00:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 148 transitions. [2024-10-24 12:00:50,130 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 148 transitions. Word has length 111 [2024-10-24 12:00:50,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:50,131 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 148 transitions. [2024-10-24 12:00:50,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 12:00:50,132 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 148 transitions. [2024-10-24 12:00:50,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 12:00:50,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:50,137 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:00:50,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 12:00:50,137 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:50,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:50,137 INFO L85 PathProgramCache]: Analyzing trace with hash -488757958, now seen corresponding path program 1 times [2024-10-24 12:00:50,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:50,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662523635] [2024-10-24 12:00:50,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:50,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:00:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:00:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:00:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:00:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:53,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:00:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:54,087 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:00:54,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:54,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662523635] [2024-10-24 12:00:54,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662523635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:54,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:54,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 12:00:54,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586030942] [2024-10-24 12:00:54,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:54,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 12:00:54,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:54,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 12:00:54,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:00:54,091 INFO L87 Difference]: Start difference. First operand 105 states and 148 transitions. Second operand has 12 states, 10 states have (on average 3.9) internal successors, (39), 12 states have internal predecessors, (39), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-24 12:00:55,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:55,565 INFO L93 Difference]: Finished difference Result 233 states and 327 transitions. [2024-10-24 12:00:55,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 12:00:55,568 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 12 states have internal predecessors, (39), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) Word has length 111 [2024-10-24 12:00:55,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:55,569 INFO L225 Difference]: With dead ends: 233 [2024-10-24 12:00:55,571 INFO L226 Difference]: Without dead ends: 129 [2024-10-24 12:00:55,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-10-24 12:00:55,573 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 274 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:55,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 319 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 12:00:55,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-24 12:00:55,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 105. [2024-10-24 12:00:55,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 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-10-24 12:00:55,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-10-24 12:00:55,607 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 111 [2024-10-24 12:00:55,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:55,609 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-10-24 12:00:55,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 12 states have internal predecessors, (39), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-24 12:00:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-10-24 12:00:55,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 12:00:55,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:55,614 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:00:55,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 12:00:55,614 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:55,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:55,615 INFO L85 PathProgramCache]: Analyzing trace with hash 2084076406, now seen corresponding path program 1 times [2024-10-24 12:00:55,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:55,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265391573] [2024-10-24 12:00:55,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:55,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:57,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:57,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:57,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:57,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:57,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:00:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:57,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:00:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:57,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:57,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:00:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:57,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:00:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:57,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:57,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:57,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:57,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:57,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:57,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:00:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:57,267 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:00:57,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:57,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265391573] [2024-10-24 12:00:57,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265391573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:57,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:57,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:00:57,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886338454] [2024-10-24 12:00:57,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:57,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:00:57,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:57,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:00:57,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:00:57,271 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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-10-24 12:00:58,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:58,299 INFO L93 Difference]: Finished difference Result 237 states and 331 transitions. [2024-10-24 12:00:58,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:00:58,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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 111 [2024-10-24 12:00:58,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:58,303 INFO L225 Difference]: With dead ends: 237 [2024-10-24 12:00:58,303 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 12:00:58,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-24 12:00:58,305 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 156 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:58,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 272 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 12:00:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 12:00:58,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 106. [2024-10-24 12:00:58,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 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-10-24 12:00:58,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2024-10-24 12:00:58,343 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 111 [2024-10-24 12:00:58,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:58,344 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2024-10-24 12:00:58,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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-10-24 12:00:58,344 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2024-10-24 12:00:58,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 12:00:58,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:58,348 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:00:58,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:00:58,348 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:58,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:58,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1509826312, now seen corresponding path program 1 times [2024-10-24 12:00:58,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:58,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704058919] [2024-10-24 12:00:58,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:58,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:59,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:00:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:59,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:00:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:59,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:00:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:59,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:00:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:59,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:00:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:59,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:00:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:59,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:00:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:59,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:00:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:59,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:00:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:59,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:00:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:59,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:00:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:59,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:00:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:59,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:00:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:59,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:00:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:59,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:00:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:00:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:00:59,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:00:59,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704058919] [2024-10-24 12:00:59,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704058919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:00:59,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:00:59,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:00:59,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669536417] [2024-10-24 12:00:59,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:00:59,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:00:59,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:00:59,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:00:59,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:00:59,095 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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-10-24 12:00:59,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:00:59,624 INFO L93 Difference]: Finished difference Result 238 states and 331 transitions. [2024-10-24 12:00:59,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:00:59,625 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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 111 [2024-10-24 12:00:59,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:00:59,626 INFO L225 Difference]: With dead ends: 238 [2024-10-24 12:00:59,626 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 12:00:59,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-24 12:00:59,628 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 120 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 12:00:59,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 514 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 12:00:59,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 12:00:59,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 106. [2024-10-24 12:00:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 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-10-24 12:00:59,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2024-10-24 12:00:59,660 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 111 [2024-10-24 12:00:59,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:00:59,660 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2024-10-24 12:00:59,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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-10-24 12:00:59,661 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2024-10-24 12:00:59,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 12:00:59,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:00:59,662 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:00:59,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 12:00:59,663 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:00:59,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:00:59,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1669361993, now seen corresponding path program 1 times [2024-10-24 12:00:59,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:00:59,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096189761] [2024-10-24 12:00:59,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:00:59,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:00:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:00,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:01:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:00,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:01:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:00,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:00,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:01:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:00,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:01:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:00,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:01:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:00,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:01:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:00,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:00,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:00,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:00,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:00,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:00,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:00,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:00,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:00,791 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:01:00,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:00,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096189761] [2024-10-24 12:01:00,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096189761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:00,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:00,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 12:01:00,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51657072] [2024-10-24 12:01:00,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:00,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 12:01:00,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:01:00,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 12:01:00,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:01:00,795 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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-10-24 12:01:01,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:01,787 INFO L93 Difference]: Finished difference Result 258 states and 359 transitions. [2024-10-24 12:01:01,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 12:01:01,788 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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 112 [2024-10-24 12:01:01,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:01,789 INFO L225 Difference]: With dead ends: 258 [2024-10-24 12:01:01,790 INFO L226 Difference]: Without dead ends: 153 [2024-10-24 12:01:01,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-24 12:01:01,791 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 249 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:01,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 331 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 12:01:01,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-24 12:01:01,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2024-10-24 12:01:01,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 102 states have internal predecessors, (137), 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-10-24 12:01:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 167 transitions. [2024-10-24 12:01:01,823 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 167 transitions. Word has length 112 [2024-10-24 12:01:01,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:01,824 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 167 transitions. [2024-10-24 12:01:01,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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-10-24 12:01:01,824 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 167 transitions. [2024-10-24 12:01:01,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 12:01:01,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:01,825 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:01:01,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 12:01:01,827 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:01,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:01,828 INFO L85 PathProgramCache]: Analyzing trace with hash -968297415, now seen corresponding path program 1 times [2024-10-24 12:01:01,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:01,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293426204] [2024-10-24 12:01:01,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:01,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:03,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:01:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:03,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:01:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:03,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:03,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:01:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:03,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:01:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:03,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:01:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:04,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:01:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:04,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:04,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:04,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:04,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:04,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:04,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:04,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:04,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:01:04,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:04,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293426204] [2024-10-24 12:01:04,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293426204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:04,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:04,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 12:01:04,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534124484] [2024-10-24 12:01:04,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:04,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 12:01:04,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:01:04,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 12:01:04,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:01:04,123 INFO L87 Difference]: Start difference. First operand 119 states and 167 transitions. Second operand has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 12:01:05,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:05,011 INFO L93 Difference]: Finished difference Result 267 states and 373 transitions. [2024-10-24 12:01:05,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:01:05,011 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 112 [2024-10-24 12:01:05,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:05,013 INFO L225 Difference]: With dead ends: 267 [2024-10-24 12:01:05,013 INFO L226 Difference]: Without dead ends: 149 [2024-10-24 12:01:05,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-24 12:01:05,016 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 288 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:05,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 238 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 12:01:05,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-24 12:01:05,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 119. [2024-10-24 12:01:05,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 102 states have internal predecessors, (136), 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-10-24 12:01:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 166 transitions. [2024-10-24 12:01:05,041 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 166 transitions. Word has length 112 [2024-10-24 12:01:05,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:05,041 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 166 transitions. [2024-10-24 12:01:05,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 12:01:05,042 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 166 transitions. [2024-10-24 12:01:05,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 12:01:05,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:05,043 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:01:05,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 12:01:05,043 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:05,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:05,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1268932114, now seen corresponding path program 1 times [2024-10-24 12:01:05,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:05,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494023212] [2024-10-24 12:01:05,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:05,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:05,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:01:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:05,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:01:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:05,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:05,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:01:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:05,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:01:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:05,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:01:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:05,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:01:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:05,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:05,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:05,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:05,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:05,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:05,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:05,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:05,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:05,977 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:01:05,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:05,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494023212] [2024-10-24 12:01:05,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494023212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:05,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:05,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:01:05,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134449911] [2024-10-24 12:01:05,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:05,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:01:05,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:01:05,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:01:05,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:01:05,983 INFO L87 Difference]: Start difference. First operand 119 states and 166 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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-10-24 12:01:06,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:06,622 INFO L93 Difference]: Finished difference Result 261 states and 362 transitions. [2024-10-24 12:01:06,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:01:06,623 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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 112 [2024-10-24 12:01:06,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:06,624 INFO L225 Difference]: With dead ends: 261 [2024-10-24 12:01:06,624 INFO L226 Difference]: Without dead ends: 143 [2024-10-24 12:01:06,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-24 12:01:06,626 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 187 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:06,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 271 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 12:01:06,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-24 12:01:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 117. [2024-10-24 12:01:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 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-10-24 12:01:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 161 transitions. [2024-10-24 12:01:06,649 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 161 transitions. Word has length 112 [2024-10-24 12:01:06,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:06,649 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 161 transitions. [2024-10-24 12:01:06,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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-10-24 12:01:06,650 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 161 transitions. [2024-10-24 12:01:06,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 12:01:06,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:06,651 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:01:06,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 12:01:06,651 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:06,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:06,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1037257401, now seen corresponding path program 1 times [2024-10-24 12:01:06,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:06,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433089406] [2024-10-24 12:01:06,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:06,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:08,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:01:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:08,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:01:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:08,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:08,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:01:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:08,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:01:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:08,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:01:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:08,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:01:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:08,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:08,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:08,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:08,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:08,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:08,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:08,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:08,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:01:08,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:08,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433089406] [2024-10-24 12:01:08,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433089406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:08,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:08,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 12:01:08,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238716579] [2024-10-24 12:01:08,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:08,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 12:01:08,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:01:08,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 12:01:08,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:01:08,836 INFO L87 Difference]: Start difference. First operand 117 states and 161 transitions. Second operand has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 12:01:09,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:09,657 INFO L93 Difference]: Finished difference Result 257 states and 353 transitions. [2024-10-24 12:01:09,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:01:09,658 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 112 [2024-10-24 12:01:09,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:09,660 INFO L225 Difference]: With dead ends: 257 [2024-10-24 12:01:09,660 INFO L226 Difference]: Without dead ends: 141 [2024-10-24 12:01:09,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-24 12:01:09,661 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 144 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:09,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 236 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 12:01:09,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-24 12:01:09,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 117. [2024-10-24 12:01:09,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.3) internal successors, (130), 100 states have internal predecessors, (130), 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-10-24 12:01:09,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 160 transitions. [2024-10-24 12:01:09,678 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 160 transitions. Word has length 112 [2024-10-24 12:01:09,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:09,681 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 160 transitions. [2024-10-24 12:01:09,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 12:01:09,681 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 160 transitions. [2024-10-24 12:01:09,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 12:01:09,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:09,683 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:01:09,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 12:01:09,683 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:09,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:09,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1738321979, now seen corresponding path program 1 times [2024-10-24 12:01:09,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:09,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644431619] [2024-10-24 12:01:09,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:09,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:11,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:01:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:11,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:01:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:11,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:11,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:01:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:11,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:01:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:11,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:01:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:11,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:01:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:11,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:11,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:11,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:11,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:11,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:11,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:11,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:11,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:01:11,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:11,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644431619] [2024-10-24 12:01:11,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644431619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:11,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:11,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 12:01:11,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055979533] [2024-10-24 12:01:11,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:11,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 12:01:11,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:01:11,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 12:01:11,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-10-24 12:01:11,594 INFO L87 Difference]: Start difference. First operand 117 states and 160 transitions. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 12:01:12,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:12,933 INFO L93 Difference]: Finished difference Result 257 states and 351 transitions. [2024-10-24 12:01:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 12:01:12,934 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 112 [2024-10-24 12:01:12,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:12,936 INFO L225 Difference]: With dead ends: 257 [2024-10-24 12:01:12,936 INFO L226 Difference]: Without dead ends: 141 [2024-10-24 12:01:12,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2024-10-24 12:01:12,937 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 191 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:12,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 499 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 12:01:12,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-24 12:01:12,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 114. [2024-10-24 12:01:12,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 97 states have internal predecessors, (126), 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-10-24 12:01:12,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 156 transitions. [2024-10-24 12:01:12,958 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 156 transitions. Word has length 112 [2024-10-24 12:01:12,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:12,959 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 156 transitions. [2024-10-24 12:01:12,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 12:01:12,959 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 156 transitions. [2024-10-24 12:01:12,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 12:01:12,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:12,960 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:01:12,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 12:01:12,960 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:12,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:12,961 INFO L85 PathProgramCache]: Analyzing trace with hash 419043591, now seen corresponding path program 1 times [2024-10-24 12:01:12,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:12,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663434651] [2024-10-24 12:01:12,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:12,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:14,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:01:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:14,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:01:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:14,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:14,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:01:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:14,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:01:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:14,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:01:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:14,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:01:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:14,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:14,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:14,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:14,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:14,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:14,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:14,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:14,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:14,994 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 12:01:14,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:14,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663434651] [2024-10-24 12:01:14,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663434651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:14,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:14,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 12:01:14,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708869399] [2024-10-24 12:01:14,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:14,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 12:01:14,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:01:14,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 12:01:14,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-10-24 12:01:14,997 INFO L87 Difference]: Start difference. First operand 114 states and 156 transitions. Second operand has 15 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 15 states have internal predecessors, (41), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-24 12:01:16,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:16,089 INFO L93 Difference]: Finished difference Result 270 states and 363 transitions. [2024-10-24 12:01:16,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 12:01:16,091 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 15 states have internal predecessors, (41), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) Word has length 113 [2024-10-24 12:01:16,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:16,092 INFO L225 Difference]: With dead ends: 270 [2024-10-24 12:01:16,092 INFO L226 Difference]: Without dead ends: 157 [2024-10-24 12:01:16,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2024-10-24 12:01:16,094 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 364 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:16,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 407 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 12:01:16,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-24 12:01:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 134. [2024-10-24 12:01:16,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 117 states have internal predecessors, (147), 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-10-24 12:01:16,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 177 transitions. [2024-10-24 12:01:16,113 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 177 transitions. Word has length 113 [2024-10-24 12:01:16,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:16,113 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 177 transitions. [2024-10-24 12:01:16,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 15 states have internal predecessors, (41), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-24 12:01:16,114 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 177 transitions. [2024-10-24 12:01:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 12:01:16,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:16,116 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:01:16,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 12:01:16,116 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:16,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:16,116 INFO L85 PathProgramCache]: Analyzing trace with hash -72732070, now seen corresponding path program 1 times [2024-10-24 12:01:16,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:16,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078527194] [2024-10-24 12:01:16,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:16,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat