./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-79.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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-79.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 1d35048482bec5585a23759f57e0e5f27fb64289f87c796a48314ffe6a1f4ee7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:11:44,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:11:44,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 09:11:44,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:11:44,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:11:44,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:11:44,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:11:44,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:11:44,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:11:44,580 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:11:44,581 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:11:44,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:11:44,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:11:44,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:11:44,585 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:11:44,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:11:44,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:11:44,586 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:11:44,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 09:11:44,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:11:44,587 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:11:44,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:11:44,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:11:44,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:11:44,589 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:11:44,590 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:11:44,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:11:44,590 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:11:44,591 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:11:44,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:11:44,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:11:44,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:11:44,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:11:44,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:11:44,593 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:11:44,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:11:44,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 09:11:44,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 09:11:44,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:11:44,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:11:44,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:11:44,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:11:44,595 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 -> 1d35048482bec5585a23759f57e0e5f27fb64289f87c796a48314ffe6a1f4ee7 [2024-11-20 09:11:44,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:11:44,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:11:44,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:11:44,891 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:11:44,891 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:11:44,892 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-79.i [2024-11-20 09:11:46,404 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:11:46,611 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:11:46,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-79.i [2024-11-20 09:11:46,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/727813f55/a8d9a85e6923494981df64ae7c7a56d3/FLAG7dbbdf328 [2024-11-20 09:11:46,986 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/727813f55/a8d9a85e6923494981df64ae7c7a56d3 [2024-11-20 09:11:46,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:11:46,990 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:11:46,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:11:46,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:11:46,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:11:46,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:11:46" (1/1) ... [2024-11-20 09:11:46,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@484e8bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:46, skipping insertion in model container [2024-11-20 09:11:46,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:11:46" (1/1) ... [2024-11-20 09:11:47,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:11:47,207 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-79.i[917,930] [2024-11-20 09:11:47,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:11:47,281 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:11:47,295 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-79.i[917,930] [2024-11-20 09:11:47,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:11:47,351 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:11:47,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:47 WrapperNode [2024-11-20 09:11:47,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:11:47,355 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:11:47,355 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:11:47,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:11:47,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:47" (1/1) ... [2024-11-20 09:11:47,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:47" (1/1) ... [2024-11-20 09:11:47,410 INFO L138 Inliner]: procedures = 30, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 416 [2024-11-20 09:11:47,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:11:47,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:11:47,416 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:11:47,416 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:11:47,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:47" (1/1) ... [2024-11-20 09:11:47,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:47" (1/1) ... [2024-11-20 09:11:47,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:47" (1/1) ... [2024-11-20 09:11:47,445 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-20 09:11:47,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:47" (1/1) ... [2024-11-20 09:11:47,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:47" (1/1) ... [2024-11-20 09:11:47,457 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:47" (1/1) ... [2024-11-20 09:11:47,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:47" (1/1) ... [2024-11-20 09:11:47,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:47" (1/1) ... [2024-11-20 09:11:47,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:47" (1/1) ... [2024-11-20 09:11:47,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:11:47,474 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:11:47,474 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:11:47,474 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:11:47,475 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:47" (1/1) ... [2024-11-20 09:11:47,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:11:47,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:11:47,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 09:11:47,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 09:11:47,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:11:47,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-20 09:11:47,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-20 09:11:47,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-20 09:11:47,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-20 09:11:47,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-20 09:11:47,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-20 09:11:47,581 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 09:11:47,581 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 09:11:47,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 09:11:47,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:11:47,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:11:47,785 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:11:47,788 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:11:48,402 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-11-20 09:11:48,403 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:11:48,420 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:11:48,421 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 09:11:48,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:11:48 BoogieIcfgContainer [2024-11-20 09:11:48,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:11:48,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:11:48,425 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:11:48,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:11:48,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:11:46" (1/3) ... [2024-11-20 09:11:48,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f632ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:11:48, skipping insertion in model container [2024-11-20 09:11:48,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:47" (2/3) ... [2024-11-20 09:11:48,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f632ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:11:48, skipping insertion in model container [2024-11-20 09:11:48,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:11:48" (3/3) ... [2024-11-20 09:11:48,431 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-79.i [2024-11-20 09:11:48,449 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:11:48,449 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 09:11:48,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:11:48,515 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;@9f10022, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:11:48,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 09:11:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:11:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-20 09:11:48,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:48,530 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:48,530 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:48,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:48,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1966256137, now seen corresponding path program 1 times [2024-11-20 09:11:48,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:48,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672962801] [2024-11-20 09:11:48,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:48,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:48,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:48,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:48,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:48,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:48,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:11:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:48,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:11:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:48,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 09:11:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:48,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:11:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:48,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 09:11:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:48,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:11:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:48,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:11:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:48,962 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:11:48,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:48,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672962801] [2024-11-20 09:11:48,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672962801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:48,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:48,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 09:11:48,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743625953] [2024-11-20 09:11:48,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:48,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 09:11:48,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:48,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 09:11:48,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:11:49,003 INFO L87 Difference]: Start difference. First operand has 95 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 09:11:49,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:49,029 INFO L93 Difference]: Finished difference Result 183 states and 281 transitions. [2024-11-20 09:11:49,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 09:11:49,032 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-11-20 09:11:49,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:49,039 INFO L225 Difference]: With dead ends: 183 [2024-11-20 09:11:49,039 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 09:11:49,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:11:49,046 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:49,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:11:49,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 09:11:49,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-20 09:11:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:11:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2024-11-20 09:11:49,093 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 101 [2024-11-20 09:11:49,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:49,094 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2024-11-20 09:11:49,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 09:11:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2024-11-20 09:11:49,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-20 09:11:49,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:49,101 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:49,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 09:11:49,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:49,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:49,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1580299313, now seen corresponding path program 1 times [2024-11-20 09:11:49,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:49,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759230195] [2024-11-20 09:11:49,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:49,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:11:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:11:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 09:11:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:11:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 09:11:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:11:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:11:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,512 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:11:49,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:49,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759230195] [2024-11-20 09:11:49,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759230195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:49,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:49,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:11:49,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730470261] [2024-11-20 09:11:49,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:49,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:11:49,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:49,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:11:49,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:11:49,519 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 09:11:49,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:49,574 INFO L93 Difference]: Finished difference Result 181 states and 262 transitions. [2024-11-20 09:11:49,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:11:49,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-11-20 09:11:49,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:49,579 INFO L225 Difference]: With dead ends: 181 [2024-11-20 09:11:49,579 INFO L226 Difference]: Without dead ends: 93 [2024-11-20 09:11:49,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-11-20 09:11:49,581 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:49,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:11:49,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-20 09:11:49,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-20 09:11:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:11:49,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2024-11-20 09:11:49,593 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 101 [2024-11-20 09:11:49,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:49,595 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2024-11-20 09:11:49,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 09:11:49,595 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2024-11-20 09:11:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-20 09:11:49,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:49,600 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:49,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 09:11:49,600 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:49,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:49,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1378475379, now seen corresponding path program 1 times [2024-11-20 09:11:49,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:49,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113779734] [2024-11-20 09:11:49,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:49,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:11:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:11:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 09:11:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:11:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 09:11:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:11:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:11:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:11:49,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:49,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113779734] [2024-11-20 09:11:49,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113779734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:49,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:49,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:11:49,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810187791] [2024-11-20 09:11:49,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:49,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:11:49,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:49,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:11:49,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:11:49,979 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:11:50,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:50,011 INFO L93 Difference]: Finished difference Result 185 states and 266 transitions. [2024-11-20 09:11:50,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:11:50,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-11-20 09:11:50,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:50,016 INFO L225 Difference]: With dead ends: 185 [2024-11-20 09:11:50,016 INFO L226 Difference]: Without dead ends: 95 [2024-11-20 09:11:50,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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-11-20 09:11:50,018 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:50,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:11:50,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-20 09:11:50,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-20 09:11:50,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:11:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2024-11-20 09:11:50,038 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 101 [2024-11-20 09:11:50,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:50,039 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2024-11-20 09:11:50,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:11:50,040 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2024-11-20 09:11:50,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-20 09:11:50,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:50,042 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:50,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 09:11:50,042 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:50,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:50,043 INFO L85 PathProgramCache]: Analyzing trace with hash -85394738, now seen corresponding path program 1 times [2024-11-20 09:11:50,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:50,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036307465] [2024-11-20 09:11:50,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:50,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:50,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:50,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:50,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:50,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:50,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:11:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:50,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:11:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:50,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 09:11:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:50,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:11:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:50,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 09:11:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:50,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:11:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:50,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:11:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:11:50,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:50,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036307465] [2024-11-20 09:11:50,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036307465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:50,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:50,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:11:50,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135083283] [2024-11-20 09:11:50,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:50,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:11:50,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:50,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:11:50,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:11:50,477 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:11:50,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:50,752 INFO L93 Difference]: Finished difference Result 215 states and 304 transitions. [2024-11-20 09:11:50,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:11:50,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-11-20 09:11:50,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:50,754 INFO L225 Difference]: With dead ends: 215 [2024-11-20 09:11:50,755 INFO L226 Difference]: Without dead ends: 123 [2024-11-20 09:11:50,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:11:50,756 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 35 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:50,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 450 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:11:50,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-20 09:11:50,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 97. [2024-11-20 09:11:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:11:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 137 transitions. [2024-11-20 09:11:50,765 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 137 transitions. Word has length 103 [2024-11-20 09:11:50,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:50,765 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 137 transitions. [2024-11-20 09:11:50,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:11:50,765 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2024-11-20 09:11:50,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-20 09:11:50,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:50,767 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:50,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 09:11:50,767 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:50,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:50,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1495965032, now seen corresponding path program 1 times [2024-11-20 09:11:50,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:50,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774886682] [2024-11-20 09:11:50,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:50,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:11:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:11:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 09:11:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:53,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:11:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 09:11:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:11:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:11:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:11:54,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:54,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774886682] [2024-11-20 09:11:54,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774886682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:54,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:54,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 09:11:54,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759246419] [2024-11-20 09:11:54,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:54,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 09:11:54,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:54,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 09:11:54,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-20 09:11:54,048 INFO L87 Difference]: Start difference. First operand 97 states and 137 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 09:11:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:55,478 INFO L93 Difference]: Finished difference Result 369 states and 521 transitions. [2024-11-20 09:11:55,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 09:11:55,479 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-11-20 09:11:55,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:55,482 INFO L225 Difference]: With dead ends: 369 [2024-11-20 09:11:55,482 INFO L226 Difference]: Without dead ends: 275 [2024-11-20 09:11:55,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2024-11-20 09:11:55,485 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 369 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:55,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 797 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 09:11:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-20 09:11:55,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 157. [2024-11-20 09:11:55,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 132 states have (on average 1.371212121212121) internal successors, (181), 132 states have internal predecessors, (181), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 09:11:55,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 225 transitions. [2024-11-20 09:11:55,513 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 225 transitions. Word has length 104 [2024-11-20 09:11:55,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:55,514 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 225 transitions. [2024-11-20 09:11:55,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 09:11:55,514 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 225 transitions. [2024-11-20 09:11:55,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-20 09:11:55,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:55,516 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:55,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 09:11:55,517 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:55,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:55,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1767514722, now seen corresponding path program 1 times [2024-11-20 09:11:55,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:55,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362506869] [2024-11-20 09:11:55,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:55,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:11:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:11:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 09:11:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:11:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 09:11:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:11:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:11:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:11:56,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:56,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362506869] [2024-11-20 09:11:56,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362506869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:56,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:56,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 09:11:56,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763731160] [2024-11-20 09:11:56,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:56,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 09:11:56,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:56,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 09:11:56,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 09:11:56,099 INFO L87 Difference]: Start difference. First operand 157 states and 225 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:11:56,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:56,528 INFO L93 Difference]: Finished difference Result 275 states and 395 transitions. [2024-11-20 09:11:56,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:11:56,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-20 09:11:56,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:56,534 INFO L225 Difference]: With dead ends: 275 [2024-11-20 09:11:56,535 INFO L226 Difference]: Without dead ends: 181 [2024-11-20 09:11:56,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 09:11:56,536 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 111 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:56,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 465 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 09:11:56,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-20 09:11:56,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 171. [2024-11-20 09:11:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 146 states have (on average 1.3904109589041096) internal successors, (203), 146 states have internal predecessors, (203), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 09:11:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 247 transitions. [2024-11-20 09:11:56,561 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 247 transitions. Word has length 105 [2024-11-20 09:11:56,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:56,562 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 247 transitions. [2024-11-20 09:11:56,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:11:56,562 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 247 transitions. [2024-11-20 09:11:56,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-20 09:11:56,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:56,564 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:56,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 09:11:56,565 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:56,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:56,565 INFO L85 PathProgramCache]: Analyzing trace with hash 533307868, now seen corresponding path program 1 times [2024-11-20 09:11:56,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:56,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442082427] [2024-11-20 09:11:56,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:56,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:57,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:11:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:57,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:11:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:57,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:11:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:11:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:11:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:11:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 09:11:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:11:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 09:11:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:11:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:11:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:11:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:11:58,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:11:58,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442082427] [2024-11-20 09:11:58,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442082427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:11:58,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:11:58,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 09:11:58,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330342212] [2024-11-20 09:11:58,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:11:58,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 09:11:58,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:11:58,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 09:11:58,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-20 09:11:58,101 INFO L87 Difference]: Start difference. First operand 171 states and 247 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:11:59,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:11:59,420 INFO L93 Difference]: Finished difference Result 405 states and 576 transitions. [2024-11-20 09:11:59,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 09:11:59,421 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-20 09:11:59,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:11:59,424 INFO L225 Difference]: With dead ends: 405 [2024-11-20 09:11:59,424 INFO L226 Difference]: Without dead ends: 303 [2024-11-20 09:11:59,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2024-11-20 09:11:59,425 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 409 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 09:11:59,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 763 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 09:11:59,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-20 09:11:59,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 173. [2024-11-20 09:11:59,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 148 states have (on average 1.3918918918918919) internal successors, (206), 148 states have internal predecessors, (206), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 09:11:59,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 250 transitions. [2024-11-20 09:11:59,457 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 250 transitions. Word has length 105 [2024-11-20 09:11:59,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:11:59,458 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 250 transitions. [2024-11-20 09:11:59,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:11:59,459 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 250 transitions. [2024-11-20 09:11:59,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-20 09:11:59,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:11:59,460 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:11:59,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 09:11:59,461 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:11:59,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:11:59,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1424201366, now seen corresponding path program 1 times [2024-11-20 09:11:59,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:11:59,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080776764] [2024-11-20 09:11:59,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:11:59,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:11:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:00,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:12:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:00,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:12:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:00,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:12:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:00,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:12:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:00,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:12:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:00,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:12:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:00,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 09:12:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:00,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:12:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:00,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 09:12:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:00,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:12:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:00,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:12:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:00,981 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:12:00,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:12:00,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080776764] [2024-11-20 09:12:00,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080776764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:12:00,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:12:00,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 09:12:00,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603180041] [2024-11-20 09:12:00,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:12:00,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 09:12:00,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:12:00,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 09:12:00,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-20 09:12:00,990 INFO L87 Difference]: Start difference. First operand 173 states and 250 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 09:12:01,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:12:01,621 INFO L93 Difference]: Finished difference Result 312 states and 446 transitions. [2024-11-20 09:12:01,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 09:12:01,622 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2024-11-20 09:12:01,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:12:01,624 INFO L225 Difference]: With dead ends: 312 [2024-11-20 09:12:01,624 INFO L226 Difference]: Without dead ends: 210 [2024-11-20 09:12:01,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-11-20 09:12:01,626 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 248 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 09:12:01,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 467 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 09:12:01,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-20 09:12:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 109. [2024-11-20 09:12:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 96 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:12:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2024-11-20 09:12:01,639 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 105 [2024-11-20 09:12:01,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:12:01,639 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2024-11-20 09:12:01,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 09:12:01,640 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2024-11-20 09:12:01,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-20 09:12:01,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:12:01,641 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:12:01,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 09:12:01,641 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:12:01,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:12:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2079739038, now seen corresponding path program 1 times [2024-11-20 09:12:01,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:12:01,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712958271] [2024-11-20 09:12:01,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:12:01,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:12:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:02,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:12:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:02,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:12:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:02,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:12:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:02,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:12:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:02,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:12:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:02,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:12:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:02,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 09:12:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:02,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:12:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:02,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 09:12:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:02,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:12:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:02,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:12:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:02,218 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:12:02,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:12:02,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712958271] [2024-11-20 09:12:02,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712958271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:12:02,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:12:02,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 09:12:02,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447675867] [2024-11-20 09:12:02,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:12:02,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 09:12:02,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:12:02,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 09:12:02,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 09:12:02,222 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:12:02,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:12:02,580 INFO L93 Difference]: Finished difference Result 254 states and 360 transitions. [2024-11-20 09:12:02,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:12:02,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-20 09:12:02,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:12:02,582 INFO L225 Difference]: With dead ends: 254 [2024-11-20 09:12:02,582 INFO L226 Difference]: Without dead ends: 148 [2024-11-20 09:12:02,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 09:12:02,583 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 169 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 09:12:02,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 542 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 09:12:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-20 09:12:02,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 126. [2024-11-20 09:12:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 113 states have (on average 1.3805309734513274) internal successors, (156), 113 states have internal predecessors, (156), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:12:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 178 transitions. [2024-11-20 09:12:02,598 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 178 transitions. Word has length 106 [2024-11-20 09:12:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:12:02,599 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 178 transitions. [2024-11-20 09:12:02,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:12:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 178 transitions. [2024-11-20 09:12:02,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-20 09:12:02,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:12:02,600 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:12:02,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 09:12:02,601 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:12:02,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:12:02,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1630390750, now seen corresponding path program 1 times [2024-11-20 09:12:02,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:12:02,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909152596] [2024-11-20 09:12:02,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:12:02,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:12:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:03,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:12:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:03,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:12:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:03,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:12:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:03,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:12:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:03,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:12:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:03,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:12:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:03,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 09:12:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:03,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:12:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:03,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 09:12:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:03,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:12:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:03,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:12:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:03,381 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:12:03,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:12:03,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909152596] [2024-11-20 09:12:03,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909152596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:12:03,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:12:03,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 09:12:03,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932073350] [2024-11-20 09:12:03,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:12:03,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 09:12:03,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:12:03,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 09:12:03,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-20 09:12:03,385 INFO L87 Difference]: Start difference. First operand 126 states and 178 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:12:03,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:12:03,985 INFO L93 Difference]: Finished difference Result 435 states and 614 transitions. [2024-11-20 09:12:03,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 09:12:03,985 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-20 09:12:03,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:12:03,987 INFO L225 Difference]: With dead ends: 435 [2024-11-20 09:12:03,987 INFO L226 Difference]: Without dead ends: 312 [2024-11-20 09:12:03,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-20 09:12:03,989 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 237 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 09:12:03,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 437 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 09:12:03,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-20 09:12:04,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 198. [2024-11-20 09:12:04,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 173 states have (on average 1.3872832369942196) internal successors, (240), 173 states have internal predecessors, (240), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 09:12:04,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 284 transitions. [2024-11-20 09:12:04,011 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 284 transitions. Word has length 106 [2024-11-20 09:12:04,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:12:04,011 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 284 transitions. [2024-11-20 09:12:04,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:12:04,012 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 284 transitions. [2024-11-20 09:12:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-20 09:12:04,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:12:04,013 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:12:04,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 09:12:04,014 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:12:04,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:12:04,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2077770532, now seen corresponding path program 1 times [2024-11-20 09:12:04,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:12:04,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172333718] [2024-11-20 09:12:04,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:12:04,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:12:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:04,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:12:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:04,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:12:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:04,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:12:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:04,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:12:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:04,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:12:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:04,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:12:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:04,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 09:12:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:04,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:12:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:04,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 09:12:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:04,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:12:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:04,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:12:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:12:04,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:12:04,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172333718] [2024-11-20 09:12:04,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172333718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:12:04,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:12:04,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:12:04,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543068391] [2024-11-20 09:12:04,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:12:04,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:12:04,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:12:04,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:12:04,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:12:04,208 INFO L87 Difference]: Start difference. First operand 198 states and 284 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:12:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:12:04,300 INFO L93 Difference]: Finished difference Result 319 states and 456 transitions. [2024-11-20 09:12:04,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:12:04,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-20 09:12:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:12:04,303 INFO L225 Difference]: With dead ends: 319 [2024-11-20 09:12:04,303 INFO L226 Difference]: Without dead ends: 195 [2024-11-20 09:12:04,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-11-20 09:12:04,304 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 09:12:04,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 327 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 09:12:04,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-20 09:12:04,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 124. [2024-11-20 09:12:04,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 111 states have (on average 1.3603603603603605) internal successors, (151), 111 states have internal predecessors, (151), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:12:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 173 transitions. [2024-11-20 09:12:04,317 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 173 transitions. Word has length 106 [2024-11-20 09:12:04,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:12:04,318 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 173 transitions. [2024-11-20 09:12:04,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:12:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 173 transitions. [2024-11-20 09:12:04,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-20 09:12:04,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:12:04,319 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:12:04,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 09:12:04,319 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:12:04,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:12:04,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1159429650, now seen corresponding path program 1 times [2024-11-20 09:12:04,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:12:04,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163808411] [2024-11-20 09:12:04,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:12:04,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:12:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:04,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:12:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:04,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:12:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:04,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:12:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:04,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:12:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:04,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:12:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:04,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:12:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 09:12:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:12:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 09:12:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:12:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:12:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:12:05,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:12:05,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163808411] [2024-11-20 09:12:05,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163808411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:12:05,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:12:05,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 09:12:05,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149488444] [2024-11-20 09:12:05,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:12:05,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 09:12:05,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:12:05,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 09:12:05,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-20 09:12:05,021 INFO L87 Difference]: Start difference. First operand 124 states and 173 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:12:05,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:12:05,658 INFO L93 Difference]: Finished difference Result 417 states and 581 transitions. [2024-11-20 09:12:05,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 09:12:05,658 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-20 09:12:05,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:12:05,660 INFO L225 Difference]: With dead ends: 417 [2024-11-20 09:12:05,660 INFO L226 Difference]: Without dead ends: 296 [2024-11-20 09:12:05,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-20 09:12:05,661 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 174 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 09:12:05,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 555 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 09:12:05,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-20 09:12:05,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 188. [2024-11-20 09:12:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 163 states have (on average 1.361963190184049) internal successors, (222), 163 states have internal predecessors, (222), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 09:12:05,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 266 transitions. [2024-11-20 09:12:05,688 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 266 transitions. Word has length 106 [2024-11-20 09:12:05,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:12:05,689 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 266 transitions. [2024-11-20 09:12:05,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:12:05,689 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 266 transitions. [2024-11-20 09:12:05,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-20 09:12:05,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:12:05,690 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:12:05,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 09:12:05,691 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:12:05,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:12:05,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2114469292, now seen corresponding path program 1 times [2024-11-20 09:12:05,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:12:05,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460106283] [2024-11-20 09:12:05,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:12:05,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:12:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:12:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:12:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:12:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:12:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:12:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:12:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 09:12:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:12:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 09:12:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:12:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:12:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:05,879 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:12:05,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:12:05,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460106283] [2024-11-20 09:12:05,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460106283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:12:05,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:12:05,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:12:05,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855824785] [2024-11-20 09:12:05,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:12:05,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:12:05,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:12:05,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:12:05,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:12:05,882 INFO L87 Difference]: Start difference. First operand 188 states and 266 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:12:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:12:05,993 INFO L93 Difference]: Finished difference Result 301 states and 425 transitions. [2024-11-20 09:12:05,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:12:05,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-20 09:12:05,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:12:05,995 INFO L225 Difference]: With dead ends: 301 [2024-11-20 09:12:05,995 INFO L226 Difference]: Without dead ends: 179 [2024-11-20 09:12:05,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-11-20 09:12:05,996 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 09:12:05,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 318 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 09:12:05,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-20 09:12:06,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 116. [2024-11-20 09:12:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 103 states have internal predecessors, (139), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:12:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 161 transitions. [2024-11-20 09:12:06,009 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 161 transitions. Word has length 106 [2024-11-20 09:12:06,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:12:06,009 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 161 transitions. [2024-11-20 09:12:06,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:12:06,009 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 161 transitions. [2024-11-20 09:12:06,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-20 09:12:06,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:12:06,010 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:12:06,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 09:12:06,011 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:12:06,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:12:06,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1327552241, now seen corresponding path program 1 times [2024-11-20 09:12:06,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:12:06,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832630739] [2024-11-20 09:12:06,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:12:06,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:12:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:06,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:12:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:06,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:12:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:06,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:12:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:06,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:12:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:06,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:12:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:06,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:12:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:06,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 09:12:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:06,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:12:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:06,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 09:12:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:06,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:12:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:06,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:12:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-20 09:12:06,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:12:06,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832630739] [2024-11-20 09:12:06,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832630739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:12:06,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:12:06,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 09:12:06,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024182238] [2024-11-20 09:12:06,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:12:06,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 09:12:06,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:12:06,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 09:12:06,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-20 09:12:06,595 INFO L87 Difference]: Start difference. First operand 116 states and 161 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-20 09:12:07,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:12:07,204 INFO L93 Difference]: Finished difference Result 277 states and 386 transitions. [2024-11-20 09:12:07,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 09:12:07,208 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 107 [2024-11-20 09:12:07,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:12:07,210 INFO L225 Difference]: With dead ends: 277 [2024-11-20 09:12:07,210 INFO L226 Difference]: Without dead ends: 164 [2024-11-20 09:12:07,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-11-20 09:12:07,212 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 197 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 09:12:07,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 389 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 09:12:07,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-20 09:12:07,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2024-11-20 09:12:07,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 136 states have internal predecessors, (180), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:12:07,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 220 transitions. [2024-11-20 09:12:07,235 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 220 transitions. Word has length 107 [2024-11-20 09:12:07,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:12:07,236 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 220 transitions. [2024-11-20 09:12:07,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-20 09:12:07,236 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 220 transitions. [2024-11-20 09:12:07,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-20 09:12:07,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:12:07,237 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:12:07,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 09:12:07,237 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:12:07,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:12:07,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1007866504, now seen corresponding path program 1 times [2024-11-20 09:12:07,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:12:07,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555144710] [2024-11-20 09:12:07,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:12:07,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:12:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:07,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:12:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:07,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:12:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:07,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:12:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:07,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:12:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:07,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:12:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:07,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:12:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:07,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 09:12:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:07,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:12:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:07,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 09:12:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:07,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:12:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:07,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:12:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:07,927 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:12:07,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:12:07,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555144710] [2024-11-20 09:12:07,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555144710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:12:07,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:12:07,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 09:12:07,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321904339] [2024-11-20 09:12:07,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:12:07,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 09:12:07,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:12:07,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 09:12:07,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 09:12:07,929 INFO L87 Difference]: Start difference. First operand 158 states and 220 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:12:08,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:12:08,313 INFO L93 Difference]: Finished difference Result 309 states and 426 transitions. [2024-11-20 09:12:08,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:12:08,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-11-20 09:12:08,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:12:08,316 INFO L225 Difference]: With dead ends: 309 [2024-11-20 09:12:08,316 INFO L226 Difference]: Without dead ends: 194 [2024-11-20 09:12:08,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-20 09:12:08,317 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 161 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 09:12:08,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 515 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 09:12:08,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-20 09:12:08,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 165. [2024-11-20 09:12:08,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 142 states have (on average 1.323943661971831) internal successors, (188), 143 states have internal predecessors, (188), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:12:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 228 transitions. [2024-11-20 09:12:08,342 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 228 transitions. Word has length 107 [2024-11-20 09:12:08,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:12:08,342 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 228 transitions. [2024-11-20 09:12:08,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:12:08,343 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 228 transitions. [2024-11-20 09:12:08,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-20 09:12:08,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:12:08,344 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:12:08,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 09:12:08,344 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:12:08,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:12:08,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1114702325, now seen corresponding path program 1 times [2024-11-20 09:12:08,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:12:08,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682023671] [2024-11-20 09:12:08,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:12:08,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:12:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:09,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:12:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:09,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:12:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:09,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:12:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:09,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:12:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:09,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:12:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:09,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:12:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:09,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 09:12:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:09,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:12:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:09,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 09:12:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:09,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:12:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:09,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:12:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-20 09:12:09,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:12:09,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682023671] [2024-11-20 09:12:09,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682023671] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:12:09,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376531788] [2024-11-20 09:12:09,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:12:09,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:12:09,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:12:09,678 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 09:12:09,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 09:12:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:09,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-20 09:12:09,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:12:11,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:12:11,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:12:11,654 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-20 09:12:11,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2024-11-20 09:12:11,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:12:11,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:12:11,871 INFO L349 Elim1Store]: treesize reduction 45, result has 25.0 percent of original size [2024-11-20 09:12:11,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2024-11-20 09:12:11,938 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-20 09:12:11,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2024-11-20 09:12:11,989 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-20 09:12:11,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2024-11-20 09:12:12,024 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-20 09:12:12,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:12:20,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376531788] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:12:20,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 09:12:20,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 24 [2024-11-20 09:12:20,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35523586] [2024-11-20 09:12:20,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 09:12:20,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-20 09:12:20,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:12:20,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-20 09:12:20,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=730, Unknown=2, NotChecked=0, Total=812 [2024-11-20 09:12:20,578 INFO L87 Difference]: Start difference. First operand 165 states and 228 transitions. Second operand has 24 states, 22 states have (on average 4.818181818181818) internal successors, (106), 23 states have internal predecessors, (106), 6 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (22), 5 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-20 09:12:24,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:12:24,331 INFO L93 Difference]: Finished difference Result 388 states and 525 transitions. [2024-11-20 09:12:24,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-20 09:12:24,331 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 4.818181818181818) internal successors, (106), 23 states have internal predecessors, (106), 6 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (22), 5 states have call predecessors, (22), 6 states have call successors, (22) Word has length 108 [2024-11-20 09:12:24,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:12:24,333 INFO L225 Difference]: With dead ends: 388 [2024-11-20 09:12:24,333 INFO L226 Difference]: Without dead ends: 256 [2024-11-20 09:12:24,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=660, Invalid=3244, Unknown=2, NotChecked=0, Total=3906 [2024-11-20 09:12:24,336 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 640 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 09:12:24,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 789 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-20 09:12:24,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-20 09:12:24,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 169. [2024-11-20 09:12:24,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 143 states have internal predecessors, (186), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 09:12:24,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 230 transitions. [2024-11-20 09:12:24,369 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 230 transitions. Word has length 108 [2024-11-20 09:12:24,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:12:24,369 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 230 transitions. [2024-11-20 09:12:24,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 4.818181818181818) internal successors, (106), 23 states have internal predecessors, (106), 6 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (22), 5 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-20 09:12:24,370 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 230 transitions. [2024-11-20 09:12:24,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-20 09:12:24,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:12:24,370 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:12:24,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 09:12:24,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-20 09:12:24,571 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:12:24,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:12:24,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1444146565, now seen corresponding path program 1 times [2024-11-20 09:12:24,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:12:24,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350862202] [2024-11-20 09:12:24,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:12:24,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:12:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:24,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:12:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:24,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:12:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:24,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:12:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:24,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:12:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:24,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:12:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:24,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:12:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:24,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 09:12:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:24,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:12:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:24,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 09:12:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:24,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:12:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:24,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:12:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:12:24,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:12:24,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350862202] [2024-11-20 09:12:24,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350862202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:12:24,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:12:24,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:12:24,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805799576] [2024-11-20 09:12:24,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:12:24,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:12:24,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:12:24,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:12:24,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:12:24,984 INFO L87 Difference]: Start difference. First operand 169 states and 230 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:12:25,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:12:25,229 INFO L93 Difference]: Finished difference Result 283 states and 388 transitions. [2024-11-20 09:12:25,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:12:25,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-20 09:12:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:12:25,232 INFO L225 Difference]: With dead ends: 283 [2024-11-20 09:12:25,232 INFO L226 Difference]: Without dead ends: 169 [2024-11-20 09:12:25,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 09:12:25,233 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 152 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:12:25,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 295 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:12:25,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-20 09:12:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-11-20 09:12:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 142 states have (on average 1.295774647887324) internal successors, (184), 143 states have internal predecessors, (184), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 09:12:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 228 transitions. [2024-11-20 09:12:25,266 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 228 transitions. Word has length 108 [2024-11-20 09:12:25,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:12:25,266 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 228 transitions. [2024-11-20 09:12:25,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:12:25,267 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 228 transitions. [2024-11-20 09:12:25,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-20 09:12:25,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:12:25,267 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:12:25,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 09:12:25,268 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:12:25,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:12:25,268 INFO L85 PathProgramCache]: Analyzing trace with hash -918244416, now seen corresponding path program 1 times [2024-11-20 09:12:25,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:12:25,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074943885] [2024-11-20 09:12:25,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:12:25,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:12:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 09:12:25,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1082837757] [2024-11-20 09:12:25,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:12:25,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:12:25,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:12:25,364 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 09:12:25,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 09:12:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:12:25,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-20 09:12:25,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:12:26,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:12:26,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:12:26,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:12:27,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:12:27,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:12:27,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:12:28,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:12:28,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:12:28,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-11-20 09:12:28,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:12:28,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:12:28,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:12:28,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:12:28,422 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2024-11-20 09:12:28,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 62 [2024-11-20 09:12:33,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:12:33,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:12:37,639 INFO L349 Elim1Store]: treesize reduction 972, result has 56.5 percent of original size [2024-11-20 09:12:37,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 19 select indices, 19 select index equivalence classes, 3 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 187 case distinctions, treesize of input 202 treesize of output 1364